论文信息 - Polarized Unification Grammars

Polarized Unification Grammars

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.

Sylvain Kahane

[1] J. Bresnan. Lexical-Functional Syntax , 2000 .

[2] Alexis Nasr. A Formalism and a Parser for Lexicalised Dependency Grammars , 1995, IWPT.

[3] Sylvain Kahane,et al. Meaning-Text Unification Grammar: modularity and polarization , 2005 .

[4] Stefan Thater,et al. Parsing with Tree Descriptions: a constraint-based approach , 1999 .

[5] Egbert R. Van Kampen. On Some Lemmas in the Theory of Groups , 1933 .

[6] Stephan Kepser. Graph Properties of HPSG Feature Structures , 2003 .

[7] Albert Burroni,et al. Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

[8] K. Vijay-Shanker,et al. Using Descriptions of Trees in a Tree Adjoining Grammar , 1992, Comput. Linguistics.

[9] Sylvain Kahane,et al. Meaning-text unification grammar: modularity and polarity , 2005 .

[10] Guy Perrier. Interaction Grammars , 2000, COLING.

[11] Bruno Guillaume,et al. Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation , 2004, COLING.

[12] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[13] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..

[14] Marc Dymetman. Some Remarks on the Geometry of Grammar , 1999, ArXiv.

[15] Stuart M. Shieber,et al. Synchronous Tree-Adjoining Grammars , 1990, COLING.