Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
On multiple context-free grammars
Theoretical Computer Science
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Foundations of statistical natural language processing
Foundations of statistical natural language processing
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
An efficient context-free parsing algorithm
Communications of the ACM
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Computation of the probability of initial substring generation by stochastic context-free grammars
Computational Linguistics
Prefix probabilities from stochastic Tree Adjoining Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Recognition of linear context-free rewriting systems
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Generalized multitext grammars
ACL '04 Proceedings of the 42nd Annual Meeting on Association for 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
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Treebank grammar techniques for non-projective dependency parsing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Binarization of synchronous context-free grammars
Computational Linguistics
An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
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
Optimal rank reduction for linear context-free rewriting systems with fan-out two
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Computing Partition Functions of PCFGs
Research on Language and Computation
Data-driven parsing with probabilistic linear context-free rewriting systems
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Parsing Beyond Context-Free Grammars
Parsing Beyond Context-Free Grammars
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Prefix probability for probabilistic synchronous context-free grammars
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Intersection for weighted formalisms
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and tree adjoining grammars. In addition, the methodology is general enough to be used for a wider range of problems involving, for example, several prefixes.