Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
An efficient context-free parsing algorithm
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Structure-sharing in lexical representation
ACL '85 Proceedings of the 23rd 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
Unification Categorial Grammar: a concise, extendable grammar for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
DATR: a language for lexical knowledge representation
Computational Linguistics
A computational treatment of lexical rules in HPSG as covariation in lexical entries
Computational Linguistics
Lexical rules in constraint-based grammars
Computational Linguistics
Generative power of CCGs with generalized type-raised categories
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
Constraint-based Categorial Grammar
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Adjuncts and the processing of lexical rules
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Applying lexical rules under subsumption
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Transformational priors over grammars
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
Polyadic Dynamic Logics for HPSG Parsing
Journal of Logic, Language and Information
| Hi-index | 0.00 |
In this paper, it is shown that the addition of simple and linguistically motivated forms of lexical rules to grammatical theories based on subcategorization lists, such as categorial grammars (CG) or head-driven phrase structure grammars (HPSG), results in a system that can generate all and only the recursively enumerable languages. The proof of this result is carried out by means of a reduction of generalized rewriting systems. Two restrictions are considered, each of which constrains the generative power of the resulting system to context-free languages.