Báo cáo khoa học: "Head-driven Parsing for Lexicalist Grammars: Experimental Results" ppt
Tài liệu Báo cáo khoa học: "Efficient Parsing for Bilexical Context-Free Grammar sand Head Automaton Grammars*" pptx
... We present O(n 4) parsing
algorithms for two bilexical formalisms, improv-
ing the prior upper bounds of O(n5). For a com-
mon special case that was known to allow O(n 3)
parsing (Eisner, ... techniques for
cheaply attaching head information to deriva-
tions can also be exploited in parsing formalisms
other than rewriting systems. The authors have
developed an O(nT)-time p...
Báo cáo khoa học: "EFFICIENT PARSING FOR FRENCH*" potx
... completeness of parsing are proved.
INTRODUCTION
Our aim is twofold. First to provide a linguistical-
ly well motivated categorial grammar for French
(henceforth, FG) which accounts for word order ... precompiled before parsing and the number
of rules increases rapidly or LP statements are checked
on the fly during parsing thus slowing down proces-
sing.
2. THE GRAMMAR
The...
Tài liệu Báo cáo khoa học: "Topic Models for Dynamic Translation Model Adaptation" pptx
... unseen for a given domain s, we are already
performing an implicit form of smoothing (when
computing the expected counts), since each docu-
ment has a distribution over all topics, and therefore
we ... Meeting of the Association for Computational Linguistics, pages 115–119,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
Topic Models for Dyna...
Tài liệu Báo cáo khoa học: "Asynchronous Binarization for Synchronous Grammars" pptx
... them.
2.1 Constructing Translation Forests
The parsing stage builds a forest of derivations by
parsing with the source-side projection of the syn-
chronous grammar. Each forest node P
ij
com-
pactly ... Transforming the entire for-
est to n-ary form is intractable, however, because
the number of hyperedges would be exponential in
n. Instead, we include only the top k n-ary back-
traces...
Tài liệu Báo cáo khoa học: "Guided Learning for Bidirectional Sequence Classification" ppt
... of NN for book. Then we maintain the
top two hypotheses for span book interesting as
shown below. The second most favorable label for
interesting is still JJ, but in the context of VB for
book.
NN ... denote the top state for p as
p.S = argmax
s: M
p
(s)=∅
V (s.T ).
Therefore, for each span p, we have a top hypothe-
sis p.S.T , whose score is the highest among all the
hypotheses...
Báo cáo khoa học: "Clause Restructuring For SMT Not Absolutely Helpful" ppt
... recall for the parsers mentioned in
§3. The numbers are collated for reference only and are
not directly comparable; see the text for details.
3 Parser Performance
We first compare the performance ... to Table 1 for precision and recall for each
model. Note that the CKK reordering requires not
just category labels (e.g. NP) but also function labels
(e.g. SB for subject); parser per...
Báo cáo khoa học: "Parametric Types for Typed Attribute-Value Logic" pptx
... exactly the same structure of informa-
tion states; but an implementor of a feature-
based NLP system, for example, could secretly
perform all of the work for those grammars in
N, and no ...
metric type into a non-parametric sub-hierarchy
that suffices for a fixed grammar (e.g. Figure 2).
The former does not suffice even for fixed gram-
el~t_phon
list_syn~~~elist
list
Figur...
Tài liệu Báo cáo khoa học: "Dependency Hashing for n-best CCG Parsing" doc
... Association for Computational Linguistics, pages 497–505,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
Dependency Hashing for n-best CCG Parsing
Dominick ... supertagging, on parsing accuracy.
1 Introduction
Reranking techniques are commonly used for im-
proving the accuracy of parsing (Charniak and John-
son, 2005). Efficient decodin...
Tài liệu Báo cáo khoa học: "Self-Training for Biomedical Parsing" doc
... June 2008.
c
2008 Association for Computational Linguistics
Self-Training for Biomedical Parsing
David McClosky and Eugene Charniak
Brown Laboratory for Linguistic Information Processing (BLLIP)
Brown ... al.,
2006a; McClosky et al., 2006b).
One possible use for this technique is for
parser adaptation — initially training the parser
on one type of data for which hand-labeled tr...
Tài liệu Báo cáo khoa học: "Incremental Parsing Models for Dialog Task Structure" doc
... partner.
In contrast to other work on discourse parsing,
we wish to use the parsing process directly for di-
alog management (rather than for information ex-
traction or summarization). This inuences ... to improved
performance for any method. One utterance of
context is best for shift-reduce and start-join; three
is best for the connection path method. The shift-
reduce method...
Từ khóa: