Concordance

Query a 631 >
Multilevel Sort 631 >
Shuffle 631 (29,418.6 per million)

</term> length . In this paper , we propose	a	novel <term> Cooperative Model </term> for <term>	#3483 In this paper, we propose a novel Cooperative Model for natural language understanding in a dialogue system.
compare our <term> system 's output </term> with	a	<term> benchmark system </term> . This paper	#9827 We also refer to an evaluation method and plan to compare our system's output with a benchmark system.
and generation modules </term> mediated by	a	<term> language neutral meaning representation	#429 The CCLINC Korean-to-English translation system consists of two core modules, language understanding and generation modules mediated by a language neutral meaning representation called a semantic frame.
predict target variables which represent	a	<term> user 's informational goals </term>	#2164 These models, which are built from shallow linguistic features of questions, are employed to predict target variables which represent a user's informational goals.
corpus of bracketed sentences </term> , called	a	<term> Treebank </term> , in combination with	#18952 We use a corpus of bracketed sentences, called a Treebank, in combination with decision tree building to tease out the relevant aspects of a parse tree that will determine the correct parse of a sentence.
translation process </term> . This paper presents	a	new <term> interactive disambiguation scheme	#15712 This paper presents a new interactive disambiguation scheme based on the paraphrasing of a parser's multiple output.
results of this experiment , along with	a	preliminary analysis of the factors involved	#763 The results of this experiment, along with a preliminary analysis of the factors involved in the decision making process will be presented here.
</term> allows a <term> user </term> to explore	a	<term> model </term> of <term> syntax-based statistical	#9855 The method allows a user to explore a model of syntax-based statistical machine translation (MT), to understand the model's strengths and weaknesses, and to compare it to other MT systems.
presented in this paper is the first step in	a	project which aims to cluster and summarise	#5390 The work presented in this paper is the first step in a project which aims to cluster and summarise electronic discussions in the context of help-desk applications.
used in a <term> sentence </term> . They confer	a	<term> meaning structure </term> on the <term>	#11899 They confer a meaning structure on the sentence in which the verb is used.
the <term> disambiguation process </term> in	a	novel way . We use a <term> corpus of bracketed	#18939 HBG incorporates lexical, syntactic, semantic, and structural information from the parse tree into the disambiguation process in a novel way.
After several experiments , and trained with	a	little <term> corpus </term> of 100,000 <term>	#11234 After several experiments, and trained with a little corpus of 100,000 words, the system guesses correctly not placing commas with a precision of 96% and a recall of 98%.
semantic network </term> using a variant of	a	<term> predicate calculus notation </term>	#12143 Node-based inference rules can be constructed in a semantic network using a variant of a predicate calculus notation.
information retrieval techniques </term> use	a	<term> histogram </term> of <term> keywords </term>	#60 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.
sentence </term> appears two or more times in	a	<term> well-written discourse </term> , it	#19243 That is, if a polysemous word such as sentence appears two or more times in a well-written discourse, it is extremely likely that they will all share the same sense.
improvement over the <term> baseline </term> on	a	standard <term> Arabic-English translation	#9648 The best system obtains a 18.6% improvement over the baseline on a standard Arabic-English translation task.
assuming that <term> Markov probability </term> of	a	correct chain of <term> syllables </term> or	#20699 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.
contains a <term> recognition network </term> ,	a	<term> basic mapping </term> , additional <term>	#12484 Each generalized metaphor contains a recognition network, a basic mapping, additional transfer mappings, and an implicit intention component.
</term> . The method accurately determines that	a	<term> homophone </term> is misused in a <term>	#20489 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> planning-based architecture </term> with	a	variety of <term> language processing modules	#3645 The JAVELIN system integrates a flexible, planning-based architecture with a variety of language processing modules to provide an open-domain question answering capability on free text.


	in Help