Concordance

Query present 43 >
Sort Left 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> 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.
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.
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.
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.
<term> sentences </term> . In this paper , we	present	<term> SPoT </term> , a <term> sentence planner	#1340 In this paper, we present SPoT, a sentence planner, and a new methodology for automatically training SPoT on the basis of feedback provided by human judges.
<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.
summary </term> coherent . In this paper , we	present	our work on the detection of <term> question-answer	#6262 In this paper, we present our work on the detection of question-answer pairs in an email conversation for the task of email summarization.
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).
feedback </term> . Based on these results , we	present	an <term> ECA </term> that uses <term> verbal	#5093 Based on these results, we present an ECA that uses verbal and nonverbal grounding acts to update dialogue state.
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.
supervised case </term> . Along the way , we	present	the first comprehensive comparison of <term>	#5531 Along the way, we present the first comprehensive comparison of unsupervised methods for part-of-speech tagging, noting that published results to date have not been comparable across corpora or lexicons.
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.
</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.
standard <term> chart-based algorithms </term> . We	present	an efficient , broad-coverage , <term> principle-based	#20947 We present an efficient, broad-coverage, principle-based parser for English.
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.
BalkaNet </term> and <term> EuroWordNet </term> . We	present	<term> Minimum Bayes-Risk ( MBR ) decoding	#6544 We present Minimum Bayes-Risk (MBR) decoding for statistical machine translation.
<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.


	in Help