Concordance

Query into 29 (1,352.0 per million)

</term> and the decision of how to combine them	into	one or more <term> sentences </term> . In this	#1329 Sentence planning is a set of inter-related but distinct tasks, one of which is sentence scoping, i.e. the choice of syntactic structure for elementary speech acts and the decision of how to combine them into one or more sentences.
judges </term> . We reconceptualize the task	into	two distinct phases . First , a very simple	#1369 We reconceptualize the task into two distinct phases.
grammatical formalisms </term> can be translated	into	equivalent <term> RCGs </term> without increasing	#1644 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.
example , after <term> translation </term>	into	an equivalent <term> RCG </term> , any <term>	#1660 For example, after translationinto an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time.
true text </term> through its transformation	into	the <term> noisy output </term> of an <term>	#2703 In this paper, we introduce a generative probabilistic optical character recognition (OCR) model that describes an end-to-end process in the noisy channel framework, progressing from generation of true text through its transformation into the noisy output of an OCR system.
create a <term> word-trie </term> , transform it	into	a <term> minimal DFA </term> , then identify	#3199 We create a word-trie, transform it into a minimal DFA, then identify hubs.
task , and gives them translingual reach	into	other <term> languages </term> by leveraging	#3626 It gives users the ability to spend their time finding more data relevant to their task, and gives them translingual reach into other languages by leveraging human language technology.
clusters </term> , offering us a good insight	into	the potential and limitations of <term> semantically	#3961 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.
sequences </term> . We incorporate this analysis	into	a <term> diagnostic tool </term> intended for	#7648 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.
basics of <term> SMT </term> : Theory will be put	into	practice . <term> STTK </term> , a <term> statistical	#8117 Theory will be put into practice.
</term> which takes these <term> features </term>	into	account . We introduce a new <term> method	#8756 The strength of our approach is that it allows a tree to be represented as an arbitrary set of features, without concerns about how these features interact or overlap and without the need to define a derivation or a generative model which takes these featuresinto account.
take <term> contextual information </term>	into	account . We evaluate our <term> paraphrase	#9748 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 informationinto account.
Our work aims at providing useful insights	into	the the <term> computational complexity </term>	#9996 Our work aims at providing useful insights into the the computational complexity of those problems.
integrating <term> automatic Q/A </term> applications	into	real-world environments . <term> FERRET </term>	#11650 This paper describes FERRET, an interactive question-answering (Q/A) system designed to address the challenges of integrating automatic Q/A applications into real-world environments.
<term> general-purpose NLP components </term>	into	a <term> machine translation pipeline </term>	#11799 The LOGON MT demonstrator assembles independently valuable general-purpose NLP componentsinto a machine translation pipeline that capitalizes on output quality.
translates <term> English questions </term>	into	the <term> Prolog </term><term> subset of logic	#12902 With the aid of a logic-based grammar formalism called extraposition grammars, Chat-80 translates English questionsinto the Prolog subset of logic.
transformed by a <term> planning algorithm </term>	into	efficient <term> Prolog </term> , cf. <term>	#12920 The resulting logical expression is then transformed by a planning algorithminto efficient Prolog, cf. query optimisation in a relational database.
scruffy texts </term> has been incorporated	into	a working <term> computer program </term> called	#13114 This method of using expectations to aid the understanding of scruffy texts has been incorporated into a working computer program called NOMAD, which understands scruffy texts in the domain of Navy messages.
of transforming a <term> disposition </term>	into	a <term> proposition </term> is referred to	#13591 The process of transforming a dispositioninto a proposition is referred to as explicitation or restoration.
of segments of the <term> discourse </term>	into	which the <term> utterances </term> naturally	#14165 The linguistic structure consists of segments of the discourseinto which the utterances naturally aggregate.


	in Help