Journal of Logic, Language and Information 18 (3) (2009)
|Abstract||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||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
David E. Johnson & Lawrence S. Moss (1994). Grammar Formalisms Viewed as Evolving Algebras. Linguistics and Philosophy 17 (6):537 - 560.
Efrat Jaeger, Nissim Francez & Shuly Wintner (2005). Unification Grammars and Off-Line Parsability. Journal of Logic, Language and Information 14 (2).
Stephan Kepser & Jim Rogers (2011). The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars. Journal of Logic, Language and Information 20 (3):361-384.
Eva Koktova (1999). Word-Order Based Grammar. Mouton De Gruyter.
Yde Venema (1996). Tree Models and (Labeled) Categorial Grammar. Journal of Logic, Language and Information 5 (3-4):253-277.
Gérold Stahl (1986). Á la Recherche d'Une Grammaire Universelle. Theoria 2 (1):61-68.
Lucas Champollion (2011). Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete. Journal of Logic, Language and Information 20 (3):343-359.
Added to index2009-01-28
Total downloads2 ( #232,628 of 549,198 )
Recent downloads (6 months)0
How can I increase my downloads?