Proceedings of the 14th Conference on Computational Linguistics - 1992
DOI: 10.3115/992066.992083
|View full text |Cite
|
Sign up to set email alerts
|

Trace & Unification Grammar

Abstract: 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 (on)~ 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. Grammkrs written in the TUG-formallsm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1993
1993
2000
2000

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…[3], [4]. In the module described here, a Trace and Unification Grammar (TUG) [12] and a modification of the parsing algorithm of Tomita [50] is used. The basis of a TUG is a context free grammar augmented with PATR-II-style feature equations.…”
Section: A Prosody and Syntax-interaction With The Tug-grammarmentioning
confidence: 99%
“…[3], [4]. In the module described here, a Trace and Unification Grammar (TUG) [12] and a modification of the parsing algorithm of Tomita [50] is used. The basis of a TUG is a context free grammar augmented with PATR-II-style feature equations.…”
Section: A Prosody and Syntax-interaction With The Tug-grammarmentioning
confidence: 99%
“…[1,2]. In the module described here, we use a Trace and Unification Grammar (TUG) [7] and a modification of the parsing algorithm of Tomita [33]. The basis of a TUG is a context free grammar augmented with PATR-II-style feature equations.…”
Section: Prosody and Syntax -Interaction With The Tug-grammarmentioning
confidence: 99%
“…We use a Trace and Unification Grammar (TUG) [3] and a modification of the parsing algorithm of Tomita [9]. The basis of a TUG is a context free grammar augmented with PATR-II-style feature equations.…”
Section: Grammar and Parsermentioning
confidence: 99%