Journal of Logic, Language and Information 15 (3):219-231 (2006)
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering out unwanted parses. Probabilities in PCFGs induce an ordering relation among the set of trees that yield a given input sentence. PCFG parsers return the trees bearing the maximum probability for a given sentence, discarding all other possible trees. This mechanism is naturally viewed as a way of defining a new class of tree languages. We formalize the tree language thus defined, study its expressive power, and show that the latter is beyond context freeness. While the increased expressive power offered by PCFGs helps to reduce ambiguity, we show that, in general, it cannot be decided whether a PCFG removes all ambiguities.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Foundations of Statistical Natural Language Processing.Christopher Manning & Hinrich Schütze - 1999 - MIT Press.
Citations of this work BETA
No citations found.
Similar books and articles
On Restrictions on Transformational Grammars Reducing the Generative Power.Theo Janssen, Gerard Kok & Lambert Meertens - 1977 - Linguistics and Philosophy 1 (1):111 - 118.
An Ç ´Ò¿ Μ Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars.Dan Klein & Christopher D. Manning - unknown
Feature Selection for a Rich HPSG Grammar Using Decision Trees.Christopher D. Manning & Kristina Toutanova - unknown
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars.Stephan Kepser & Jim Rogers - 2011 - Journal of Logic, Language and Information 20 (3):361-384.
Highly Constrained Unification Grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars.Makoto Kanazawa - 2010 - Journal of Logic, Language and Information 19 (2):137-161.
On Fork Arrow Logic and its Expressive Power.Paulo A. S. Veloso, Renata P. de Freitas, Petrucio Viana, Mario Benevides & Sheila R. M. Veloso - 2007 - Journal of Philosophical Logic 36 (5):489 - 509.
Product-Free Lambek Calculus and Context-Free Grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. [REVIEW]Philippe de Groote & Sylvain Pogodalla - 2004 - Journal of Logic, Language and Information 13 (4):421-438.
Added to index2009-01-28
Total downloads15 ( #302,728 of 2,143,905 )
Recent downloads (6 months)2 ( #280,613 of 2,143,905 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.