ellipsis resolution in dialogues
Báo cáo khoa học: "Discourse Pragmatics and Ellipsis Resolution in Task-Oriented Natural Language Interfaces" pptx
Ngày tải lên :
08/03/2014, 18:20
... therefore, requires a finer grain substation method than
simply inserting the highest level non-terminals in the in the
ellipsed input in place of the matching non-terminals in the parse
tree ...
original query. However, an informal poll of potential users
suggests that the preferred interpretation of the ellipsis retains
the MEDIA specifier of the original query. The ellipsis resolution ... replacing only "disks" and
producing the phrase "fixed head tape drives", which is
meaningless in the current domain. In these instances the
semantic relations captured in...
- 5
- 417
- 0
Tài liệu Báo cáo khoa học: "Ambiguity resolution in a reductionistic parser" pot
Ngày tải lên :
22/02/2014, 10:20
...
Past Tapanainen and Atro Voutilainen. Compil-
ing and using finite-state syntactic rules. In Pro-
ceedings of the fifteenth International Conference
on Computational Linguistics. COLING-92. Vol. ...
tag.
Smoking
is a main verb in a non-finite con-
struction (hence the lower case tag @my);
cigarette
is an object in a non-finite construction;
inspires
is a
main verb in a finite construction ...
between two kinds of clause: the finite and the non-
finite.
A finite clause typically contains (i) a verb chain,
one or more in length, one of which is a finite verb,
and (ii) a varying number...
- 10
- 373
- 0
Báo cáo khoa học: "Unsupervised Coreference Resolution in a Nonparametric Bayesian Model" potx
Ngày tải lên :
08/03/2014, 02:21
... set with increasing amounts of training data. In all cases for the table,
we are evaluating on the same thirty document test set which is included in our training set, since our system in unsupervised. ... assignment” in that reference).
4 Inference Details
Up until now, we’ve discussed Gibbs sampling, but
we are not interested in sampling from the poste-
rior P (Z|X), but in finding its mode. Instead ... observing the within-document gains
from sharing shown in section 3, we can manually
inspect the most frequently occurring entities in our
corpora. Table 3 shows some of the most frequently
occurring...
- 8
- 399
- 0
Báo cáo khoa học: "Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations" pptx
Ngày tải lên :
08/03/2014, 04:22
... coordination annotation principles
(separating these out simplifies other components
of the algorithm); traces (translates traces and coin-
dexation in trees into corresponding reentrancies in
f-structure ... types against approximately
9,000 tree-fragment types in (Johnson, 2002)) and
fine-grained in its use of lexical information (sub-
cat frames). In contrast to Johnson’s approach, our
LDD resolution ... 2004).
1 Introduction
The determination of syntactic structure is an im-
portant step in natural language processing as syn-
tactic structure strongly determines semantic inter-
pretation in the...
- 8
- 338
- 0
Báo cáo khoa học: "Importance of Pronominal Anaphora resolution in Question Answering systems" pot
Ngày tải lên :
08/03/2014, 05:20
... 2,10% 3,25% 2,57% 1,48% 1,75%
Pronouns in Sentences
Containing 0 pronouns 44,80% 48,09% 51,37% 64,04% 75,06% 77,84% 79,06% 83,79% 84,92% 90,95%
Containing 1 pronoun 30,40% 31,37% 29,46% 23,07% ... 8,10%
Containing 2 pronouns 14,94% 12,99% 12,26% 8,54% 5,27% 4,75% 2,79% 2,56% 2,57% 0,85%
Containing +2 pronouns 9,86% 7,55% 6,90% 4,34% 2,51% 2,39% 0,60% 0,64% 0,88% 0,09%
Ratio of pronominal reference ... Example
Anaphora resolution:
R
a
m B
a
h
adu
Question: “What did Democrats propose for low-income
families?”
Answer: “
They
also want to provide small subsidies for
low-income families in which both...
- 8
- 323
- 0
Báo cáo khoa học: "Anaphor resolution in unrestricted texts with partial parsing" doc
Ngày tải lên :
08/03/2014, 05:21
... principles of
reasoning with uncertainty: e.g. Connoly (1994)
and Mitkov (1997).
Our system can be included into the first
approach. In these integrated approaches the
semantic and domain ... reminding whether the optional
constituent has been parsed in the sentence or not.
This information will be very useful in the
resolution of NLP problems such as ellipsis or
386
because in ... tagging as input, and it will
be applied after the partial parsing of a sentence
(using the grammar described in Figure 4) and
before obtaining its logical formula.
This algorithm is shown in...
- 7
- 274
- 0
Báo cáo khoa học: "Ellipsis Resolution with Underspecified Scope" docx
Ngày tải lên :
08/03/2014, 07:20
... expression ,
a binding constraint ( ) and an equality
constraint between two discourse referents are intro-
duced. Binding constraints are interpreted as equal-
ity in the subordination order. ... unbound presup-
positions remaining after anaphora resolution (cor-
responding to accessibility constraints without bind-
ing constraints) are accommodated, i.e. they end up
in an accessible scope position ... subordination con-
straint that links two source labels and also links
the labels corresponding to and in a parallel
structure , i.e. and for all . Thus
the subordination constraint does not distinguish...
- 8
- 221
- 0
Báo cáo khoa học: "AMBIGUITY RESOLUTION IN THE HUMAN SYNTACTIC PARSER: AN EXPERIMENTAL STUDY" ppt
Ngày tải lên :
08/03/2014, 18:20
... examine something with a magnifier but unlikely
to be examined, but for aliens the likelihoods of
examining and being examined with a magnifier are
more alike. Thus, it seems that the point ... certain sentences, Frazier & Fodor's (1978)
Sausage Machine also behaves like an ISA model. In
explaining their Local Association principle, they
claim that in the first stage of parsing, ... (Abandonment might work in (2)
by abandoning analysis upon the attempt at analysis
of "examined" and then commencing re-analysis either
(a) at a point determined by some internal schedule,...
- 5
- 352
- 0
Báo cáo khoa học: "Well-Nested Parallelism Constraints for Ellipsis Resolution" docx
Ngày tải lên :
08/03/2014, 21:20
... Enu-
merating scope readings becomes solving domi-
nance constraints, while ellipsis resolution is re-
duced to solving parallelism constraints.
Constraint solving subsumes satisfiability
checking. Satisfiability ... description of the
ellipsis meaning, and resolving the ellipsis (i.e. ac-
tually determining its meaning). In this paper we
focus on the problem of resolving ellipsis.
We as-
sume an analysis ... anaphoric
links The interaction of ellipsis and anaphora
(strict/sloppy ambiguity) is modeled by copying
rules, which result in link chains equivalent to
Kehler's (1995) analysis.
For modeling...
- 8
- 324
- 0
Báo cáo khoa học: "Aunification-based approach to multiple VP Ellipsis resolution" pptx
Ngày tải lên :
18/03/2014, 02:20
... this interaction is in-
volved in the treatment of cases of multiple VPE
involving semantically equivalent wffs: in such cases,
syntax often interacts with discourse information to
determine ...
levels of linguistic information can be stated within a
category) is another important aspect of the model
in that it allows for different knowledge sources to
interact in determining VPE acceptability ... structure is one
of the main factors determining VPE resolution in
general. In this sense, the analysis proposed here fits
well with one of the mainstream idea in discourse
theory, which...
- 10
- 172
- 0
