Enhancing practical TAG parsing efficiency by capturing redundancy

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

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01309598
Contributor : Jakub Waszczuk <>
Submitted on : Tuesday, May 3, 2016 - 11:29:35 AM
Last modification on : Tuesday, July 2, 2019 - 4:02:04 PM

File

ciaa2016-TAG-parser-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01309598, version 2

Citation

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⟩

Share

Metrics

Record views

267

Files downloads

699