Abstract
We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation.- Anthology ID:
- 1995.iwpt-1.20
- Volume:
- Proceedings of the Fourth International Workshop on Parsing Technologies
- Month:
- September 20-24
- Year:
- 1995
- Address:
- Prague and Karlovy Vary, Czech Republic
- Editors:
- Eva Hajicova, Bernard Lang, Robert Berwick, Harry Bunt, Bob Carpenter, Ken Church, Aravind Joshi, Ronald Kaplan, Martin Kay, Makoto Nagao, Anton Nijholt, Mark Steedman, Henry Thompson, Masaru Tomita, K. Vijay-Shanker, Yorick Wilks, Kent Wittenburg
- Venues:
- IWPT | WS
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 152–161
- Language:
- URL:
- https://aclanthology.org/1995.iwpt-1.20
- DOI:
- Cite (ACL):
- Saturnino F. Luz-Filho and Patrick Sturt. 1995. A Labelled Analytic Theorem Proving Environment for Categorial Grammar. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 152–161, Prague and Karlovy Vary, Czech Republic. Association for Computational Linguistics.
- Cite (Informal):
- A Labelled Analytic Theorem Proving Environment for Categorial Grammar (Luz-Filho & Sturt, IWPT-WS 1995)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/1995.iwpt-1.20.pdf