|
</term>
, the
<term>
error rate
</term>
dropped
|
to
|
4.1 % --- a 45 % reduction in
<term>
error
|
#17202
Using only 40 utterances from the target speaker for adaptation, the error rate dropped to 4.1% --- a 45% reduction in error compared to the SI result. |
|
disambiguation
</term>
is raised from 46.0 %
|
to
|
60.62 % by using this novel approach .
<term>
|
#17937
The accuracy rate of syntactic disambiguation is raised from 46.0% to 60.62% by using this novel approach. |
|
and the difference could narrow further
|
to
|
6.5 % if we disregard the advantage that
|
#4897
On a subset of the most difficult SENSEVAL-2 nouns, the accuracy difference between the two approaches is only 14.0%, and the difference could narrow further to 6.5% if we disregard the advantage that manually sense-tagged data have in their sense coverage. |
|
<term>
parsing accuracy
</term>
rate from 60 %
|
to
|
75 % , a 37 % reduction in error . We discuss
|
#19041
In head-to-head tests against one of the best existing robust probabilistic parsing models, which we call P-CFG, the HBG model significantly outperforms P-CFG, increasing the parsing accuracy rate from 60% to 75%, a 37% reduction in error. |
|
<term>
stemmer
</term>
by allowing it to adapt
|
to
|
a desired
<term>
domain
</term>
or
<term>
genre
|
#4503
Monolingual, unannotated text can be used to further improve the stemmer by allowing it to adapt to a desired domain or genre. |
|
two
<term>
formalisms
</term>
. We then turn
|
to
|
a discussion comparing the
<term>
linguistic
|
#14611
We then turn to a discussion comparing the linguistic expressiveness of the two formalisms. |
|
patterns
</term>
in a large
<term>
corpus
</term>
.
|
To
|
a large extent , these
<term>
statistics
</term>
|
#16633
This paper presents an automatic scheme for collecting statistics on co-occurrence patterns in a large corpus. To a large extent, these statistics reflect semantic constraints and thus are used to disambiguate anaphora references and syntactic ambiguities. |
|
<term>
paraphrase classification
</term>
and
|
to
|
a lesser extent
<term>
entailment
</term>
.
|
#8414
Our results show that MT evaluation techniques are able to produce useful features for paraphrase classification and to a lesser extent entailment. |
|
restricted natural language
</term>
input
|
to
|
a limited-domain computer system . This
|
#12783
We go, on to describe FlexP, a bottom-up pattern-matching parser that we have designed and implemented to provide these flexibilities for restricted natural language input to a limited-domain computer system. |
|
information request . The request is passed
|
to
|
a
<term>
mobile , intelligent agent
</term>
|
#851
The request is passed to a mobile, intelligent agent for execution at the appropriate database. |
|
Our
<term>
logical definition
</term>
leads
|
to
|
a neat relation to
<term>
categorial grammar
|
#1950
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). |
|
system while gathering information related
|
to
|
a particular scenario . This paper introduces
|
#11691
FERRET utilizes a novel approach to Q/A known as predictive questioning which attempts to identify the questions (and answers) that users need by analyzing how a user interacts with a system while gathering information related to a particular scenario. |
|
<term>
information workers
</term>
' access
|
to
|
a
<term>
pharmaceutical news archive
</term>
|
#331
We describe how this information is used in a prototype system designed to support information workers' access to a pharmaceutical news archive as part of their industry watch function. |
|
with this
<term>
model
</term>
is then passed
|
to
|
a
<term>
phone-string classifier
</term>
.
|
#2285
In our method, unsupervised training is first used to train a phone n-gram model for a particular domain; the output of recognition with this model is then passed to a phone-string classifier. |
|
</term>
from a
<term>
reconstruction
</term>
|
to
|
a
<term>
recognition task
</term>
. Implications
|
#12510
It is argued that the method reduces metaphor interpretation from a reconstruction to a recognition task. |
|
Experiments show that this approach is superior
|
to
|
a single
<term>
decision-tree classifier
</term>
|
#7063
Experiments show that this approach is superior to a single decision-tree classifier. |
|
. Typically , information that makes it
|
to
|
a
<term>
summary
</term>
appears in many different
|
#7182
Typically, information that makes it to a summary appears in many different lexical-syntactic forms in the input documents. |
|
be both efficient and easily adaptable
|
to
|
a variety of applications . The system
|
#12865
Chat-80 has been designed to be both efficient and easily adaptable to a variety of applications. |
|
If a
<term>
computer system
</term>
wishes
|
to
|
accept
<term>
natural language input
</term>
|
#12718
If a computer system wishes to accept natural language input from its users on a routine basis, it must display a similar indifference. |
|
</term>
should be further developed in order
|
to
|
account for the
<term>
verbal interactions
|
#12430
A standard ATN should be further developed in order to account for the verbal interactions of task-oriented dialogs. |