Concordance

Query present 43 >
Sort Right 43 (2,004.8 per million)

<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.
<term> meanings </term> . In this paper , we	present	a <term> corpus-based supervised word sense	#5984 In this paper, we present a corpus-based supervised word sense disambiguation (WSD) system for Dutch which combines statistical classification (maximum entropy) with linguistic information.
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> question-answer pairing </term> . We	present	a framework for the fast computation of	#6309 We present a framework for the fast computation of lexical affinity models.
achieved by the <term> algorithms </term> , we	present	a method of <term> HMM training </term> that	#5578 Observing that the quality of the lexicon greatly impacts the accuracy that can be achieved by the algorithms, we present a method of HMM training that improves accuracy when training of lexical probabilities is unstable.
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.
significant positive effect on both tasks . We	present	a new <term> HMM tagger </term> that exploits	#5497 We present a new HMM tagger that exploits context on both sides of a word to be tagged, and evaluate it in both the unsupervised and supervised case.
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.
constraint-based parser/generator </term> . We	present	a new <term> part-of-speech tagger </term>	#2910 We present a new part-of-speech tagger that demonstrates the following ideas: (i) explicit use of both preceding and following tag contexts via a dependency network representation, (ii) broad use of lexical features, including jointly conditioning on multiple consecutive words, (iii) effective use of priors in conditional loglinear models, and (iv) fine-grained modeling of unknown word features.
answering session </term> . In this paper we	present	a novel , customizable <term> IE paradigm	#3715 In this paper we present a novel, customizable IE paradigm that takes advantage of predicate-argument structures.
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.
<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.
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).
</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.
<term> NP - and non-NP-antecedents </term> . We	present	a set of <term> features </term> designed for	#3999 We present a set of features designed for pronoun resolution in spoken dialogue and determine the most promising features.
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.
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.
more complex mixtures of techniques . We	present	a <term> syntax-based constraint </term> for	#3229 We present a syntax-based constraint for word alignment, known as the cohesion constraint.
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.
lemmas </term> is smaller and more robust . We	present	a <term> text mining method </term> for finding	#6093 We present a text mining method for finding synonymous expressions based on the distributional hypothesis in a set of coherent corpora.


	in Help