Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Computational Linguistics
A logical treatment of semi-free word order and bounded discontinuous constituency
EACL '89 Proceedings of the fourth conference on European chapter of the 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
A new design of prolog-based bottom-up parsing system with Government-Binding theory
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A logic-based Government-Binding parser for Mandarin Chinese
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
This paper presents Trace & Unification Grammar (TUG), a declarative and reversible grammar formalism that brings together Unification Grammar (UG) and ideas of Government & Binding Theory (GB). The main part of the paper consists in a description of many free word order phenomena of German syntax. It will be shown that the use of traces allows for an easier and more elegant way of description than competing approaches like ID/LP-format rules as used e.g. in GPSG and HPSG. Grammars written in the TUG-formalism can be compiled to a very efficient parser. The occurrence of head movement, wh-movement and scrambling in one sentence does not lead to any decrease in parsing efficiency.