Off-line Constraint Propagation for Efficient HPSG Processing
<|reference_start|>Off-line Constraint Propagation for Efficient HPSG Processing: 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.<|reference_end|>
@article{meurers1996off-line,
    title={Off-line Constraint Propagation for Efficient HPSG Processing},
    author={Walt Detmar Meurers, Guido Minnen (SFB 340, Univ. Tuebingen)},
    journal={Proceedings HPSG/TALN Conference, Marseille, France, May 20-22},
    year={1996},
    archivePrefix={arXiv},
    eprint={cmp-lg/9604010},
    primaryClass={cmp-lg cs.CL}
}