Journal of Logic, Language and Information 18 (3):293-316 (2009)
AbstractPolarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms.
Similar books and articles
Lambda Grammars and the Syntax-Semantics Interface.Reinhard Muskens - 2001 - In Robert Van Rooij & Martin Stokhof (eds.), Proceedings of the Thirteenth Amsterdam Colloquium. Amsterdam: ILLC. pp. 150-155.
Tree models and (labeled) categorial grammar.Yde Venema - 1996 - Journal of Logic, Language and Information 5 (3-4):253-277.
Categorial Grammar and Lexical-Functional Grammar.Reinhard Muskens - 2001 - In Miriam Butt & Tracey Holloway King (eds.), Proceedings of the LFG01 Conference, University of Hong Kong. Stanford, CA: CSLI Publications. pp. 259-279.
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.
Unification grammars and off-line parsability.Efrat Jaeger, Nissim Francez & Shuly Wintner - 2005 - Journal of Logic, Language and Information 14 (2):199-234.
Grammar formalisms viewed as evolving algebras.David E. Johnson & Lawrence S. Moss - 1994 - Linguistics and Philosophy 17 (6):537 - 560.
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete.Lucas Champollion - 2011 - Journal of Logic, Language and Information 20 (3):343-359.
Added to PP
Historical graph of downloads