Abstract
The paper describes an incremental parsing algorithm for natural languages that uses normalized interfaces of modules of proof-nets. This algorithm produces at each step the different possible partial syntactical analyses of the first words of a sentence. Thus, it can analyze texts on the fly leaving partially analyzed sentences.- Anthology ID:
- W03-3003
- Volume:
- Proceedings of the Eighth International Conference on Parsing Technologies
- Month:
- April
- Year:
- 2003
- Address:
- Nancy, France
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Note:
- Pages:
- 31–42
- Language:
- URL:
- https://aclanthology.org/W03-3003
- DOI:
- Cite (ACL):
- Denis Béchet. 2003. Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 31–42, Nancy, France.
- Cite (Informal):
- Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces (Béchet, IWPT 2003)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-2/W03-3003.pdf