list of <term> word strings </term> , where each <term> word string </term> has been obtained
string comparison methods </term> , and run each over both <term> character - and word-segmented
</term> created by the <term> system </term> during each <term> question answering session </term> .
single <term> understandingresult </term> after each <term> user utterance </term> . By holding
generate <term> cooperative responses </term> to each <term> user </term> in <term> spoken dialogue
<term> term aggregation system </term> using each author 's text as a coherent <term> corpus
</term> the system has in the correctness of each <term> extracted field </term> . The <term> information
a set of <term> candidate parses </term> for each input <term> sentence </term> , with associated
not they are <term> translations </term> of each other . Using this <term> approach </term>
order to take advantage of the strengths of each . Applications of <term> path-based inference
in lateral or longitudinal directions . Each <term> character </term> has its own width
<term> generalized metaphor mappings </term> . Each <term> generalized metaphor </term> contains
strength of <term> antecedence recovery </term> for each of the <term> lexical substitutions </term>
discourse-relevant purposes </term> , expressed in each of the <term> linguistic segments </term> as
backgrounds </term> , or <term> goals </term> , at each point in a <term> conversation </term> , difficulties
candidate <term> antecedents </term> and to evaluate each other 's proposals . This paper discusses
needs a <term> computational lexicon </term> , each <term> system </term> puts different amounts
mapping </term> is estimated independently for each <term> training ( reference ) speaker </term>
</term> , performance degrades gracefully . Each of these techniques have been evaluated
</term> of its <term> search space </term> . As each new <term> edge </term> is added to the <term>
hide detail