Concordance

Query which 108 >
Sort Right 108 (5,035.2 per million)

propose a <term> logical formalism </term> ,	which	, among other things , is suitable for	#13890 In this paper we propose a logical formalism, which, among other things, is suitable for representing determiners without forcing a particular interpretation when their meaning is still not clear.
</term> . A research program is described in	which	a particular <term> representational format	#11831 A research program is described in which a particular representational format for meaning is tested as broadly as possible.
<term> evaluation scheme </term> is proposed	which	accounts for the effect of <term> polysemy	#3945 A novel evaluation scheme is proposed which accounts for the effect of polysemy on the clusters, offering us a good insight into the potential and limitations of semantically classifying undisambiguated SCF data.
this paper is the first step in a project	which	aims to cluster and summarise <term> electronic	#5392 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.
infrastructure </term> for <term> dialogue systems </term>	which	all <term> Communicator </term> participants	#246 To support engaging human users in robust, mixed-initiative speech dialogue interactions which reach beyond current capabilities in dialogue systems, the DARPA Communicator program [1] is funding the development of a distributed message-passing infrastructure for dialogue systemswhich all Communicator participants are using.
categories </term> in <term> local trees </term>	which	allow the <term> statement of generalizations	#15273 CCRs are Boolean conditions on the cooccurrence of categories in local treeswhich allow the statement of generalizations which cannot be captured in other current syntax formalisms.
phrase-based statistical machine translation </term>	which	allows for the <term> retrieval </term> of	#9135 In this paper we describe a novel data structure for phrase-based statistical machine translationwhich allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decoder implementations.
Travel Information Service ) system </term> ,	which	allows it to answer a <term> question </term>	#19350 This paper describes an extension to the MIT ATIS (Air Travel Information Service) system, which allows it to answer a question when a full linguistic analysis fails.
with implicit <term> fuzzy quantifiers </term>	which	are approximations to all and always ,	#13518 An idea which underlies the theory described in this paper is that a disposition may be viewed as a proposition with implicit fuzzy quantifierswhich are approximations to all and always, e.g., almost all, almost always, most, frequently, etc.
WH-questions </term> . These <term> models </term> ,	which	are built from <term> shallow linguistic	#2146 These models, which are built from shallow linguistic features of questions, are employed to predict target variables which represent a user's informational goals.
judge three types of the <term> errors </term> ,	which	are characters wrongly substituted , deleted	#20651 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.
. By using commands or <term> rules </term>	which	are defined to facilitate the construction	#12316 By using commands or ruleswhich are defined to facilitate the construction of format expected or some mathematical expressions, elaborate and pretty documents can be successfully obtained.
</term> rely on <term> predominant senses </term>	which	are derived automatically from <term> raw	#11016 Our combination methods rely on predominant senseswhich are derived automatically from raw text.
underspecified chart representations </term>	which	are derived from <term> dominance graphs </term>	#11158 The algorithm operates on underspecified chart representationswhich are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars.
scores and aggregates the elastic constraints	which	are induced by p. The paper closes with	#13655 In this approach to semantics, the meaning of a proposition, p, is represented as a procedure which tests, scores and aggregates the elastic constraints which are induced by p.
applicable to many other <term> NLP problems </term>	which	are naturally framed as <term> ranking tasks	#8961 Although the experiments in this article are on natural language parsing (NLP), the approach should be applicable to many other NLP problemswhich are naturally framed as ranking tasks, for example, speech recognition, machine translation, or natural language generation.
objects are <term> Chinese-English texts </term> ,	which	are selected from different <term> language	#20605 Most importantly, the experimental objects are Chinese-English texts, which are selected from different language families.
by providing an interpretation for values	which	are specified by <term> disjunctions </term>	#14739 This semantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions and path values embedded within disjunctions.
English-Chinese parallel corpora </term> ,	which	are then used for disambiguating the <term>	#4840 In this paper, we evaluate an approach to automatically acquire sense-tagged training data from English-Chinese parallel corpora, which are then used for disambiguating the nouns in the SENSEVAL-2 English lexical sample task.
difficult to detect <term> error characters </term>	which	are wrongly deleted and inserted . In order	#20634 In optical character recognition and continuous speech recognition of a natural language, it has been difficult to detect error characterswhich are wrongly deleted and inserted.


	in Help