The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An efficient context-free parsing algorithm
Communications of the ACM
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Information and syntax in spoken language systems
HLT '89 Proceedings of the workshop on Speech and Natural Language
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
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
ACL '89 Proceedings of the 27th 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
Structure and intonation in spoken language understanding
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Zero morphemes in unification-based combinatory categorial grammar
ACL '90 Proceedings of the 28th 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
A definite clause version of Categorial Grammar
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Massive disambiguation of large text corpora with flexible categorial grammar
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Functor-driven natural language generation with categorial-unification grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Mitre-Bedford: description of the Alembic system as used for MUC-5
MUC5 '93 Proceedings of the 5th conference on Message understanding
INLG '94 Proceedings of the Seventh International Workshop on Natural Language Generation
| Hi-index | 0.00 |
Steedman (1985, 1987) and others have proposed that Categorial Grammar, a theory of syntax in which grammatical categories are viewed as functions, be augmented with operators such as functional composition and type raising in order to analyze "noncanonical" syntactic constructions such as wh- extraction and node raising. A consequence of these augmentations is an explosion of semantically equivalent derivations admitted by the grammar. The present work proposes a method for circumventing this spurious ambiguity problem. It involves deriving new, specialized combinators and replacing the orginal basic combinators with these derived ones. In this paper, examples of these predictive combinators are offered and their effects illustrated. An algorithm for deriving them, as well as a discussion of their semantics, will be presented in forthcoming work.