ML p(r)ior | Deterministic Consistency Checking of LP Constraints
Processing...

Deterministic Consistency Checking of LP Constraints

1995-02-14
9502017 | cmp-lg
We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations