Paper: Handling Linear Precedence Constraints By Unification

ACL ID P92-1026
Title Handling Linear Precedence Constraints By Unification
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1992
Authors

Linear precedence (LP) rules are widely 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.