Published in Volume XIV, 2004, pages 36-50

Authors: Liviu CIORTUZ

Abstract

We present several significant improvements in the implementation of the quick check pre-unification filter \cite{Ciortuz-2002a} \cite{Ciortuz-2002f}, and the potential way in which the design of the quick check \cite{KKCM-99} \cite{MCC-00} can be further extended. We analyse the effect of these extensions on LinGO, the large-scale HPSG grammar for English \cite{LinGO-99}. Althought these developments were done for the compiler system light \cite{Ciortuz-2002b}, most of them are transferrable to non-compilation based systems.

Bibtex

@article{sacscuza:ciortuz2004tqcpfftgfa,
  title={The Quick Check Pre-unification Filter for Typed Grammars: Further Advances.},
  author={Liviu CIORTUZ},
  journal={Scientific Annals of Computer Science},
  volume={14},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  year={2004},
  pages={36--50},
  publisher={``A.I. Cuza'' University Press}
}