Abstract
Parsing is often seen as a combinatorial problem. It is not due to the properties of the natural languages, but due to the parsing strategies. This paper investigates a Constrained Grammar extracted from a Treebank and applies it in a non-combinatorial partial parser. This parser is a simpler version of a chunking-and-raising parser. The chunking and raising actions can be done in linear time. The short-term goal of this research is to help the development of a partially bracketed corpus, i.e., a simpler version of a treebank. The long-term goal is to provide high level linguistic constraints for many natural language applications.- Anthology ID:
- 1995.iwpt-1.10
- Volume:
- Proceedings of the Fourth International Workshop on Parsing Technologies
- Month:
- September 20-24
- Year:
- 1995
- Address:
- Prague and Karlovy Vary, Czech Republic
- Venues:
- IWPT | WS
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 71–78
- Language:
- URL:
- https://aclanthology.org/1995.iwpt-1.10
- DOI:
- Cite (ACL):
- Hsin-Hsi Chen and Yue-Shi Lee. 1995. A Chunking-and-Raising Partial Parser. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 71–78, Prague and Karlovy Vary, Czech Republic. Association for Computational Linguistics.
- Cite (Informal):
- A Chunking-and-Raising Partial Parser (Chen & Lee, IWPT-WS 1995)
- PDF:
- https://preview.aclanthology.org/ingestion-script-update/1995.iwpt-1.10.pdf