Journal of Logic, Language and Information 18 (3):293-316 (2009)
Polarized 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.
|Keywords||Polarized unification grammar Grammatical formalisms Modularity Grammar combination|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Grammar Formalisms Viewed as Evolving Algebras.David E. Johnson & Lawrence S. Moss - 1994 - Linguistics and Philosophy 17 (6):537 - 560.
Unification Grammars and Off-Line Parsability.Efrat Jaeger, Nissim Francez & Shuly Wintner - 2005 - Journal of Logic, Language and Information 14 (2):199-234.
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.
Tree Models and (Labeled) Categorial Grammar.Yde Venema - 1996 - Journal of Logic, Language and Information 5 (3-4):253-277.
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 index2009-01-28
Total downloads49 ( #106,465 of 2,169,136 )
Recent downloads (6 months)1 ( #345,573 of 2,169,136 )
How can I increase my downloads?