Concordance

Query proposed 29 >
Shuffle 29 (1,352.0 per million)

A novel <term> evaluation scheme </term> is	proposed	which accounts for the effect of <term> polysemy	#3944 A novel evaluation scheme is proposed which accounts for the effect of polysemy on the clusters, offering us a good insight into the potential and limitations of semantically classifying undisambiguated SCF data.
</term> for <term> Horn logic program </term> is	proposed	. It is also a drastic generalization of	#20889 A new, flexible inference method for Horn logic program is proposed.
<term> synonymous expressions </term> . Our	proposed	method improves the <term> accuracy </term>	#6184 Our proposed method improves the accuracy of our term aggregation system, showing that our approach is successful.
use different <term> dialog schemata </term>	proposed	in empirical <term> conversation analysis	#12382 as a device to represent and to use different dialog schemataproposed in empirical conversation analysis;
the concept of <term> sublanguage </term> , is	proposed	for identifying <term> unknown words </term>	#18301 In this paper, a new mechanism, based on the concept of sublanguage, is proposed for identifying unknown words, especially personal names, in Chinese newspapers.
approach to restricted-domain parsing </term> is	proposed	. In this approach , the definitions of	#13329 An entity-oriented approach to restricted-domain parsing is proposed.
modification of the <term> document </term> is	proposed	. The explanation of an <term> ambiguity </term>	#15659 A new approach for Interactive Machine Translation where the author interacts during the creation or the modification of the document is proposed.
evaluate and compare several , previously	proposed	<term> phrase-based translation models </term>	#2559 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.
real-time response </term> . We have already	proposed	a model , <term> TDMT ( Transfer-Driven Machine	#20231 We have already proposed a model, TDMT (Transfer-Driven Machine Translation), that translates a sentence utilizing examples effectively and performs accurate structural disambiguation and target word selection.
transliteration process </term> . We evaluate the	proposed	methods through several <term> transliteration/back	#5805 We evaluate the proposed methods through several transliteration/back transliteration experiments for English/Chinese and English/Japanese language pairs.
of the <term> HDAGs </term> . We applied the	proposed	method to <term> question classification </term>	#3842 We applied the proposed method to question classification and sentence alignment tasks to evaluate its performance as a similarity measure and a kernel function.
accuracy rate </term> directly . To make the	proposed	algorithm robust , the possible variations	#17883 To make the proposed algorithm robust, the possible variations between the training corpus and the real tasks are also taken into consideration by enlarging the separation margin between the correct candidate and its competing members.
relations </term> between <term> segments </term> is	proposed	. This method is precise and <term> computationally	#17774 In this paper discourse segments are defined and a method for discourse segmentation primarily based on abduction of temporal relations between segments is proposed.
<term> summarization </term> quality of the	proposed	<term> system </term> is state-of-the-art ,	#2888 Overall summarization quality of the proposed system is state-of-the-art, with guaranteed grammaticality of the system output due to the use of a constraint-based parser/generator.
language generator </term> have recently been	proposed	, but a fundamental concern is whether	#2025 Techniques for automatically training modules of a natural language generator have recently been proposed, but a fundamental concern is whether the quality of utterances produced with trainable components can compete with hand-crafted template-based or rule-based approaches.
costly <term> dependency pointers </term> . The	proposed	scheme eliminates <term> redundant copying	#18014 The proposed scheme eliminates redundant copying while maintaining the quasi-destructive scheme's ability to avoid over copying and early copying combined with its ability to handle cyclic structures without algorithmic additions.
, in <term> Chinese newspapers </term> . The	proposed	mechanism includes <term> title-driven name	#18316 The proposed mechanism includes title-driven name recognition, adaptive dynamic word formation, identification of 2-character and 3-character Chinese names without title.
synthesis system </term> . We show that the	proposed	approach is more describable than other	#16407 We show that the proposed approach is more describable than other approaches such as those employing a traditional generative phonological approach.
are presented , that demonstrate how the	proposed	<term> method </term> allows to better generalize	#7423 Experimental results are presented, that demonstrate how the proposed method allows to better generalize from the training data.
transliteration model ( ngram TM ) </term> , is further	proposed	to model the <term> transliteration process	#5795 Under this framework, a joint source-channel transliteration model, also called n-gram transliteration model (ngram TM), is further proposed to model the transliteration process.


	in Help