Abstract
We investigate a method of improving the memory efficiency of a chart parser. Specifically, we propose a technique to reduce the number of active arcs created in the process of parsing. We sketch the differences in the chart algorithm, and provide empirical results that demonstrate the effectiveness of this technique.- Anthology ID:
- 2000.iwpt-1.41
- 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:
- 317–318
- Language:
- URL:
- https://aclanthology.org/2000.iwpt-1.41
- DOI:
- Cite (ACL):
- Paul W. Placeway. 2000. Tree-structured Chart Parsing. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 317–318, Trento, Italy. Association for Computational Linguistics.
- Cite (Informal):
- Tree-structured Chart Parsing (Placeway, IWPT 2000)
- PDF:
- https://preview.aclanthology.org/starsem-semeval-split/2000.iwpt-1.41.pdf