Off-line Constraint Propagation for Efficient HPSG Processing
arXiv:cmp-lg/9604010
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.
10 pages, uuencoded gzipped Postscript