Abstract
We show how to augment a finite-state grammar with annotations which allow dependency structures to be extracted. There are some difficulties in determinising the grammar, which is an essential step for computational efficiency, but they can be overcome. The parser also allows syntactically ambiguous structures to be packed into a single representation.- Anthology ID:
- 2000.iwpt-1.33
- Volume:
- Proceedings of the Sixth International Workshop on Parsing Technologies
- Month:
- February 23-25
- Year:
- 2000
- Address:
- Trento, Italy
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 301–302
- Language:
- URL:
- https://aclanthology.org/2000.iwpt-1.33
- DOI:
- Cite (ACL):
- David Elworthy. 2000. A Finite-state Parser with Dependency Structure Output. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 301–302, Trento, Italy. Association for Computational Linguistics.
- Cite (Informal):
- A Finite-state Parser with Dependency Structure Output (Elworthy, IWPT 2000)
- PDF:
- https://preview.aclanthology.org/nodalida-main-page/2000.iwpt-1.33.pdf