Word Ordering as a Graph Rewriting Process - HAL Accéder directement au contenu
Communication dans un congrès Année : 2016

Word Ordering as a Graph Rewriting Process

Résumé

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.
Fichier principal
Vignette du fichier
gup-linearization-fg2016.pdf ( 983.11 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-01740481, version 1 (19-09-2019)

Identifiants

  • HAL Id : halshs-01740481 , version 1

Citer

Sylvain Kahane, François Lareau. Word Ordering as a Graph Rewriting Process. Formal Grammar, Aug 2016, Bolzano, Italy. ⟨halshs-01740481⟩
40 Consultations
108 Téléchargements
Dernière date de mise à jour le 21/04/2024
comment ces indicateurs sont-ils produits

Partager

Gmail Facebook Twitter LinkedIn Plus