Concordance

Query present 43 >
Shuffle 43 (2,004.8 per million)

precision metric </term> . In this paper we	present	<term> ONTOSCORE </term> , a system for scoring	#2439 In this paper we present ONTOSCORE, a system for scoring sets of concepts on the basis of an ontology.
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.
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.
<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.
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.
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.
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.
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> 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.
</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.
<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.
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.
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.
warrant serious <term> attention </term> , yet	present	<term> natural language search engines </term>	#1859 These words appear frequently enough in dialog to warrant serious attention, yet present natural language search engines perform poorly on queries containing them.
<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.
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.
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> 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.
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.
results of the evaluations are presented . We	present	an efficient algorithm for <term> chart-based	#17544 We present an efficient algorithm for chart-based phrase structure parsing of natural language that is tailored to the problem of extracting specific information from unrestricted texts where many of the words are unknown and much of the text is irrelevant to the task.


	in Help