The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Specifying intonation from context for speech synthesis
Speech Communication
Parsing some constrained grammar formalisms
Computational Linguistics
Parsing and derivational equivalence
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Efficient processing of flexible categorial grammar
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Predictive combinators: a method for efficient processing of combinatory Categorial Grammars
ACL '87 Proceedings of the 25th annual meeting on 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
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A psycholinguistically motivated parser for CCG
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Polynomial time parsing of Combinatory Categorial Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
The combinatory morphemic lexicon
Computational Linguistics
Maximal incrementality in linear categorial deduction
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
Deriving the predicate-argument structure for a free word order language
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Informed parsing for coordination with combinatory categorial grammar
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Building deep dependency structures with a wide-coverage CCG parser
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Parsing the WSJ using CCG and log-linear models
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Type-inheritance combinatory categorial grammar
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
The importance of supertagging for wide-coverage CCG parsing
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
Inducing combinatory categorial grammars with genetic algorithms
ACL '07 Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop
Weakly supervised supertagging with grammar-informed initialization
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Perceptron training for a wide-coverage lexicalized-grammar parser
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Priming effects in combinatory categorial grammar
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Fully lexicalising CCGbank with hat categories
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Evaluating a statistical CCG parser on Wikipedia
People's Web '09 Proceedings of the 2009 Workshop on The People's Web Meets NLP: Collaboratively Constructed Semantic Resources
The importance of rule restrictions in CCG
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Dealing with spurious ambiguity in learning ITG-based word alignment
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Dependency hashing for n-best CCG parsing
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
| Hi-index | 0.00 |
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an efficient, correct, and easy to implement normal-form parsing technique. The parser is proved to find exactly one parse in each semantic equivalence class of allowable parses; that is, spurious ambiguity (as carefully defined) is shown to be both safely and completely eliminated.