|
probabilistic context-free grammars
</term>
working in
|
a
|
' synchronous ' way . Two
<term>
hardness
|
#7470
These models can be viewed as pairs of probabilistic context-free grammars working in a 'synchronous' way. |
|
Generation of Referring Expressions
</term>
: (
|
a
|
)
<term>
numeric-valued attributes
</term>
|
#10661
This paper discusses two problems that arise in the Generation of Referring Expressions: ( a) numeric-valued attributes, such as size or location; (b) perspective-taking in reference. |
|
</term>
are assessed . This article introduces
|
a
|
<term>
bidirectional grammar generation system
|
#16213
This article introduces a bidirectional grammar generation system called feature structure-directed generation, developed for a dialogue translation system. |
|
context-dependent phonetic modelling
</term>
, the use of
|
a
|
<term>
bigram language model
</term>
in conjunction
|
#18718
These include context-dependent phonetic modelling, the use of a bigram language model in conjunction with a probabilistic LR parser, and refinements made to the lexicon. |
|
processing algorithms
</term>
. We examine
|
a
|
broad range of
<term>
texts
</term>
to show
|
#15195
We examine a broad range of texts to show how the distribution of demonstrative forms and functions is genre dependent. |
|
Essay Evaluation Service
</term>
includes
|
a
|
capability that labels
<term>
sentences
</term>
|
#6651
CriterionSM Online Essay Evaluation Service includes a capability that labels sentences in student writing with essay-based discourse elements (e.g., thesis statements). |
|
tree-adjoining grammars ( TAG )
</term>
present
|
a
|
challenge for the application of
<term>
TAGs
|
#16435
The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. |
|
machine learning techniques
</term>
to build
|
a
|
<term>
comma checker
</term>
to be integrated
|
#11214
In this paper, we describe the research using machine learning techniques to build a comma checker to be integrated in a grammar checker for Basque. |
|
</term>
. Annotating
<term>
honorifics
</term>
is
|
a
|
complex task that involves identifying
|
#8619
Annotating honorifics is a complex task that involves identifying a predicate with honorifics, assigning ranks to referents of the predicate, calibrating the ranks, and connecting referents with their predicates. |
|
<term>
natural language system
</term>
needs
|
a
|
<term>
computational lexicon
</term>
, each
|
#15921
Although every natural language system needs a computational lexicon, each system puts different amounts and types of information into its lexicon according to its individual needs. |
|
<term>
sentences
</term>
. We have developed
|
a
|
<term>
computational model
</term>
of the process
|
#15437
We have developed a computational model of the process of describing the layout of an apartment or house, a much-studied discourse task first characterized linguistically by Linde (1974). |
|
<term>
verb
</term>
is used . The paper outlines
|
a
|
<term>
computational theory
</term>
of
<term>
|
#11915
The paper outlines a computational theory of human plausible reasoning constructed from analysis of people's answers to everyday questions. |
|
these deviations with little difficulty . If
|
a
|
<term>
computer system
</term>
wishes to accept
|
#12714
If a computer system wishes to accept natural language input from its users on a routine basis, it must display a similar indifference. |
|
This report describes
<term>
Paul
</term>
,
|
a
|
<term>
computer text generation system
</term>
|
#13749
This report describes Paul, a computer text generation system designed to create cohesive text through the use of lexical substitutions. |
|
generation
</term>
, since it is inherently
|
a
|
conglomeration of individual
<term>
lexical
|
#18071
The transfer phase in machine translation (MT) systems has been considered to be more complicated than analysis and generation, since it is inherently a conglomeration of individual lexical rules. |
|
definition
</term>
are presented , along with
|
a
|
<term>
control structure
</term>
for an
<term>
|
#13416
Representative samples from an entity-oriented language definition are presented, along with a control structure for an entity-oriented parser, some parsing strategies that use the control structure, and worked examples of parses. |
|
networks
</term>
one could just record and store
|
a
|
<term>
conversation
</term>
for documentation
|
#31
Given the development of storage media and networks one could just record and store a conversation for documentation. |
|
Link detection
</term>
has been regarded as
|
a
|
core technology for the
<term>
Topic Detection
|
#4048
Link detection has been regarded as a core technology for the Topic Detection and Tracking tasks of new event detection. |
|
identification of paraphrases
</term>
from
|
a
|
<term>
corpus of multiple English translations
|
#1788
We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. |
|
meanings
</term>
. In this paper , we present
|
a
|
<term>
corpus-based supervised word sense
|
#5985
In this paper, we present a corpus-based supervised word sense disambiguation (WSD) system for Dutch which combines statistical classification (maximum entropy) with linguistic information. |