Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Verbmobil: A Translation System for Face-to-Face Dialog
Verbmobil: A Translation System for Face-to-Face Dialog
The interface between phrasal and functional constraints
Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
TDL: a type description language for constraint-based grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Efficient parameterizable type expansion for typed feature formalisms
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
From ubgs to cfgs a practical corpus-driven approach
Natural Language Engineering
Towards modular development of typed unification grammars
Computational Linguistics
Hi-index | 0.00 |
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the levels are expressed by coreferences. Though highly attractive theoretically, using such codescriptions for analysis creates problems of efficiency. We present an approach to a modular use of codescriptions on the syntactic and semantic level. Grammatical analysis is performed by tightly coupled parsers running in tandem, each using only designated parts of the grammatical description. In the paper we describe the partitioning of grammatical information for the parsers and present results about the performance.