An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Interleaving universal principles and relational constraints over typed feature logic
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
An attributive logic of set descriptions and set operations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Structural similarity within and among languages
Theoretical Computer Science - Algebraic methods in language processing
Theory and Practice of Logic Programming
User-definable rule priorities for CHR
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A bottom-up parser where entire operation is conducted in the letter string region
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
A Hyprolog Parsing Methodology for Property Grammars
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Control strategies for parsing with freer word-order languages
CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
Optimizing compilation of CHR with rule priorities
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
| Hi-index | 0.00 |
In this paper, parsing-as-deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based chart parsers. Following the proposal in Shieber et al. (1995), we show how to directly realize the inference rules for deductive parsers as Constraint Handling Rules (Frühwirth, 1998) by viewing the items of a chart parser as constraints and the constraint base as a chart. This allows the direct use of constraint resolution to parse sentences.