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