| unification </term> remains the most expensive part | of | <term> unification-based grammar parsing | #17953 Graph unification remains the most expensive part of unification-based grammar parsing. | |
| focus on one speed-up element in the design | of | <term> unification algorithms </term> : avoidance | #17967 We focus on one speed-up element in the design of unification algorithms: avoidance of copying of unmodified subgraphs. | |
| unification algorithms </term> : avoidance | of | <term> copying </term> of <term> unmodified | #17972 We focus on one speed-up element in the design of unification algorithms: avoidance of copying of unmodified subgraphs. | |
| </term> : avoidance of <term> copying </term> | of | <term> unmodified subgraphs </term> . We propose | #17974 We focus on one speed-up element in the design of unification algorithms: avoidance of copying of unmodified subgraphs. | |
| unmodified subgraphs </term> . We propose a method | of | attaining such a design through a method | #17982 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated with structure-sharing of graphs without any use of costly dependency pointers. | |
| attaining such a design through a method | of | <term> structure-sharing </term> which avoids | #17990 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated with structure-sharing of graphs without any use of costly dependency pointers. | |
| tech,24-3-C92-2068,bq | associated with <term> structure-sharing | of | graphs </term> without any use of costly <term> | #18003 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated with structure-sharing of graphs without any use of costly dependency pointers. |
| structure-sharing of graphs </term> without any use | of | costly <term> dependency pointers </term> . | #18008 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated with structure-sharing of graphs without any use of costly dependency pointers. |
