A polynomial parsing algorithm for the topological model - Synchronizing Constituent and Dependency Grammars - Illustrated by German Word Order Phenomena

Kim Gerdes (1) , Sylvain Kahane (2)

1 ERSS - Equipe de Recherche en Syntaxe et Sémantique
2 MoDyCo - Modèles, Dynamiques, Corpus

This paper describes a minimal topology driven parsing algorithm for topological grammars that synchronizes a rewriting grammar and a dependency grammar, obtaining two linguistically motivated syntactic structures. The use of non-local slash and visitor features can be restricted to obtain a CKY type analysis in polynomial time. German long distance phenomena illustrate the algorithm, bringing to the fore the procedural needs of the analyses of syntax-topology mismatches in constraint based approaches like for example HPSG.

Mots clés: dependency grammar

Domaines: Linguistique

Kim Gerdes, Sylvain Kahane. A polynomial parsing algorithm for the topological model - Synchronizing Constituent and Dependency Grammars - Illustrated by German Word Order Phenomena. Coling-ACL, 2006, Sydney, Australia. pp.8, ⟨10.3115/1220175.1220313⟩. ⟨halshs-00120415⟩