This paper shows how the correspondence between a unordered dependency tree and a sentence that expresses it can be achieved by transforming the tree into a string where each linear precedence link corresponds to one specific syntactic relation. We propose a formal grammar with a distributed architecture that can be used for both synthesis and analysis. We argue for the introduction of a topological tree as an intermediate step between dependency syntax and word order.
CITATION STYLE
Kahane, S., & Lareau, F. (2016). Word ordering as a graph rewriting process. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9804 LNCS, pp. 216–239). Springer Verlag. https://doi.org/10.1007/978-3-662-53042-9_13
Mendeley helps you to discover research relevant for your work.