Handling linear precedence constraints by unification
Judith Engelkamp, Gregor Erbach, Hans Uszkoreit · 1992
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.