Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The logic of typed feature structures
The logic of typed feature structures
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully abstract compositional semantics for an algebra of logic programs
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to this Special Issue
Natural Language Engineering
A principle-based hierarchical representation of LTAGs
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Modularizing codescriptive grammars for efficient parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A web-based instructional platform for constraint-based grammar formalisms and parsing
ETMTNLP '02 Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Adapting existing grammars: the XLE experience
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Polarized unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Partially specified signatures: a vehicle for grammar modularity
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Associative Grammar Combination Operators for Tree-Based Grammars
Journal of Logic, Language and Information
Formal Grammars of Early Language
Languages: From Formal to Natural
Journal of Computer and System Sciences
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Hi-index | 0.00 |
Development of large-scale grammars for natural languages is a complicated endeavor: Grammars are developed collaboratively by teams of linguists, computational linguists, and computer scientists, in a process very similar to the development of large-scale software. Grammars are written in grammatical formalisms that resemble very-high-level programming languages, and are thus very similar to computer programs. Yet grammar engineering is still in its infancy: Few grammar development environments support sophisticated modularized grammar development, in the form of distribution of the grammar development effort, combination of sub-grammars, separate compilation and automatic linkage, information encapsulation, and so forth. This work provides preliminary foundations for modular construction of (typed) unification grammars for natural languages. Much of the information in such formalisms is encoded by the type signature, and we subsequently address the problem through the distribution of the signature among the different modules. We define signature modules and provide operators of module combination. Modules may specify only partial information about the components of the signature and may communicate through parameters, similarly to function calls in programming languages. Our definitions are inspired by methods and techniques of programming language theory and software engineering and are motivated by the actual needs of grammar developers, obtained through a careful examination of existing grammars. We show that our definitions meet these needs by conforming to a detailed set of desiderata. We demonstrate the utility of our definitions by providing a modular design of the HPSG grammar of Pollard and Sag.