Concordance

Query of 831 (38,743.1 per million)

	or both of its neighbors is not a member	of	the <term> semantic set </term> defined by	#20508 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.
	<term> continuous speech recognition </term>	of	a <term> natural language </term> , it has	#20621 In optical character recognition and continuous speech recognitionof a natural language, it has been difficult to detect error characters which are wrongly deleted and inserted.
	inserted . In order to judge three types	of	the <term> errors </term> , which are characters	#20647 In order to judge three types of the errors, which are characters wrongly substituted, deleted or inserted in a Japanese bunsetsu and an English word, and to correct these errors, this paper proposes new methods using m-th order Markov chain model for Japanese kanji-kana characters and English alphabets, assuming that Markov probability of a correct chain of syllables or kanji-kana characters is greater than that of erroneous chains.
	assuming that <term> Markov probability </term>	of	a correct chain of <term> syllables </term>	#20698 In order to judge three types of the errors, which are characters wrongly substituted, deleted or inserted in a Japanese bunsetsu and an English word, and to correct these errors, this paper proposes new methods using m-th order Markov chain model for Japanese kanji-kana characters and English alphabets, assuming that Markov probabilityof a correct chain of syllables or kanji-kana characters is greater than that of erroneous chains.
	Markov probability </term> of a correct chain	of	<term> syllables </term> or <term> kanji-kana	#20702 In order to judge three types of the errors, which are characters wrongly substituted, deleted or inserted in a Japanese bunsetsu and an English word, and to correct these errors, this paper proposes new methods using m-th order Markov chain model for Japanese kanji-kana characters and English alphabets, assuming that Markov probability of a correct chain of syllables or kanji-kana characters is greater than that of erroneous chains.
	kanji-kana characters </term> is greater than that	of	<term> erroneous chains </term> . From the	#20711 In order to judge three types of the errors, which are characters wrongly substituted, deleted or inserted in a Japanese bunsetsu and an English word, and to correct these errors, this paper proposes new methods using m-th order Markov chain model for Japanese kanji-kana characters and English alphabets, assuming that Markov probability of a correct chain of syllables or kanji-kana characters is greater than that of erroneous chains.
	erroneous chains </term> . From the results	of	the experiments , it is concluded that	#20718 From the results of the experiments, it is concluded that the methods is useful for detecting as well as correcting these errors in Japanese bunsetsu and English words.
	structures </term> , in order to support linking	of	<term> lexical entries </term> to their <term>	#20768 This paper describes the enhancements made, within a unification framework, based on typed feature structures, in order to support linking of lexical entries to their translation equivalents.
	Complete <term> lexical distribution </term>	of	<term> grammatical knowledge </term> is achieved	#20829 Complete lexical distributionof grammatical knowledge is achieved building upon the head-oriented notions of valency and dependency, while inheritance mechanisms are used to capture lexical generalizations.
other,11-2-C94-1061,bq	building upon the <term> head-oriented notions	of	valency and dependency </term> , while <term>	#20839 Complete lexical distribution of grammatical knowledge is achieved building upon the head-oriented notions of valency and dependency, while inheritance mechanisms are used to capture lexical generalizations.
	proposed . It is also a drastic generalization	of	<term> chart Parsing </term> , <term> partial	#20897 It is also a drastic generalization of chart Parsing, partial instantiation of clauses in a program roughly corresponding to arcs in a chart.
	</term> , <term> partial instantiation </term>	of	<term> clauses </term> in a program roughly	#20903 It is also a drastic generalization of chart Parsing, partial instantiationof clauses in a program roughly corresponding to arcs in a chart.
	parsing complexity </term> reduces to that	of	standard <term> chart-based algorithms </term>	#20941 With a parsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms.
	constructed automatically by applying a set	of	<term> extraction and conversion rules </term>	#20988 It contains a lexicon with over 90,000 entries, constructed automatically by applying a set of extraction and conversion rules to entries from machine readable dictionaries.
	The <term> behavioral specification </term>	of	an <term> object-oriented grammar model </term>	#21003 The behavioral specificationof an object-oriented grammar model is considered.
tech,26-2-C94-1080,bq	specification </term> , and <term> concurrency	of	computation </term> . The <term> computation	#21038 The model is based on full lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
	particular , we here elaborate on principles	of	how the <term> global behavior </term> of a	#21068 In particular, we here elaborate on principles of how the global behavior of a lexically distributed grammar and its corresponding parser can be specified in terms of event type networks and event networks, resp.
	principles of how the <term> global behavior </term>	of	a <term> lexically distributed grammar </term>	#21073 In particular, we here elaborate on principles of how the global behaviorof a lexically distributed grammar and its corresponding parser can be specified in terms of event type networks and event networks, resp.
	<term> parser </term> can be specified in terms	of	<term> event type networks </term> and <term>	#21087 In particular, we here elaborate on principles of how the global behavior of a lexically distributed grammar and its corresponding parser can be specified in terms of event type networks and event networks, resp.
	thresholds </term> . Despite the large amount	of	theoretical work done on <term> non-constituent	#21131 Despite the large amount of theoretical work done on non-constituent coordination during the last two decades, many computational systems still treat coordination using adapted parsing strategies, in a similar fashion to the SYSCONJ system developed for ATNs.


	in Help