Theoretical Computer Science
Type-logical semantics
Proof Nets and the Complexity of Processing Center Embedded Constructions
Journal of Logic, Language and Information
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Geometry of lexico-syntactic interaction
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Normal form theorem proving for the Lambek Calculus
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Dutch Grammar and Processing: A Case Study in TLG
Logic, Language, and Computation
Incrementality in deterministic dependency parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Switch graphs for parsing type logical grammars
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Left-peripheral and sentence-internal topics in Japanese
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Research on Language and Computation
Journal of Logic, Language and Information
Controlling extraction in abstract categorial grammars
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 0.00 |
We describe a left-to-right incremental procedure for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena including garden pathing, the unacceptability of center embedding, preference for lower attachment, left-to-right quantifier scope preference, and heavy noun phrase shift.