Graduate studies at Western
|Abstract||While Ç ´Ò¿ µ methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies, has not yet been provided. This paper presents such an algorithm, and shows its correctness and advantages over prior work. The paper ﬁnishes by bringing out the connections between the algorithm and work on hypergraphs, which permits us to extend the presented Viterbi (best parse) algorithm to an inside (total probability) algorithm|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Christopher Manning, An ¢¡¤£¦¥¨§ Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars.
Gabriel Infante-Lopez & Maarten De Rijke (2006). A Note on the Expressive Power of Probabilistic Context Free Grammars. Journal of Logic, Language and Information 15 (3):219-231.
Denis Béchet, Annie Foret & Isabelle Tellier (2007). Learnability of Pregroup Grammars. Studia Logica 87 (2-3):225 - 252.
Anne Preller (2007). Linear Processing with Pregroups. Studia Logica 87 (2-3):171 - 197.
Christopher D. Manning & Kristina Toutanova, Feature Selection for a Rich HPSG Grammar Using Decision Trees.
Philippe de Groote & Sylvain Pogodalla (2004). On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. [REVIEW] Journal of Logic, Language and Information 13 (4):421-438.
Joyce Friedman & David S. Warren (1978). A Parsing Method for Montague Grammars. Linguistics and Philosophy 2 (3):347 - 372.
Tobias Kuhn (2013). A Principled Approach to Grammars for Controlled Natural Languages and Predictive Editors. Journal of Logic, Language and Information 22 (1):33-70.
Dan Klein & Christopher D. Manning, Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank.
Mati Pentus (1997). Product-Free Lambek Calculus and Context-Free Grammars. Journal of Symbolic Logic 62 (2):648-660.
Added to index2010-12-22
Total downloads2 ( #248,212 of 757,546 )
Recent downloads (6 months)2 ( #38,592 of 757,546 )
How can I increase my downloads?