A Labelled Analytic Theorem Proving Environment for Categorial Grammar
<|reference_start|>A Labelled Analytic Theorem Proving Environment for Categorial Grammar: 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.<|reference_end|>
@article{luz-filho1995a,
    title={A Labelled Analytic Theorem Proving Environment for Categorial Grammar},
    author={Saturnino F. Luz-Filho and Patrick Sturt (Centre for Cognitive
  Science, University of Edinburgh)},
    journal={To appear in the Proceedings of IWPT-95},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9508009},
    primaryClass={cmp-lg cs.CL}
}