The quick check pre-unification filter for typed grammars: extensions

Authors:
Liviu Ciortuz
Affiliations:
University of Iaşi, Romania
Venue:
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Year:
2005

Citing 2
Cited 0

LIGHT - A Constraint Language and Compiler System for Typed-Unification Grammars

KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
A bag of useful techniques for efficient and robust parsing

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The so called quick check (henceforth QC) pre-unification filter for feature structure (FS) unification was introduced by (Kiefer et al., 1999). QC is considered the most important speed-up technique in the framework of non-compiled FS unification. We present two potential ways in which the design of the quick check can be further extended: consistency sort check on coreferenced paths, and pre-unification type-checking. We analyse the effect of these extensions on LinGO, the large-scale HPSG grammar for English (Flickinger et al., 2000) using the compiler system LIGHT (Ciortuz, 2002).