Off-line Constraint Propagation for Efficient HPSG Processing
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a HPSG theory more specific at those places where linguistically motivated underspecification would lead to inefficient processing. We discuss two concrete HPSG examples showing how off-line constraint propagation helps improve processing efficiency.
Cite
@article{arxiv.cmp-lg/9604010,
title = {Off-line Constraint Propagation for Efficient HPSG Processing},
author = {Walt Detmar Meurers and Guido Minnen},
journal= {arXiv preprint arXiv:cmp-lg/9604010},
year = {2008}
}
Comments
10 pages, uuencoded gzipped Postscript