Abstract
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG. © 2006 Association for Computational Linguistics.
Cite
CITATION STYLE
Kahane, S. (2006). Polarized unification grammars. In COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Vol. 1, pp. 137–144). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1220175.1220193
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
