Compact encoding of probabilistic languages
Compact encoding of probabilistic languages
Formal languages and their relation to automata
Formal languages and their relation to automata
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Probabilistic representation of formal languages
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
LIME: A System for Learning Relations
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
A Theory of Stochastic Grammars
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
A probabilistic model of computing with words
Journal of Computer and System Sciences
Probabilistic Context-Free Grammars Estimated from Infinite Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Inference of Finite-State Probabilistic Grammars
IEEE Transactions on Computers
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
IEEE Transactions on Computers
Solution of an Open Problem on Probabilistic Grammars
IEEE Transactions on Computers
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages
IEEE Transactions on Computers
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Relevant Representations for the Inference of Rational Stochastic Tree Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Linguistic theory in statistical language learning
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
Estimation of stochastic context-free grammars and their use as language models
Computer Speech and Language
A bibliographical study of grammatical inference
Pattern Recognition
The generative power of probabilistic and weighted context-free grammars
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Consistency of stochastic context-free grammars
Mathematical and Computer Modelling: An International Journal
An instrumentation system to measure user performance in interactive systems
Journal of Systems and Software
Fundamenta Informaticae
A general technique to train language models on language models
Computational Linguistics
| Hi-index | 15.00 |
The problem of assigning a probability to each word of a language is considered. Two methods are discussed. One method assigns a probability to a word on the basis of particular measurable features of the language. The second method is applied to languages L(G) generated by a grammar G. A probability is associated with each production of G. These in turn define the word probabilities of each word in the language. The conditions for this assignment to be a probabilistic measure are derived.