Deterministic Consistency Checking of LP Constraints
cmp-lg
2016-08-31 v2 Computation and Language
Abstract
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.
Cite
@article{arxiv.cmp-lg/9502017,
title = {Deterministic Consistency Checking of LP Constraints},
author = {Suresh Manandhar},
journal= {arXiv preprint arXiv:cmp-lg/9502017},
year = {2016}
}
Comments
EACL'95, 8 pages, LaTeX, eepic.sty, epsf.sty, eaclap.sty, figures - tar-ed, gzip-ed, uuencode-d