This thesis shows how constraint programming can be applied to the processing of Categorial Type Logics (CTL). It presents a novel formalisation of the parsing task for categorial grammars as a tree configuration problem, and demonstrates how a recent proposal for emphstructural constraints on CTL parse trees can be integrated into this framework. The resulting processing model has been implemented using the Mozart programming environment. It appears to be a promising starting point for further research on the application of constraint parsing to CTL and the investigation of the practical processing complexity of CTL grammar fragments.
Download PDF Show BibTeX
Login to edit