Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Functional Uncertainty and Functional Precedence in Continental West Germanic
4. Österreichische Artificial-Intelligence-Tagung, Wiener Workshop Wissensbasierte Sprachverarbeitung
A Flexible Parser for a Linguistic Development Environment
Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project
Unification-ID/LP Grammars: Formalization and Parsing
Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project
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
Strategies for adding control information to declarative grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Unification encodings of grammatical notations
Computational Linguistics
Treating 'free word order' in machine translation
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Parsing a flexible word order language
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
Linear precedence (LP) rules are widley used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German. We propose a notion of LP constraints that applies to linguistically motivated branching domains such as head domains. We show a type-based encoding in an HPSG-style formalism that supports processing. The encoding can be achieved by a compilation step.