Abstract
Parsing for a wide variety of grammar formalisms can be performed by intersecting finite tree automata. However, naive implementations of parsing by intersection are very inefficient. We present techniques that speed up tree-automata-based parsing, to the point that it becomes practically feasible on realistic data when applied to context-free, TAG, and graph parsing. For graph parsing, we obtain the best runtimes in the literature.
| Original language | English |
|---|---|
| Title of host publication | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 - Long Papers |
| Publisher | Association for Computational Linguistics (ACL) |
| Pages | 2042-2051 |
| Number of pages | 10 |
| Volume | 4 |
| ISBN (Electronic) | 9781510827585 |
| DOIs | |
| Publication status | Published - 2016 |
| Event | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 - Berlin, Germany Duration: 7 Aug 2016 → 12 Aug 2016 |
Other
| Other | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 |
|---|---|
| Country/Territory | Germany |
| City | Berlin |
| Period | 7/08/16 → 12/08/16 |
Bibliographical note
Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.Fingerprint
Dive into the research topics of 'Efficient techniques for parsing with tree automata'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver