Theoretical Computer Science
Chart parsing and constraint programming
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
HYPROLOG: a new logic programming language with assumptions and abduction
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Property grammars: a fully constraint-based theory
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
| Hi-index | 0.00 |
Property Grammars , or PGs, belong to a new family of linguistic formalisms which view a grammar as a set of linguistic constraints, and parsing as a constraint satisfaction problem. Rigid hierarchical parsing gives way to flexible mechanisms which can handle incomplete, ambiguous or erroneous text, and are thus more adequate for new applications such as speech recognition, internet mining, controlled languages and biomedical information. The present work contributes a) a new parsing methodology for PGs in terms of Hyprolog --- an extension of Prolog with linear and intuitionistic logic and with abduction; and b) a customisable extension of PGs that lets us model also concepts and relations to some degree. We exemplify within the domain of extracting concepts from biomedical text.