A logic-based Government-Binding parser for Mandarin Chinese

Authors:
Hsin-Hsi Chen
Affiliations:
National Taiwan University, Taipei, Taiwan, R.O.C.
Venue:
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Year:
1990

Citing 3
Cited 2

Restricting logic grammars with government-binding theory

Computational Linguistics
Extraposition grammars

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

Trace & Unification Grammar

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Identification and classification of proper nouns in Chinese texts

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mandarin Chinese is a highly flexible and context-sensitive language. It is difficult to do the case marking and index assignment during the parsing of Chinese sentences. This paper proposes a logic-based Government-Binding approach to treat this problem. The grammar formalism is specified in a formal way. Uniform treatments of movements, arbitrary number of movement non-terminals, automatic detection of grammar errors beforehand, and clear declarative semantics are its specific features. Many common linguistic phenomena of Chinese sentences are represented with this formalism. For example, topic-comment structures, the ba-constructions, the bei-constructions, relative clause constructions, appositive clause constructions, and serial verb constructions. A simple pronoun resolution is touched upon. The expressive capabilities and the design methodologies show this mechanism is also suitable for other flexible and context-sensitive languages.