Concordance

Query method 79 (3,683.2 per million)

	discourse segments </term> are defined and a	method	for <term> discourse segmentation </term> primarily	#17760 In this paper discourse segments are defined and a method for discourse segmentation primarily based on abduction of temporal relations between segments is proposed.
	between <term> segments </term> is proposed . This	method	is precise and <term> computationally feasible	#17777 This method is precise and computationally feasible and is supported by previous work in the area of temporal anaphora resolution.
tech,29-2-C92-1055,bq	implicitly using <term> maximum likelihood	method	</term> , fail to achieve high <term> performance	#17852 Owing to the problem of insufficient training data and approximation error introduced by the language model, traditional statistical approaches, which resolve ambiguities by indirectly and implicitly using maximum likelihood method, fail to achieve high performance in real applications.
	</term> in real applications . The proposed	method	remedies these problems by adjusting the	#17865 The proposed method remedies these problems by adjusting the parameters to maximize the accuracy rate directly.
	unmodified subgraphs </term> . We propose a	method	of attaining such a design through a method	#17981 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.
	method of attaining such a design through a	method	of <term> structure-sharing </term> which avoids	#17989 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.
tech,5-1-C92-3165,bq	paper introduces a robust <term> interactive	method	for speech understanding </term> . The <term>	#18144 This paper introduces a robust interactive method for speech understanding.
	the whole <term> sentence </term> again . This	method	is also capable of handling <term> unknown	#18226 This method is also capable of handling unknown words, which is important in practical systems.
	successfully applied in <term> IR </term> . A novel	method	for adding <term> linguistic annotation </term>	#19947 A novel method for adding linguistic annotation to corpora is presented which involves using a statistical POS tagger in conjunction with unsupervised structure finding methods to derive notions of noun group, verb group, and so on which is inherently extensible to more sophisticated annotation, and does not require a pre-tagged corpus to fit.
	homophone errors </term> . This paper proposes a	method	for detecting and correcting <term> Japanese	#20408 This paper proposes a method for detecting and correcting Japanese homophone errors in compound nouns.
	</term> in <term> compound nouns </term> . This	method	can not only detect <term> Japanese homophone	#20421 This method can not only detect Japanese homophone errors in compound nouns, but also can find the correct candidates for the detected errors automatically.
	correct candidates is one superiority of this	method	over existing methods . The basic idea	#20455 Finding the correct candidates is one superiority of this method over existing methods.
	existing methods . The basic idea of this	method	is that a <term> compound noun </term> component	#20465 The basic idea of this method is that a compound noun component places some restrictions on the semantic categories of the adjoining words.
	</term> of the <term> adjoining words </term> . The	method	accurately determines that a <term> homophone	#20485 The method accurately determines that a homophone is misused in a compound noun if one or both of its neighbors is not a member of the semantic set defined by the homophone.
	by the <term> homophone </term> . Also , the	method	successfully indicates the correct candidates	#20520 Also, the method successfully indicates the correct candidates for the detected homophone errors.
tech,4-1-C94-1077,bq	</term> . A new , flexible <term> inference	method	</term> for <term> Horn logic program </term>	#20883 A new, flexible inference method for Horn logic program is proposed.
	semantic-head-driven generation </term> emerge from this	method	. With a parsimonious <term> instantiation	#20924 Chart-like parsing and semantic-head-driven generation emerge from this method.
tech,5-2-C94-1082,bq	uses a robust <term> island-based parsing	method	</term> controlled by <term> user-defined performance	#21120 The system uses a robust island-based parsing method controlled by user-defined performance thresholds.
	trigram model </term> . This paper describes a	method	of <term> detecting speechrepairs </term> that	#21295 This paper describes a method of detecting speechrepairs that uses a part-of-speech tagger.


	in Help