Concordance

Query be 129 (6,014.3 per million)

how an interesting information piece would	be	found in a <term> large database </term> .	#48 The question is, however, how an interesting information piece would be found in a large database.
. An alternative <term> index </term> could	be	the activity such as discussing , planning	#92 An alternative index could be the activity such as discussing, planning, informing, story-telling, etc.
dominance distribution of speakers </term> might	be	available on the <term> surface </term> and	#175 Emotions and other indices such as the dominance distribution of speakers might be available on the surface and could be used directly.
available on the <term> surface </term> and could	be	used directly . Despite the small size	#182 Emotions and other indices such as the dominance distribution of speakers might be available on the surface and could be used directly.
effectiveness of these <term> indices </term> can	be	obtained . To support engaging human users	#203 Despite the small size of the databases used some results about the effectiveness of these indices can be obtained.
</term> and <term> scenario templates </term> - can	be	used to enhance access to <term> text collections	#299 In this paper we show how two standard outputs from information extraction (IE) systems - named entity annotations and scenario templates - can be used to enhance access to text collections via a standard text browser.
positive indicates further work needs to	be	done on the <term> interface </term> to make	#368 We also report results of a preliminary, qualitative user evaluation of the system, which while broadly positive indicates further work needs to be done on the interface to make users aware of the increased potential of IE-enhanced text browsers.
tested this to see if similar criteria could	be	elicited from duplicating the experiment	#671 We tested this to see if similar criteria could be elicited from duplicating the experiment using machine translation output.
whether they believed the sample output to	be	an <term> expert human translation </term>	#729 The subjects were given three minutes per extract to determine whether they believed the sample output to be an expert human translation or a machine translation.
involved in the decision making process will	be	presented here . <term> Listen-Communicate-Show	#776 The results of this experiment, along with a preliminary analysis of the factors involved in the decision making process will be presented here.
<term> user </term> tells them , they need to	be	more sophisticated at responding to the	#959 However, the improved speech recognition has brought to light a new problem: as dialog systems understand more of what the user tells them, they need to be more sophisticated at responding to the user.
how research in <term> generation </term> can	be	adapted to <term> dialog systems </term> ,	#1002 We show how research in generation can be adapted to dialog systems, and how the high cost of hand-crafting knowledge-based generation systems can be overcome by employing machine learning techniques.
knowledge-based generation systems </term> can	be	overcome by employing <term> machine learning	#1019 We show how research in generation can be adapted to dialog systems, and how the high cost of hand-crafting knowledge-based generation systems can be overcome by employing machine learning techniques.
<term> bag-of-words methods </term> are shown to	be	equivalent to <term> segment order-sensitive	#1571 Further,in their optimum configuration, bag-of-words methods are shown to be equivalent to segment order-sensitive methods in terms of retrieval accuracy, but much faster.
revealed many attractive properties which may	be	used in <term> NLP </term> . In particular	#1616 The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP.
concatenation languages [ RCL ] </term> can	be	parsed in <term> polynomial time </term> and	#1631 In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity.
classical <term> grammatical formalisms </term> can	be	translated into equivalent <term> RCGs </term>	#1642 In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity.
any <term> tree adjoining grammar </term> can	be	parsed in <term> O ( n6 ) time </term> . In	#1670 For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time.
</term> of a <term> search engine </term> can	be	improved dramatically by incorporating	#1881 I show that the performance of a search engine can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the search engine's operational semantics.
<term> Montague semantics </term> which can	be	viewed as a <term> formal computation </term>	#2001 Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form.


	in Help