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

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

We present several significant improvements in the implementation of the quick check pre-unification filter [7] [10], and the potential way in which the design of the quick check [15] [17] can be further extended. We analyse the effect of these extensions on LinGO, the large-scale HPSG grammar for English[14]. Althought these developments were done for the compiler system LIGHT [8], most of the...

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...

Types in Functional Unification Grammars

In this paper, we present several extensions to the FU formalism that address these limitations. These extensions are based on the formal semantics Functional Unification Grammars (FUGs) are presented in (Elhadad, 1990). They have been impopular for natural language applications because the plemented and tested on several applications. formalism uses very few primitives and is uniform and expre...

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...