Computer Science – Computation and Language
Scientific paper
1995-08-15
To appear in the Proceedings of IWPT-95
Computer Science
Computation and Language
11 pages, LaTeX2e, uses examples.sty and a4wide.sty
Scientific paper
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.
Luz-Filho Saturnino F.
Sturt Patrick
No associations
LandOfFree
A Labelled Analytic Theorem Proving Environment for Categorial Grammar does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Labelled Analytic Theorem Proving Environment for Categorial Grammar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Labelled Analytic Theorem Proving Environment for Categorial Grammar will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-24104