Enhancing practical TAG parsing efficiency by capturing redundancy - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Enhancing practical TAG parsing efficiency by capturing redundancy

Résumé

Parsing efficiency within the context of tree adjoining grammars (TAGs) depends not only on the size of the input sentence but also, linearly, on the size of the input TAG, which can attain several thousands of elementary trees. We propose a factorized, finite-state TAG representation which copes with this combinatorial explosion. The associated parsing algorithm substantially increases the parsing performance on a real-size French TAG grammar.
Fichier principal
Vignette du fichier
ciaa2016-TAG-parser-final.pdf (376.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01309598 , version 1 (29-04-2016)
hal-01309598 , version 2 (03-05-2016)

Identifiants

  • HAL Id : hal-01309598 , version 2

Citer

Jakub Waszczuk, Agata Savary, Yannick Parmentier. Enhancing practical TAG parsing efficiency by capturing redundancy. 21st International Conference on Implementation and Application of Automata (CIAA 2016), Jul 2016, Séoul, South Korea. ⟨hal-01309598v2⟩
203 Consultations
442 Téléchargements

Partager

Gmail Facebook X LinkedIn More