Parsing a flexible word order language

Authors:
Vladimir Pericliev;Alexander Grigorov
Affiliations:
Institute of Mathematics with Computing Centre, Sofia, Bulgaria;Institute of Mathematics with Computing Centre, Sofia, Bulgaria
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Year:
1994

Citing 5
Cited 1

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language

A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language
Long-distance scrambling and tree adjoining grammars

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Handling linear precedence constraints by unification

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Testing the projectivity hypothesis

COLING '86 Proceedings of the 11th coference on Computational linguistics

Learning Linear Precedence rules

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their application to non-siblings. This allows a concise, modular and declarative statement of intricate word order regularities.