论文信息 - Compiling Trace & Unification Grammar

Compiling Trace & Unification Grammar

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). A grammar compiler is presented that transforms a grammar written in the TUG formalism into two different forms, one being useful for parsing, the other being useful for generation.

Hans Ulrich Block

[1] Stuart M. Shieber,et al. A Uniform Architecture for Parsing and Generation , 1988, COLING.

[2] Stuart M. Shieber,et al. The Design of a Computer Language for Linguistic Information , 1984, ACL.

[3] Hsin-Hsi Chen,et al. A New Design of Prolog-Based Bottom-Up Parsing System With Government-Binding Theory , 1988, COLING.

[4] Tomek Strzalkowski. How To Invert A Natural Language Parser Into An Efficient Generator: An Algorithm For Logic Grammars , 1990, COLING.

[5] Masaru Tomita,et al. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[6] Tomek Strzalkowski,et al. Automated Inversion of Logic Grammars for Generation , 1990, ACL.

[7] Günter Neumann. A Bidirectional Model For Natural Language Processing , 1991, EACL.

[8] Hsin-Hsi Chen,et al. A Logic-Based Government-Binding Parser for Mandarin Chinese , 1990, COLING.

[9] Hiyan Alshawi,et al. Resolving Quasi Logical Forms , 1990, CL.

[10] Fernando Pereira,et al. Extraposition Grammars , 1981, CL.

[11] Gertjan van Noord,et al. Semantic-Head-Driven Generation , 1990, Comput. Linguistics.