Concordance

Query new 52 >
Filter all but first hit in document 35 (1,631.8 per million)

	system development </term> and porting to	new	<term> domains </term> via <term> knowledge-based	#506 (iii) Rapid system development and porting to new domains via knowledge-based automated acquisition of grammars.
	Listen-Communicate-Show ( LCS ) </term> is a	new	paradigm for <term> human interaction with	#786 Listen-Communicate-Show (LCS) is a new paradigm for human interaction with data sources.
	recognition </term> has brought to light a	new	problem : as <term> dialog systems </term>	#941 However, the improved speech recognition has brought to light a new problem: as dialog systems understand more of what the user tells them, they need to be more sophisticated at responding to the user.
	</term> , a <term> sentence planner </term> , and a	new	methodology for automatically training <term>	#1349 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.
	baseline </term> of 54.55 % ) . We propose a	new	<term> phrase-based translation model </term>	#2542 We propose a new phrase-based translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrase-based translation models.
	constraint-based parser/generator </term> . We present a	new	<term> part-of-speech tagger </term> that demonstrates	#2912 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.
	predicate-argument structures </term> . We also introduce a	new	way of automatically identifying <term> predicate	#3733 We also introduce a new way of automatically identifying predicate argument structures, which is central to our IE paradigm.
	undisambiguated <term> corpus data </term> . We describe a	new	approach which involves clustering <term>	#3905 We describe a new approach which involves clustering subcategorization frame (SCF) distributions using the Information Bottleneck and nearest neighbour methods.
tech,17-1-P03-1030,bq	Detection and Tracking tasks </term> of <term>	new	event detection </term> . In this paper we	#4059 Link detection has been regarded as a core technology for the Topic Detection and Tracking tasks ofnew event detection.
	algorithm </term> for automatically acquiring	new	<term> stems </term> from a 155 million <term>	#4720 To improve the segmentation accuracy, we use an unsupervised algorithm for automatically acquiring new stems from a 155 million word unsegmented corpus, and re-estimate the model parameters with the expanded vocabulary and training corpus.
	these <term> features </term> . We suggest a	new	goal and evaluation criterion for <term>	#5280 We suggest a new goal and evaluation criterion for word similarity measures.
	positive effect on both tasks . We present a	new	<term> HMM tagger </term> that exploits <term>	#5499 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.
	<term> corpora </term> . This paper proposes a	new	methodology to improve the <term> accuracy	#6118 This paper proposes a new methodology to improve the accuracy of a term aggregation system using each author's text as a coherent corpus.
	thesis statements </term> ) . We describe a	new	system that enhances <term> Criterion </term>	#6673 We describe a new system that enhances Criterion's capability, by evaluating multiple aspects of coherence in essays.
	building <term> translation systems </term> for	new	<term> language pairs </term> or new <term> domains	#8050 This is particularly important when building translation systems for new language pairs or new domains.
	features </term> into account . We introduce a	new	<term> method </term> for the <term> reranking	#8762 We introduce a new method for the reranking task, based on the boosting approach to ranking problems described in Freund et al. (1998).
	In our demonstration at <term> ACL </term> ,	new	<term> users </term> of our <term> tool </term>	#9909 In our demonstration at ACL, new users of our tool will drive a syntax-based decoder for themselves.
	</term> . In this paper , we will present a	new	<term> evaluation measure </term> which explicitly	#10362 In this paper, we will present a new evaluation measure which explicitly models block reordering as an edit operation.
	relative performances . We also introduce a	new	strategy , called <term> Begin/After tagging	#10844 We also introduce a new strategy, called Begin/After tagging or BIA, and show that it is competitive to the best other strategies.
	the best other strategies . We introduce a	new	<term> interactive corpus exploration tool	#10868 We introduce a new interactive corpus exploration tool called InfoMagnets.


	in Help