A logic for partially specified data structures
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Understanding Natural Language
Understanding Natural Language
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
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
Computational complexity of current GPSG theory
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Implementing systemic classification by unification
Computational Linguistics
An efficient natural language processing system specially designed for the Chinese language
Computational Linguistics
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Parsing with discontinuous phrases
Natural Language Engineering
On the logic of category definitions
Computational Linguistics
Lambek Theorem Proving and feature unification
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Expressing disjunctive and negative feature constraints with classical first-order logic
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
A model-theoretic framework for theories of syntax
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Hi-index | 0.00 |
This paper outlines a simple and general notion of syntactic category on a metatheoretical level, independent of the notations and substantive claims of any particular grammatical framework. We define a class of formal objects called "category structures" where each such object provides a constructive definition for a space of syntactic categories. A unification operation and subsumption and identity relations are defined for arbitrary syntactic categories. In addition, a formal language for the statement of constraints on categories is provided. By combining a category structure with a set of constraints, we show that one can define the category systems of several well-known grammatical frameworks: phrase structure grammar, tagmemics, augmented phrase structure grammar, relational grammar, transformational grammar, generalized phrase structure grammar, systemic grammar, categorial grammar, and indexed grammar. The problem of checking a category for conformity to constraints is shown to be solvable in linear time. This work provides in effect a unitary class of data structures for the representation of syntactic categories in a range of diverse grammatical frameworks. Using such data structures should make it possible for various pseudo-issues in natural language processing research to be avoided. We conclude by examining the questions posed by set-valued features and sharing of values between distinct feature specifications, both of which fall outside the scope of the formal system developed in this paper.