The Quick Check Pre-unification Filter for Typed Grammars: Further Advances

The Quick Check Pre-unification Filter for Typed Grammars: Extensions

The so called quick check (henceforth QC) preunification 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 preun...

Efficient feature structure operations without compilation

One major obstacle to efficient processing of large wide coverage grammars in unificationbased grammatical frameworks such as hpsg is the time and space cost of the unification operation itself. In a grammar development system it is not appropriate to address this problem with techniques which involve lengthy compilation, since this slows down the edit-test-debug cycle. Nor is it possible to ra...

On Compilation of the Quick-Check Filter for Feature Structure Unification

A baseline method for compiling typed unification grammars into context free language models

This paper presents a minimal enumerative approach to the problem of compiling typed unification grammars into CFG language models, a prototype implementation and results of experiments in which it was used to compile some non-trivial unification grammars. We argue that enumerative methods are considerably more useful than has been previously believed. Also, the simplicity of enumerative method...

Flexible Structural Analysis of Near-Meet-Semilattices for Typed Unification-Based Grammar Design

We present a new method for directly working with typed unification grammars in which type unification is not well-defined. This is often the case, as large-scale HPSG grammars now usually have type systems for which many pairs do not have least upper bounds. Our method yields a unification algorithm that compiles quickly and yet is nearly as fast during parsing as one that requires least upper...