participants are using . In this presentation , we describe the features of and requirements for a
a standard <term> text browser </term> . We describe how this information is used in a <term>
with the best <term> confidence </term> . We describe a three-tiered approach for <term> evaluation
and <term> component performance </term> . We describe our use of this approach in numerous fielded
the <term> hand-crafted system </term> . We describe a set of <term> supervised machine learning
among the target variables . This paper describes a method for <term> utterance classification
character recognition ( OCR ) model </term> that describes an end-to-end process in the <term> noisy
using the <term> language model </term> . We describe a simple <term> unsupervised technique </term>
<term> NE types </term> . In this paper , we describe a <term> phrase-based unigram model </term>
undisambiguated <term> corpus data </term> . We describe a new approach which involves clustering
evaluating <term> WSD programs </term> . We describe the ongoing construction of a <term> large
over <term> non-Bayesian models </term> . We describe a new method for the representation of
focused on <term> parsing </term> , the techniques described generalize naturally to NLP structures
retrieval </term> from complex news articles describing multi-event stories published over time
direct application of existing metrics . We describe a <term> method for identifying systematic
method developed for <term> ILIMP </term> are described briefly , as well as the use of <term> ILIMP
million <term> words </term> . In this paper , we describe <term> data collection </term> , <term> transcription
<term> corpus-based investigations </term> are described . Moreover , some examples are given that
boosting approach to ranking problems </term> described in Freund et al. ( 1998 ) . We apply the
</term> is NP-hard , several approximations are described and empirically compared . In experiments
hide detail