Paper Info
Title
The quick check pre-unification filter for typed grammars: extensions
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).
Year
Venue
Keywords
2005
IWPT
pre-unification filter,henceforth qc,quick check pre-unification filter,pre-unification type-checking,important speed-up technique,quick check,coreferenced path,compiler system,consistency sort check,feature structure,non-compiled fs unification
Field
DocType
Citations 
Rule-based machine translation,Head-driven phrase structure grammar,Programming language,Computer science,Unification,Feature structure,sort,Theoretical computer science,Grammar,Compiler
Conference
0
PageRank 
References 
Authors
0.34
2
1
Name
Order
Citations
PageRank
Liviu Ciortuz1244.84