Polarized unification grammars

Authors:
Sylvain Kahane
Affiliations:
Modyco, Université Paris
Venue:
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Year:
2006

Citing 6
Cited 8

Linear logic

Theoretical Computer Science
Higher-dimensional word problems with applications to equational logic

Selected papers of the 4th summer conference on Category theory and computer science
Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
Synchronous tree-adjoining grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Interaction Grammars

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation

COLING '04 Proceedings of the 20th international conference on Computational Linguistics

A polynomial parsing algorithm for the topological model: synchronizing constituent and dependency grammars, illustrated by German word order phenomena

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
The Non-associativity of Polarized Tree-Based Grammars

CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Associative Grammar Combination Operators for Tree-Based Grammars

Journal of Logic, Language and Information
A toolchain for grammarians

COLING '08 22nd International Conference on on Computational Linguistics: Demonstration Papers
Interaction grammar for the Persian language: noun and adjectival phrases

ALR7 Proceedings of the 7th Workshop on Asian Language Resources
Dependency constraints for lexical disambiguation

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Interaction Grammars

Research on Language and Computation
Towards modular development of typed unification grammars

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.