tech,8-3-P06-2012,bq |
</term>
show that this
<term>
spectral clustering
|
based
|
approach
</term>
outperforms the other
<term>
|
#11384
Experiment results on ACE corpora show that this spectral clustering based approach outperforms the other clustering methods. |
tech,3-1-P03-1022,bq |
data
</term>
. We apply a
<term>
decision tree
|
based
|
approach
</term>
to
<term>
pronoun resolution
|
#3978
We apply a decision tree based approach to pronoun resolution in spoken dialogue. |
|
to make use of
<term>
expectations
</term>
,
|
based
|
both on knowledge of
<term>
surface English
|
#13038
Our solution to these problems is to make use of expectations, based both on knowledge of surface English and on world knowledge of the situation being described. |
tech,7-10-I05-2048,bq |
coupled with
<term>
rule-based and example
|
based
|
machine translation modules
</term>
to build
|
#8178
It has also successfully been coupled with rule-based and example based machine translation modules to build a multi engine machine translation system. |
|
central to our
<term>
IE paradigm
</term>
. It is
|
based
|
on : ( 1 ) an extended set of
<term>
features
|
#3752
It is based on: (1) an extended set of features; and (2) inductive decision tree learning. |
|
parallelism
</term>
. The
<term>
model
</term>
is
|
based
|
on a
<term>
balance matching operation
</term>
|
#19818
The model is based on a balance matching operation for two lists of the feature sets, which provides four effects: the reduction of analysis cost, the improvement of word disambiguation, the interpretation of ellipses, and robust analysis. |
|
The paper proposes
<term>
interfaces
</term>
|
based
|
on a judicious mixture of these techniques
|
#12646
The paper proposes interfacesbased on a judicious mixture of these techniques and the still valuable methods of more traditional natural language interfaces. |
|
information extraction system
</term>
we evaluate is
|
based
|
on a
<term>
linear-chain conditional random
|
#6818
The information extraction system we evaluate is based on a linear-chain conditional random field (CRF), a probabilistic model which has performed well on information extraction tasks because of its ability to capture arbitrary, overlapping features of the input in a Markov model. |
|
statistical machine translation system
</term>
|
based
|
on a
<term>
probabilistic synchronous dependency
|
#9436
In this paper, we present a syntax-based statistical machine translation systembased on a probabilistic synchronous dependency insertion grammar. |
|
translation quality
</term>
of
<term>
EBMT
</term>
|
based
|
on a small-sized
<term>
bilingual corpus
</term>
|
#3088
In order to boost the translation quality of EBMTbased on a small-sized bilingual corpus, we use an out-of-domain bilingual corpus and, in addition, the language model of an in-domain monolingual corpus. |
|
</term>
from
<term>
structured data
</term>
(
|
based
|
on a
<term>
typing-algorithm
</term>
and
<term>
|
#1983
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). |
|
<term>
discourse segmentation
</term>
primarily
|
based
|
on
<term>
abduction
</term>
of
<term>
temporal
|
#17765
In this paper discourse segments are defined and a method for discourse segmentation primarily based on abduction of temporal relations between segments is proposed. |
|
alignment
</term>
and
<term>
word clustering
</term>
|
based
|
on
<term>
automatic extraction of translation
|
#6461
The method exploits recent advances in word alignment and word clusteringbased on automatic extraction of translation equivalents and being supported by available aligned wordnets for the languages in the corpus. |
|
<term>
dialogue system
</term>
. We build this
|
based
|
on both
<term>
Finite State Model ( FSM )
|
#3499
We build this based on both Finite State Model (FSM) and Statistical Learning Model (SLM). |
|
approach to question answering
</term>
which is
|
based
|
on combining the results from different
|
#2336
Motivated by the success of ensemble methods in machine learning and other areas of natural language processing, we developed a multi-strategy and multi-source approach to question answering which is based on combining the results from different answering agents searching for answers in multiple corpora. |
|
of processing prevails they are usually
|
based
|
on
<term>
dictionaries of word forms
</term>
|
#16747
From different reasons among which the speed of processing prevails they are usually based on dictionaries of word forms instead of words. |
|
implementation of the
<term>
model
</term>
|
based
|
on
<term>
finite-state models
</term>
, demonstrate
|
#2751
We present an implementation of the modelbased on finite-state models, demonstrate the model's ability to significantly reduce character and word error rate, and provide evaluation results involving automatic extraction of translation lexicons from printed text. |
|
model
</term>
is considered . The model is
|
based
|
on full
<term>
lexicalization
</term>
,
<term>
|
#21014
The model is based on full lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation. |
|
<term>
dialogue act
</term>
can be predicted
|
based
|
on
<term>
gaze
</term>
,
<term>
utterance
</term>
|
#10268
First, we investigate how well the addressee of a dialogue act can be predicted based on gaze, utterance and conversational context features. |
tech,3-5-C04-1112,bq |
model
</term>
. Also , the
<term>
WSD system
|
based
|
on lemmas
</term>
is smaller and more robust
|
#6083
Also, the WSD system based on lemmas is smaller and more robust. |