Handbook of logic in computer science (vol. 2)
A computational model of syntactic processing: ambiguity resolution from interpretation
A computational model of syntactic processing: ambiguity resolution from interpretation
ACM Computing Surveys (CSUR)
An efficient context-free parsing algorithm
Communications of the ACM
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A lazy way to chart-parse with Categorial Grammars
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Efficient incremental processing with categorial grammar
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Efficient normal-form parsing for combinatory categorial grammar
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Priming effects in combinatory categorial grammar
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
A model of discourse predictions in human sentence processing
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
| Hi-index | 0.00 |
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose interpretation is the most 'sensible', one comes to the conclusion that interpretation, hence parsing take place incrementally, just about every word. Considerations of parsimony in the theory of the syntactic processor lead one to explore the simplest of parsers: one which represents only analyses as defined by the grammar and no other information.Toward this aim of a simple, incremental parser I explore the proposal that the competence grammar is a Combinatory Categorial Grammar (CCG). I address the problem of the proliferating analyses that stem from CCG's associativity of derivation. My solution involves maintaining only the maximally incremental analysis and, when necessary, computing the maximally right-branching analysis. I use results from the study of rewrite systems to show that this computation is efficient.