Name
Abstract | ||
|---|---|---|
One major obstacle to the efficient processing of large wide coverage grammars in unification-based 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 radically restructure the grammar. In this paper, we describe novel extensions to an existing efficient unification algorithm which improve its space and time behaviour (without affecting its correctness) by substantially increasing the amount of structure sharing that takes place. We also describe a fast and automatically tunable pre-unification filter (the ‘quick check’) which in practice detects a large proportion of unifications that if performed would fail. Finally, we present an efficient algorithm for checking for subsumption relationships between two feature structures; a special case of this gives a fast equality test. The subsumption check is used in a parser (described elsewhere in this issue) which ‘packs’ local ambiguities to avoid performing redundant sub-computations. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1017/S1351324900002382 | Natural Language Engineering |
DocType | Volume | Issue |
Journal | 6 | 1 |
Citations | PageRank | References |
21 | 1.70 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Malouf | 1 | 21 | 1.70 |
| John Carroll | 2 | 1971 | 222.19 |
| Ann Copestake | 3 | 862 | 95.10 |