Concordance

Query of 831 >
Shuffle 831 (38,743.1 per million)

	</term> , suggest that the highest levels	of	performance can be obtained through relatively	#2605 Our empirical results, which hold for all examined language pairs, suggest that the highest levels of performance can be obtained through relatively simple means: heuristic learning of phrase translations from word-based alignments and lexical weighting of phrase translations.
	or <term> English-Japanese </term> , because	of	the <term> word segmentation problem </term>	#7718 Yet, they are scarcely used for the assessment of language pairs like English-Chinese or English-Japanese, because of the word segmentation problem.
	the test . The <term> accuracy rate </term>	of	<term> syntactic disambiguation </term> is	#17929 The accuracy rateof syntactic disambiguation is raised from 46.0% to 60.62% by using this novel approach.
	non-deterministic parsing choices </term>	of	the <term> main parser </term> for a <term> language	#1704 The non-deterministic parsing choicesof the main parser for a language L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L.
	formulas </term> , and interpreted by sets	of	<term> directed graphs </term> which satisfy	#14692 We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them.
	</term> offers techniques superior to those	of	humans for these aspects , while still	#12629 This paper defends that view, but claims that direct imitation of human performance is not the best way to implement many of these non-literal aspects of communication; that the new technology of powerful personal computers with integral graphics displays offers techniques superior to those of humans for these aspects, while still satisfying human communication needs.
	unmodified subgraphs </term> . We propose a method	of	attaining such a design through a method	#17982 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated with structure-sharing of graphs without any use of costly dependency pointers.
	the first known <term> empirical test </term>	of	an increasingly common speculative claim	#7793 We present the first known empirical testof an increasingly common speculative claim, by evaluating a representative Chinese-to-English SMT model directly on word sense disambiguation performance, using standard WSD evaluation methodology and datasets from the Senseval-3 Chinese lexical sample task.
	non-NP-antecedents </term> . We present a set	of	<term> features </term> designed for <term> pronoun	#4002 We present a set of features designed for pronoun resolution in spoken dialogue and determine the most promising features.
	visualizing and directing the process </term>	of	<term> translating a sentence </term> . The	#9843 This paper describes a method of interactively visualizing and directing the processof translating a sentence.
	APs </term> , meets the vital requirements	of	<term> spoken language translation </term>	#20361 Thus, our model, TDMT on APs, meets the vital requirements of spoken language translation.
	<term> ranks </term> to <term> referents </term>	of	the <term> predicate </term> , calibrating	#8634 Annotating honorifics is a complex task that involves identifying a predicate with honorifics, assigning ranks to referentsof the predicate, calibrating the ranks, and connecting referents with their predicates.
	computations . We also discuss some practical ways	of	dealing with <term> complexity </term> . In	#10082 We also discuss some practical ways of dealing with complexity.
	indices </term> such as the time and place	of	the rejoinder and the attendance . An alternative	#81 Traditional information retrieval techniques use a histogram of keywords as the document representation but oral communication may offer additional indices such as the time and place of the rejoinder and the attendance.
	model </term> allows a careful examination	of	the <term> computational complexity </term>	#14811 Our model allows a careful examination of the computational complexity of unification.
other,8-8-A94-1011,bq	exploit <term> sophisticated representations	of	documents </term> , and lends some support	#20144 It therefore shows that statistical systems can exploit sophisticated representations of documents, and lends some support to the use of more linguistically sophisticated representations for document classification.
	manner . We shall introduce the concept	of	a <term> chart </term> that works outward from	#15533 We shall introduce the concept of a chart that works outward from islands and makes sense of as much of the sentence as it is actually possible, and after that will lead to predictions of missing fragments.
	</term> will demonstrate an additional increase	of	correlation between <term> automatic evaluation	#10452 Results from experiments with word dependent substitution costs will demonstrate an additional increase of correlation between automatic evaluation measures and human judgment.
other,8-3-C90-3045,bq	intended usage is to relate <term> expressions	of	natural languages </term> to their associated	#16491 The formalism's intended usage is to relate expressions of natural languages to their associated semantics represented in a logical form language, or to their translates in another natural language; in summary, we intend it to allow TAGs to be used beyond their role in syntax proper.
	authors try to reconstruct the geometric model	of	the global scene from the scenic descriptions	#18418 In order to understand the described world, the authors try to reconstruct the geometric model of the global scene from the scenic descriptions drawing a space.


	in Help