Negative filter
Japanese, patent, claim, sentences 10
(320.2 per million)
tech,3-1-C90-2032,ak
telephone dialogue . This paper proposes
<term>
document oriented preference sets ( DoPS )
</term>
for the
<term>
disambiguation
</term>
#20347This paper proposesdocument oriented preference sets ( DoPS ) for the disambiguation of the dependency structure of sentences.
tech,12-1-C90-2032,ak
preference sets ( DoPS )
</term>
for the
<term>
disambiguation
</term>
of the
<term>
dependency structure
</term>
#20356This paper proposes document oriented preference sets(DoPS) for thedisambiguation of the dependency structure of sentences.
other,15-1-C90-2032,ak
the
<term>
disambiguation
</term>
of the
<term>
dependency structure
</term>
of
<term>
sentences
</term>
. The
<term>
#20359This paper proposes document oriented preference sets(DoPS) for the disambiguation of thedependency structure of sentences.
other,18-1-C90-2032,ak
<term>
dependency structure
</term>
of
<term>
sentences
</term>
. The
<term>
DoPS system
</term>
extracts
#20362This paper proposes document oriented preference sets(DoPS) for the disambiguation of the dependency structure ofsentences.
tech,1-2-C90-2032,ak
</term>
of
<term>
sentences
</term>
. The
<term>
DoPS system
</term>
extracts
<term>
preference knowledge
#20365TheDoPS system extracts preference knowledge from a target document or other documents automatically.
model,4-2-C90-2032,ak
The
<term>
DoPS system
</term>
extracts
<term>
preference knowledge
</term>
from a target document or other documents
#20368The DoPS system extractspreference knowledge from a target document or other documents automatically.
other,0-3-C90-2032,ak
or other documents automatically .
<term>
Sentence ambiguities
</term>
can be resolved by using
<term>
domain
#20379The DoPS system extracts preference knowledge from a target document or other documents automatically.Sentence ambiguities can be resolved by using domain targeted preference knowledge without using complicated large knowledgebases.
model,7-3-C90-2032,ak
ambiguities
</term>
can be resolved by using
<term>
domain targeted preference knowledge
</term>
without using complicated large
<term>
#20386Sentence ambiguities can be resolved by usingdomain targeted preference knowledge without using complicated large knowledgebases.
lr,15-3-C90-2032,ak
</term>
without using complicated large
<term>
knowledgebases
</term>
. Implementation and empirical results
#20394Sentence ambiguities can be resolved by using domain targeted preference knowledge without using complicated largeknowledgebases.
other,11-4-C90-2032,ak
described for the the analysis of
<term>
dependency structures
</term>
of
<term>
Japanese patent claim sentences
#20407Implementation and empirical results are described for the the analysis ofdependency structures of Japanese patent claim sentences.