</term> and the decision of how to combine them into one or more <term> sentences </term> . In this
judges </term> . We reconceptualize the task into two distinct phases . First , a very simple
grammatical formalisms </term> can be translated into equivalent <term> RCGs </term> without increasing
example , after <term> translation </term> into an equivalent <term> RCG </term> , any <term>
true text </term> through its transformation into the <term> noisy output </term> of an <term>
create a <term> word-trie </term> , transform it into a <term> minimal DFA </term> , then identify
task , and gives them translingual reach into other <term> languages </term> by leveraging
clusters </term> , offering us a good insight into the potential and limitations of <term> semantically
sequences </term> . We incorporate this analysis into a <term> diagnostic tool </term> intended for
basics of <term> SMT </term> : Theory will be put into practice . <term> STTK </term> , a <term> statistical
</term> which takes these <term> features </term> into account . We introduce a new <term> method
take <term> contextual information </term> into account . We evaluate our <term> paraphrase
Our work aims at providing useful insights into the the <term> computational complexity </term>
integrating <term> automatic Q/A </term> applications into real-world environments . <term> FERRET </term>
<term> general-purpose NLP components </term> into a <term> machine translation pipeline </term>
translates <term> English questions </term> into the <term> Prolog </term><term> subset of logic
transformed by a <term> planning algorithm </term> into efficient <term> Prolog </term> , cf. <term>
scruffy texts </term> has been incorporated into a working <term> computer program </term> called
of transforming a <term> disposition </term> into a <term> proposition </term> is referred to
of segments of the <term> discourse </term> into which the <term> utterances </term> naturally
hide detail