Name
Abstract | ||
|---|---|---|
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation associated with different structures is duplicated. In this paper we describe a precompilation technique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finite state automata which can be merged and minimised using standard algorithms, and then parsed using an automaton-based parser. We present algorithms for constructing automata from elementary structures, merging and minimising them, and string recognition and parse recovery with the resulting grammar. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.3115/980451.980908 | meeting of the association for computational linguistics |
Keywords | DocType | Volume |
precompilation technique,resulting grammar,wide-coverage lexicalized grammar,elementary structure,different structure,structure-sharing parser,conventional parsing,present algorithm,parse recovery,finite state automaton,automaton-based parser | Conference | P98-1 |
Citations | PageRank | References |
8 | 1.10 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roger Evans | 1 | 344 | 55.12 |
| David J. Weir | 2 | 840 | 83.84 |