Polarized Unification Grammars

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-univ-paris10.archives-ouvertes.fr/hal-02292741
Contributor : Administrateur Hal Nanterre <>
Submitted on : Friday, September 20, 2019 - 10:38:10 AM
Last modification on : Sunday, September 22, 2019 - 1:13:39 AM

File

pug-acl2006.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sylvain Kahane. Polarized Unification Grammars. Coling-ACL, 2006, Sydney, Australia. ⟨10.3115/1220175.1220193⟩. ⟨hal-02292741⟩

Share

Metrics

Record views

19

Files downloads

46