| model,18-2-C92-2068,ak | avoidance of copying of unmodified <term> | subgraphs | </term> . We propose a method of attaining | #22947 We focus on one speed-up element in the design of unification algorithms: avoidance of copying of unmodifiedsubgraphs. | |
| model,26-3-C92-2068,ak | with <term> structure-sharing </term> of <term> | graphs | </term> without any use of costly <term> dependency | #22975 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 ofgraphs without any use of costly dependency pointers. | |
| other,20-3-C92-2068,ak | structure-sharing </term> which avoids log ( d ) <term> | overheads | </term> often associated with <term> structure-sharing | #22969 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. | |
| other,26-4-C92-2068,ak | combined with its ability to handle <term> | cyclic structures | </term> without algorithmic additions . The | #23010 The proposed scheme eliminates redundant copying while maintaining the quasi-destructive scheme's ability to avoid over copying and early copying combined with its ability to handlecyclic structures without algorithmic additions. | |
| other,32-3-C92-2068,ak | graphs </term> without any use of costly <term> | dependency pointers | </term> . The proposed scheme eliminates | #22981 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 costlydependency pointers. | |
| tech,0-1-C92-2068,ak | 60.62 % by using this novel approach . <term> | Graph unification | </term> remains the most expensive part of | #22917 The accuracy rate of syntactic disambiguation is raised from 46.0% to 60.62% by using this novel approach.Graph unification remains the most expensive part of unification-based grammar parsing. | |
| tech,10-2-C92-2068,ak | speed-up element in the design of <term> | unification algorithms | </term> : avoidance of copying of unmodified | #22939 We focus on one speed-up element in the design ofunification algorithms: avoidance of copying of unmodified subgraphs. | |
| tech,13-3-C92-2068,ak | such a design through a method of <term> | structure-sharing | </term> which avoids log ( d ) <term> overheads | #22962 We propose a method of attaining such a design through a method ofstructure-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,ak | overheads </term> often associated with <term> | structure-sharing | </term> of <term> graphs </term> without any | #22973 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated withstructure-sharing of graphs without any use of costly dependency pointers. | |
| tech,8-1-C92-2068,ak | remains the most expensive part of <term> | unification-based grammar parsing | </term> . We focus on one speed-up element | #22925 Graph unification remains the most expensive part ofunification-based grammar parsing. |
