Several extensions of this basic idea are being discussed and/or evaluated : Similar to activities one can define subsets of larger <term> database </term> and detect those automatically which is shown on a large <term> database </term> of <term> TV shows </term> .
To support engaging human users in robust , <term> mixed-initiative speech dialogue interactions </term> which reach beyond current capabilities in <term> dialogue systems </term> , the <term> DARPA Communicator program </term> [ 1 ] is funding the development of a <term> distributed message-passing infrastructure </term> for <term> dialogue systems </term> which all <term> Communicator </term> participants are using .
To support engaging human users in robust , <term> mixed-initiative speech dialogue interactions </term> which reach beyond current capabilities in <term> dialogue systems </term> , the <term> DARPA Communicator program </term> [ 1 ] is funding the development of a <term> distributed message-passing infrastructure </term> for <term> dialogue systems </term> which all <term> Communicator </term> participants are using .
We also report results of a preliminary , <term> qualitative user evaluation </term> of the <term> system </term> , which while broadly positive indicates further work needs to be done on the <term> interface </term> to make <term> users </term> aware of the increased potential of <term> IE-enhanced text browsers </term> .
Even more illuminating was the factors on which the <term> assessors </term> made their decisions .
Additionally , they were asked to mark the <term> word </term> at which they made this decision .
<term> Sentence planning </term> is a set of inter-related but distinct tasks , one of which is <term> sentence scoping </term> , i.e. the choice of <term> syntactic structure </term> for elementary <term> speech acts </term> and the decision of how to combine them into one or more <term> sentences </term> .
The theoretical study of the <term> range concatenation grammar [ RCG ] formalism </term> has revealed many attractive properties which may be used in <term> NLP </term> .
The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L.
This paper presents a <term> formal analysis </term> for a large class of <term> words </term> called <term> alternative markers </term> , which includes <term> other ( than ) </term> , <term> such ( as ) </term> , and <term> besides </term> .
Here we emphasize the connection to <term> Montague semantics </term> which can be viewed as a <term> formal computation </term> of the <term> logical form </term> .
These <term> models </term> , which are built from <term> shallow linguistic features </term> of <term> questions </term> , are employed to predict target variables which represent a <term> user 's informational goals </term> .
These <term> models </term> , which are built from <term> shallow linguistic features </term> of <term> questions </term> , are employed to predict target variables which represent a <term> user 's informational goals </term> .
Motivated by the success of <term> ensemble methods </term> in <term> machine learning </term> and other areas of <term> natural language processing </term> , we developed a <term> multi-strategy and multi-source approach to question answering </term> which is based on combining the results from different <term> answering agents </term> searching for <term> answers </term> in multiple <term> corpora </term> .
Our empirical results , which hold for all examined <term> language pairs </term> , suggest that the highest levels of performance can be obtained through relatively simple means : <term> heuristic learning </term> of <term> phrase translations </term> from <term> word-based alignments </term> and <term> lexical weighting </term> of <term> phrase translations </term> .
We also introduce a new way of automatically identifying <term> predicate argument structures </term> , which is central to our <term> IE paradigm </term> .
We describe a new approach which involves clustering <term> subcategorization frame ( SCF ) </term> distributions using the <term> Information Bottleneck </term> and <term> nearest neighbour </term> methods .
A novel <term> evaluation scheme </term> is proposed which accounts for the effect of <term> polysemy </term> on the <term> clusters </term> , offering us a good insight into the potential and limitations of <term> semantically classifying </term><term> undisambiguated SCF data </term> .
In this paper , we evaluate an approach to automatically acquire <term> sense-tagged training data </term> from <term> English-Chinese parallel corpora </term> , which are then used for disambiguating the <term> nouns </term> in the <term> SENSEVAL-2 English lexical sample task </term> .
The results show that the <term> features </term> in terms of which we formulate our <term> heuristic principles </term> have significant <term> predictive power </term> , and that <term> rules </term> that closely resemble our <term> Horn clauses </term> can be learnt automatically from these <term> features </term> .
hide detail