Abstract
Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars (PUG). We show that attaching polarities to tree nodes renders the combination operation non-associative, and in practice leads to overgeneration. We first provide some examples of non-associative combination operators in existing polarity-based formalisms. We then prove that there is no other nontrivial polarity system for which grammar combination is associative. This property of polarities casts doubt on the usability of polarity-based grammars for grammar engineering. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Cohen-Sygal, Y., & Wintner, S. (2007). The non-associativity of polarized tree-based grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4394 LNCS, pp. 208–217). Springer Verlag. https://doi.org/10.1007/978-3-540-70939-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
