Concordance

Query how 34 >
Shuffle 34 (1,585.2 per million)

adapted to <term> dialog systems </term> , and	how	the high cost of hand-crafting <term> knowledge-based	#1009 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.
Zernik87 ] . Second , we show in this paper	how	a <term> lexical hierarchy </term> is used	#15875 Second, we show in this paper how a lexical hierarchy is used in predicting new linguistic concepts.
translation systems </term> , and demonstrate	how	our application can be used by <term> developers	#7662 We incorporate this analysis into a diagnostic tool intended for developers of machine translation systems, and demonstrate how our application can be used by developers to explore patterns in machine translation output.
translation probabilities </term> , and show	how	it can be refined to take <term> contextual	#9739 We define a paraphrase probability that allows paraphrases extracted from a bilingual parallel corpus to be ranked using translation probabilities, and show how it can be refined to take contextual information into account.
<term> monolingual UCG </term> , we will show	how	the two can be integrated , and present	#15140 After introducing this approach to MT system design, and the basics of monolingual UCG, we will show how the two can be integrated, and present an example from an implemented bi-directional Engllsh-Spanish fragment.
classifiers </term> . First , we investigate	how	well the <term> addressee </term> of a <term>	#10257 First, we investigate how well the addressee of a dialogue act can be predicted based on gaze, utterance and conversational context features.
time </term> . Furthermore , we will show	how	some <term> evaluation measures </term> can	#10390 Furthermore, we will show how some evaluation measures can be improved by the introduction of word-dependent substitution costs.
characterization of what a <term> user model </term> is and	how	it can be used . The types of information	#16061 It begins with a characterization of what a user model is and how it can be used.
restrictive statements </term> . The paper shows	how	conventional algorithms for the analysis	#15307 The paper shows how conventional algorithms for the analysis of context free languages can be adapted to the CCR formalism.
set representation </term> . We investigate	how	sets of individually high-precision <term>	#20071 We investigate how sets of individually high-precision rules can result in a low precision when used together, and develop some theory about these probably-correct rules.
based on processing . Finally , it shows	how	processing accounts can be described formally	#21196 Finally, it shows how processing accounts can be described formally and declaratively in terms of Dynamic Grammars.
Discourse processing </term> requires recognizing	how	the <term> utterances </term> of the <term> discourse	#14330 Discourse processing requires recognizing how the utterances of the discourse aggregate into segments, recognizing the intentions expressed in the discourse and the relationships among intentions, and tracking the discourse through the operation of the mechanisms associated with attentional state.
</term> , the <term> theory </term> specifies	how	different information in <term> memory </term>	#11951 Unlike logic, the theory specifies how different information in memory affects the certainty of the conclusions drawn.
standard <term> text browser </term> . We describe	how	this information is used in a <term> prototype	#315 We describe how this information is used in a prototype system designed to support information workers' access to a pharmaceutical news archive as part of their industry watch function.
documentation . The question is , however ,	how	an interesting information piece would	#42 The question is, however, how an interesting information piece would be found in a large database.
this <term> complexity </term> , we describe	how	<term> disjunctive </term> values can be specified	#14841 To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form.
broad range of <term> texts </term> to show	how	the distribution of <term> demonstrative	#15202 We examine a broad range of texts to show how the distribution of demonstrative forms and functions is genre dependent.
that <term> users </term> need by analyzing	how	a <term> user </term> interacts with a system	#11680 FERRET utilizes a novel approach to Q/A known as predictive questioning which attempts to identify the questions (and answers) that users need by analyzing how a user interacts with a system while gathering information related to a particular scenario.
particular , we here elaborate on principles of	how	the <term> global behavior </term> of a <term>	#21069 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.
probabilities </term> is unstable . Finally , we show	how	this new <term> tagger </term> achieves state-of-the-art	#5599 Finally, we show how this new tagger achieves state-of-the-art results in a supervised, non-training intensive framework.


	in Help