a caselabelled dependency represening
Báo cáo khoa học: "ENGLISH GENERATOR FOR A CASE-LABELLED DEPENDENCY REPRESENING" pdf
Ngày tải lên :
09/03/2014, 01:20
... Research and
Development; vol. i.
Bo~uraev, B.K. and K. Sparck Jones (1983) A natural
language front end to data bases with
evaluative feedback. In New Applications of
Da~aha~as (Ed. Garadin and ... application domains: notably as a part of
a free text retrieval system and as part of a
natural language front end to a relational database
system.
i. Introduction
This pa[~er describes a progrmn ...
retrieval (Sparck Jones and Tait, 198 4a and 1984b)
and relational database access (Bcguraev and
Sparck Jales, 1983).
The program described here is efficient (rarely
taking more than a few fractions...
- 4
- 419
- 0
Tài liệu Báo cáo khoa học: "Word Order in German: A Formal Dependency Grammar Using a Topological Hierarchy" pptx
Ngày tải lên :
20/02/2014, 18:20
... of
Utrecht.
Kahane Sylvain, Alexis Nasr, Owen Rambow, 1998,
“Pseudo-Projectivity: a Polynomially Parsable
Non-Projective Dependency Grammar”, COLING-
ACL’98, Montreal, 646-52.
Kathol Andreas, 1995, Linearization-based ... in contrast to X-bar syntax,
3.1 Definition of the Grammar
For a grammar, the parameters to instantiate
are the vocabulary V, the set of (lexical) cate-
gories C, the set of syntactic relations ... syntactic
representation. Following Tesnière (1959) and
numerous analyses that have since corrobo-
rated his analysis, we assume that the relative
pronoun plays a double syntactic role:
• On one hand, it has a...
- 8
- 575
- 0
Báo cáo khoa học: "A New String-to-Dependency Machine Translation Algorithm with a Target Dependency Language Model" pot
Ngày tải lên :
17/03/2014, 02:20
... up.
cat(D
a
red apple
)
= LA(cat(D
a
), LA(cat(D
red
), cat(D
apple
)))
= LA(LC(cat(D
a
), cat(D
red
)), cat(D
apple
))
Based on Theorem 2, it follows that combinatory
operation of categories has ... 2003. Syntax-
based language models for statistical machine transla-
tion. In Proceedings of MT Summit IX.
D. Chiang. 2005. A hierarchical phrase-based model for
statistical machine translation. ... exploit various
translation fragments learned in the training data,
while the operations in mono-lingual parsing were
designed to avoid artificial ambiguity of derivation.
Charniak et al. (2003)...
- 9
- 442
- 0
Tài liệu Báo cáo khoa học: "A probabilistic generative model for an intermediate constituency-dependency representation" pptx
Ngày tải lên :
20/02/2014, 04:20
... Portugal.
Federico Sangati and Chiara Mazza. 2009. An English
Dependency Treebank
`
a la Tesni
`
ere. In The 8th In-
ternational Workshop on Treebanks and Linguistic
Theories, pages 173–184, Milan, ... have chosen the
same strategy we have described in (Sangati et al.,
2009). The idea consists of utilizing a state of the
art parser to compute a list of k-best candidates of
a test sentence, and ... coordination, a linguistic phenomena highly
abundant in natural language production, but of-
ten neglected when it comes to evaluating parsing
resources. We have therefore proposed a special
evaluation...
- 6
- 555
- 0
Tài liệu Báo cáo khoa học: "Japanese Dependency Parsing Using Co-occurrence Information and a Combination of Case Elements" pdf
Ngày tải lên :
20/02/2014, 12:20
... (Kurohashi and Na-
gao, 1994) or CaboCha (Kudo and Matsumoto,
2002). Although this information is less accu-
rate than manually annotated information, these
automatic analyzers provide a large amount ... between a case element and a verb.
The recent availability of more corpora has en-
abled much information about dependency rela-
tions to be obtained by using a Japanese depen-
dency analyzer such as ... data we used was Kyodai Cor-
pus 3.0, a corpus manually annotated with depen-
dency relations (Kurohashi and Nagao, 199 8a) .
The statistics of the data are as follows:
• Training data: 24,263 sentences,...
- 8
- 481
- 0
Tài liệu Báo cáo khoa học: "A Pipeline Framework for Dependency Parsing" ppt
Ngày tải lên :
20/02/2014, 12:20
... that are assigned the
correct head. Complete accuracy (CA) indicates
the fraction of sentences that have a complete cor-
rect analysis. We also measure that root accuracy
(RA) and leaf accuracy ... features. Overall, the average number
of active features in an example is about 50.
4.2 Evaluation
We use the same evaluation metrics as in (McDon-
ald et al., 2005). Dependency accuracy (DA) ... words
after w
2
(as in (Yamada and Matsumoto, 2003)).
The key additional feature we use, relative to (Ya-
mada and Matsumoto, 2003), is that we include
the previous predicted action as a feature....
- 8
- 581
- 0
Tài liệu Báo cáo khoa học: "Topological Dependency Trees: A Constraint-Based Account of Linear Precedence" ppt
Ngày tải lên :
20/02/2014, 18:20
... lieben
n
d
n
v
v
mf
df
mf
xf
5.3 Obligatory Head-final Placement
Verb clusters are typically head-final in German:
non-finite verbs precede their verbal heads.
(9) (dass)
(that)
Maria
Maria
nom
einen
a
Mann
man
acc
lieben
love
wird
will
(10)
*
(dass) ... July.
Erhard Hinrichs and Tsuneko Nakazawa. 1994. Lin-
earizing AUXs in German verbal complexes. In
Nerbonne et al. (Nerbonne et al., 1994), pages 11–
37.
Sylvain Kahane, Alexis Nasr, and Owen Rambow.
1998. ... class; however, modals such as
k
¨
onnen do, and may land in either canonical (11)
or in extraposed (12) position. This behavior is
called ‘optional auxiliary flip’.
(11) (dass)
(that)
Maria
Maria
einen
a
Mann
man
lieben
love
k
¨
onnen
can
wird
will
(that)...
- 8
- 353
- 0
Tài liệu Báo cáo khoa học: "Pseudo-Projectivity: A Polynomially Parsable Non-Projective Dependency Grammar" docx
Ngày tải lên :
20/02/2014, 18:20
... Non-Projective
Dependency Grammar
Sylvain Kahane* and Alexis Nasr t and Owen Rambowt
• TALANA Universit@ Paris 7 (sk0ccr. jussieu.fr)
t LIA Universit@ d'Avignon (alexis. nasr©lia, univ-avignon, ...
structure grammars do not. One problem that
has posed an impediment to more wide-spread
acceptance of dependency grammars is the fact
that there is no computationally tractable ver-
sion of dependency ... beans Fernando thought yesterday Milagro claims Carlos
eats slowly
Vcl~us¢
N~au*e
beans Fernando yester
Nno m claims Vtrans
Milagro
Nnom eats
Adv
I I
Carlos slowly
Figure 4: A sample...
- 7
- 348
- 0
Báo cáo khoa học: "A Transition-Based Parser for 2-Planar Dependency Structures" pot
Ngày tải lên :
07/03/2014, 22:20
... empirical ac-
curacy that can be obtained with transition-based
2-planar parsing, we have evaluated the parser
on four data sets from the CoNLL-X shared task
(Buchholz and Marsi, 2006): Czech, Danish, ... European Chapter of the Association
for Computational Linguistics (EACL), pages 291–
299.
Jan Haji
ˇ
c, Otakar Smr
ˇ
z, Petr Zem
´
anek, Jan
ˇ
Snaidauf,
and Emanuel Be
ˇ
ska. 2004. Prague Arabic ... single-head and
acyclicity constraints, guarantees that the depen-
dency graphs associated with reachable configura-
tions are always 2-planar dependency forests.
For completeness, we assume an extended...
- 10
- 281
- 0
Báo cáo khoa học: "Cross-Domain Dependency Parsing Using a Deep Linguistic Grammar" docx
Ngày tải lên :
08/03/2014, 00:20
... motivated grammar-driven parsing systems
achieved high accuracy which are comparable to
the treebank-based statistical parsers. Notably are
the constraint-based linguistic frameworks with
mathematical ... Michael Riley, Brian Roark, and Richard
Sproat. 2006. Map adaptation of stochastic grammars.
Computer speech and language, 20(1):41–68.
Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X shared
task ... with
mathematical rigor, and provide grammatical anal-
yses for a large variety of phenomena. For in-
stance, the Head-Driven Phrase Structure Gram-
mar (Pollard and Sag, 1994) has been success-
fully applied...
- 9
- 349
- 0
Báo cáo khoa học: "A Deductive Approach to Dependency Parsing∗" potx
Ngày tải lên :
08/03/2014, 01:20
... to
allow w
0
to be linked to the real sentence head.
3.3 ES99 (Eisner and Satta, 99)
Eisner and Satta (1999) define an O(n
3
) parser for
split head automaton grammars that can be used
4
Alternatively, ... Natural Language Learning
(CoNLL-X), pages 166–170, New York, USA. ACL.
Cristina Barbero, Leonardo Lesmo, Vincenzo Lombarlo,
and Paola Merlo. 1998. Integration of syntactic
and lexical information ... However, in the parsing schemata
for these algorithms we can see (and formally prove)
that they are related: one is a refinement of the other.
Parsing schemata are also a formal tool that can be
used...
- 9
- 415
- 0
Báo cáo khoa học: "Augmented Dependency Grammer: A Simple Interface between the Grammer Rule and the Knowledge" pptx
Ngày tải lên :
09/03/2014, 01:20
... 'SET', 'N A M E' , (&apos ;A& apos; and 'x')
Conceptual Relations: 'N A M E' and 'ELeMent'.
dum my relations: 'ELMI , 'ELM2'
c. Contextual Rule ... Corporation
Kawasaki-city,213 JAPAN and
Yasutomo FUKUMOCHI
Softwear development devision
NSIS Corporation
Kawasaki-city,213 JAPAN
ABSTRACT
This paper describes some operational
aspects of a ... syntactic/semantic
computation for language processing in analysis
and synthesis. It also explains the gap in
semantics and logical meaning, and gives a clear
computaional image of what we call conceptual...
- 7
- 373
- 0
Báo cáo khoa học: "A Discriminative Model for Joint Morphological Disambiguation and Dependency Parsing" ppt
Ngày tải lên :
17/03/2014, 00:20
... by A. We say a
factor “fires” when all its neighboring variables are
4
Variables for link labels can be integrated in a straightfor-
ward manner, if desired.
true and it evaluates to a non-negative ... For adjectives, the ex-
ample shown in Table 1 and Figure 1 is a typical sce-
nario, where an accusative adjective was tagged as
nominative, and was then misanalyzed by the parser
as modifying a ... L
3,6
, CASE
3,acc
and CASE
6,acc
are bolded, indicating
that w
3
and w
6
are linked and both have the accusative case. The ternary factor CASE-LINK, that connects to these
three variable, therefore...
- 10
- 411
- 0
Báo cáo khoa học: "Brutus: A Semantic Role Labeling System Incorporating CCG, CFG, and Dependency Features" pot
Ngày tải lên :
17/03/2014, 01:20
... Argument Mapping Model
An innovation in our approach is to use a separate clas-
sifier to predict an argument mapping feature. An ar-
gument mapping is a mapping from the syntactic argu-
ments of a verbal ... motivates
our discussion of future research for computational se-
mantics with CCG (Section 12).
2 Combinatory Categorial Grammar
Combinatory Categorial Grammar (Steedman, 2000)
is a grammatical ... verbal cat-
egory.
(27) Argument Data. The word, POS, and CCG
category, and treepath of the headwords of each
of the verbal arguments (i.e., PARG depen-
dents), each encoded as a separate binary...
- 9
- 282
- 0
Báo cáo khoa học: "Cross Language Dependency Parsing using a Bilingual Lexicon∗" docx
Ngày tải lên :
17/03/2014, 01:20
... 25-
30.
Paola Merlo, Suzanne Stevenson, Vivian Tsang, and
Gianluca Allaria. 2002. A multilingual paradigm
for automatic verb classification. In ACL-2002,
pages 207–214, Philadelphia, Pennsylvania, USA.
Joakim ... domain
adaption for parsing that has been draw some in-
terests in recent years. Typical domain adaptation
tasks often assume annotated data in new domain
absent or insufficient and a large scale ... essentially different from that. As Chinese
is basically a character-based written language.
Character plays an important role in many means,
most characters can be formed as single-character
words,...
- 9
- 274
- 0
