|
for
<term>
multi-field records
</term>
. We
|
present
|
a novel approach for automatically acquiring
|
#6894
We present a novel approach for automatically acquiring English topic signatures. |
|
decision-tree classifier
</term>
. Furthermore , we
|
present
|
a standalone system that resolves
<term>
|
#7072
Furthermore, we present a standalone system that resolves pronouns in unannotated text by using a fully automatic sequence of preprocessing modules that mimics the manual annotation process. |
|
and
<term>
document summarization
</term>
, we
|
present
|
a similar approach , implemented in a measure
|
#7520
Following recent developments in the automatic evaluation of machine translation and document summarization, we present a similar approach, implemented in a measure called POURPRE, for automatically evaluating answers to definition questions. |
|
usually segment their
<term>
outputs
</term>
. We
|
present
|
the first known
<term>
empirical test
</term>
|
#7787
We present the first known empirical test of an increasingly common speculative claim, by evaluating a representative Chinese-to-English SMT model directly on word sense disambiguation performance, using standard WSD evaluation methodology and datasets from the Senseval-3 Chinese lexical sample task. |
|
the dedicated
<term>
WSD models
</term>
. We
|
present
|
controlled experiments showing the
<term>
|
#7918
We present controlled experiments showing the WSD accuracy of current typical SMT models to be significantly lower than that of all the dedicated WSD models considered. |
|
will be made available . In this paper we
|
present
|
our recent work on harvesting
<term>
English-Chinese
|
#8207
In this paper we present our recent work on harvesting English-Chinese bitexts of the laws of Hong Kong from the Web and aligning them to the subparagraph level via utilizing the numbering system in the legal text hierarchy. |
|
<term>
natural language generation
</term>
. We
|
present
|
a novel
<term>
method
</term>
for
<term>
discovering
|
#8984
We present a novel method for discovering parallel sentences in comparable, non-parallel corpora. |
|
translation
</term><term>
quality
</term>
? We
|
present
|
empirical results casting doubt on this
|
#9333
We present empirical results casting doubt on this common, but unproved, assumption. |
|
structured data
</term>
. In this paper , we
|
present
|
a
<term>
syntax-based statistical machine
|
#9429
In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. |
|
speed and quality
</term>
. In this paper , we
|
present
|
a novel
<term>
training method
</term>
for
|
#9554
In this paper, we present a novel training method for a localized phrase-based prediction model for statistical machine translation (SMT). |
|
from
<term>
automatic alignments
</term>
. We
|
present
|
a
<term>
Czech-English statistical machine
|
#9779
We present a Czech-English statistical machine translation system which performs tree-to-tree translation of dependency structures. |
|
</term>
of the
<term>
WSI algorithm
</term>
. We
|
present
|
results on
<term>
addressee identification
|
#10236
We present results on addressee identification in four-participants face-to-face meetings using Bayesian Network and Naive Bayes classifiers. |
|
sentences
</term>
. In this paper , we will
|
present
|
a new
<term>
evaluation measure
</term>
which
|
#10360
In this paper, we will present a new evaluation measure which explicitly models block reordering as an edit operation. |
|
<term>
HPSG
</term>
and
<term>
LFG
</term>
. We
|
present
|
an efficient algorithm for the
<term>
redundancy
|
#11119
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. |
|
</term>
of
<term>
abstract moves
</term>
. We also
|
present
|
a prototype
<term>
concordancer
</term>
,
<term>
|
#11761
We also present a prototype concordancer, CARE, which exploits the move-tagged abstracts for digital learning. |
|
show how the two can be integrated , and
|
present
|
an example from an implemented
<term>
bi-directional
|
#15148
After introducing this approach to MT system design, and the basics of monolingual UCG, we will show how the two can be integrated, and present an example from an implemented bi-directional Engllsh-Spanish fragment. |
|
Engllsh-Spanish fragment
</term>
. Finally we will
|
present
|
some outstanding problems with the approach
|
#15161
Finally we will present some outstanding problems with the approach. |
|
<term>
tree-adjoining grammars ( TAG )
</term>
|
present
|
a challenge for the application of
<term>
|
#16434
The unique properties of tree-adjoining grammars (TAG)present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. |
|
translation of natural language
</term>
. We
|
present
|
a variant of
<term>
TAGs
</term>
, called
<term>
|
#16466
We present a variant of TAGs, called synchronous TAGs, which characterize correspondences between languages. |
|
continuous speech recognition
</term>
. First , we
|
present
|
a new paradigm for
<term>
speaker-independent
|
#16991
First, we present a new paradigm for speaker-independent (SI) training of hidden Markov models (HMM), which uses a large amount of speech from a few speakers instead of the traditional practice of using a little speech from many speakers. |