Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient string matching: an aid to bibliographic search
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Computation of Substring Probabilities in Stochastic Grammars
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Computation of the probability of initial substring generation by stochastic context-free grammars
Computational Linguistics
Estimation of probabilistic context-free grammars
Computational Linguistics
Statistical properties of probabilistic context-free grammars
Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
On the convergence of Newton's method for monotone systems of polynomial equations
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
PReMo: an analyzer for probabilistic recursive models
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Computing Partition Functions of PCFGs
Research on Language and Computation
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
Intersection for weighted formalisms
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Stochastic context-free grammars, regular languages, and newton's method
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction. For the case where a probabilistic context-free grammar is used as language model, methods for the computation of infix probabilities have been presented in the literature, based on various simplifying assumptions. Here we present a solution that applies to the problem in its full generality.