Please use this identifier to cite or link to this item: doi:10.22028/D291-25767
Title: Towards a constraint parser for categorial type logics
Author(s): Kuhlmann, Marco
Language: English
Year of Publication: 2002
SWD key words: Constraint-Programmierung
Free key words: Constraints
DDC notations: 004 Computer science, internet
Publikation type: Other
Abstract: 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 emph{structural 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.},
Link to this record: urn:nbn:de:bsz:291-scidok-2911
Date of registration: 29-Jun-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
kmmaster.pdf573,9 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.