parsing with treebank grammars
Tài liệu Báo cáo khoa học: "RELATING COMPLEXITY TO PRACTICAL PERFORMANCE IN PARSING WITH WIDE-COVERAGE UNIFICATION GRAMMARS" pptx
Ngày tải lên :
20/02/2014, 21:20
... gram-
mars: in particular, with grammars admitting less
ambiguity parse time will tend to increase more
slowly with increasing input length, and also with
smaller grammars rule application ... Intelligence.
703-708.
293
RELATING COMPLEXITY TO PRACTICAL
PERFORMANCE IN PARSING WITH WIDE-COVERAGE
UNIFICATION GRAMMARS
John Carroll
University of Cambridge, Computer Laboratory
Pembroke ... performance of different parsing
algorithms using wide-coverage unification-based
grammars. Previous comparisons have either fo-
cussed on context-free (CF) or augmented CF
parsing (Tomita, 1987;...
- 8
- 348
- 0
Báo cáo khoa học: "Exploiting Multiple Treebanks for Parsing with Quasi-synchronous Grammars" doc
Ngày tải lên :
16/03/2014, 19:20
... multiple treebank exploita-
tion is treebank conversion. First, the annotations
in the source treebank are converted into the style
of the target treebank. Then, both the converted
treebank and ... Parser
Parser
T
Train
Train
Parse
Target
Treebank
T={(x
j
, d
j
)}
j
Source Treebank
S={(x
i
, d
i
)}
i
Parsed
Treebank
T
S
={(x
j
, d
j
S
)}
j
Target Treebank with
Source Annotations
T
+S
={(x
j
, ... features for parsing.
Previous work on treebank conversion primar-
ily focuses on converting one grammar formalism
of a treebank into another and then conducting a
study on the converted treebank...
- 10
- 245
- 0
Tài liệu Báo cáo khoa học: "Semantic Parsing with Bayesian Tree Transducers" doc
Ngày tải lên :
19/02/2014, 19:20
... as just one
benefit of working within a general theory: contri-
butions are more broadly applicable.
2 Meaning representations and regular
tree grammars
In semantic parsing, an MR is typically an ... a pattern with which to expand
it and then filling out that pattern with words drawn
from a unigram distribution.
This kind of coupled generative process can
be naturally formalized with tree ... facilitates a greater flow of ideas in the
research community, allowing semantic parsing to
leverage ideas from other work with tree automata,
while making clearer how seemingly isolated ef-
forts might...
- 9
- 475
- 0
Tài liệu Báo cáo khoa học: "Accurate Context-Free Parsing with Combinatory Categorial Grammar" pptx
Ngày tải lên :
20/02/2014, 04:20
... required to both train and parse with the
Petrov parser on the Penn Treebank, the Petrov
parser on the original version of CCGbank, the
Petrov parser on CCGbank without features and
the Clark and ... statistical parsing with CCG and Log-Linear
models. Computational Linguistics, 33(4):493–552.
S. Clark, J. Hockenmaier, and M. Steedman. 2002.
Building deep dependency structures with a wide-
coverage ... features and
the Clark and Curran parser using the two mod-
els. All training and parsing was done on a 64-bit
machine with 8 dual core 2.8 Ghz Opteron 8220
CPUs and 64GB of RAM. Our training times...
- 10
- 433
- 0
Tài liệu Báo cáo khoa học: "Transition-based parsing with Confidence-Weighted Classification" pdf
Ngày tải lên :
20/02/2014, 04:20
... confidence-weighted
classifiers with transition-based dependency pars-
ing yields results comparable with the state-of-the-
art results achieved with Support Vector Machines
- with faster training and parsing times. ... ex-
periments with using CW-classifiers in transition-
based parsing.
5.1 Online classifiers
We compare CW-classifiers with other online al-
gorithms for linear classification. We compare
with perceptron ... feature selection has been used for languages
marked with an *.
curacy a lot. In this section we will compare re-
sults obtained with CW-classifiers with the results
for the MaltParser from CoNNL-X....
- 6
- 493
- 0
Tài liệu Báo cáo khoa học: "Parsing with generative models of predicate-argument structure" pptx
Ngày tải lên :
20/02/2014, 16:20
... for Statistical Parsing with Combinatory Categorial
Grammar. In Proceedings of the 40th Annual Meeting of the
ACL.
Julia Hockenmaier. 2003. Data and Models for Statistical
Parsing with CCG. Ph.D. ... for
Natural Language Parsing. Ph.D. thesis, University of
Pennsylvania.
Julia Hockenmaier and Mark Steedman. 2002a. Acquiring
Compact Lexicalized Grammars from a Cleaner Treebank.
In Proceedings ... derivation tree itself. It as-
sumes that binary trees (with parent category
)
have one head child (with category
) and one non-
head child (with category
), and that each node
has one lexical head
....
- 8
- 458
- 0
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot
Ngày tải lên :
22/02/2014, 10:20
...
preprocessing.
5: Further Comparisons and
Conclusion
The LR parsing algorithm for grammars
with atomic categories involves no category
matching during parsing. In Fig.l,
catego~;ies are pushed onto the ...
categories to grammars poses a new problem
unique to the LR parser. After the parser
assigns a constituent structure in Fig.4 during
parsing, it would consult the GOTO table for
the next state with ... 61801, USA
tsuneko@grice.cogsci.uiuc.edu
ABSTRACT
This paper proposes an LR parsing
algorithm modified for grammars with
feature-based categories. The proposed
algorithm does not instantiate...
- 6
- 334
- 0
Báo cáo khoa học: "Text-level Discourse Parsing with Rich Linguistic Features" pdf
Ngày tải lên :
07/03/2014, 18:20
... text-level
discourse parsing is crucial.
Unlike syntactic parsing, where we are almost
never interested in parsing above sentence level,
sentence-level parsing is not sufficient for discourse
parsing. While ... discourse parsing is consistently infe-
rior to that within individual sentences, and we will
briefly discuss what the key difficulties with extend-
ing sentence-level to text-level discourse parsing ... text.
Text-level discourse parsing imposes more con-
straints on the global coherence than sentence-level
discourse parsing. However, if, technically speak-
ing, text-level discourse parsing were no more...
- 9
- 340
- 0
Báo cáo khoa học: "Efficient Parsing with Linear Context-Free Rewriting Systems" pdf
Ngày tải lên :
08/03/2014, 21:20
... a treebank
PLCFRS versus a PCFG using our transformations.
Figure 8 compares the parsing times of LCFRS
with and without the new CFG-CTF method. The
graph shows a steep incline for parsing with ... coarse-to-fine parsing
Coarse-to-fine parsing (Charniak et al., 2006) is
a technique to speed up parsing by exploiting the
information that can be gained from parsing with
simpler, coarser grammars e.g., ... assumptions of treebank
grammars. Table 2 gives statistics on the gram-
mars, including the parsing complexities. The fine
grammar has a parsing complexity of 9, which
means that parsing with this...
- 11
- 437
- 0
Báo cáo khoa học: "Parsing with an Extended Domain of Locality" pot
Ngày tải lên :
08/03/2014, 21:20
...
two grammars make use of the EDOL hypothesis
with respect to those dependencies that are being
checked by the parser.
2 Parsing Unification-Based
Grammars
In phrase-structure rule-based parsing, ... the XTAG and LEXSYS grammars exploit
the EDOL, we hope to have shed some light on
the role that the EDOL can play with respect to
parsing efficiency.
6These are both grammars for English. ... since the same rule may be used several
times within a single derivation, and also the
same constituent may be used within different
partial analyses with features instantiated in dif-
ferent...
- 8
- 274
- 0
Báo cáo khoa học: "Head-driven Parsing for Lexicalist Grammars: Experimental Results" ppt
Ngày tải lên :
09/03/2014, 01:20
... head-corner parsing is
especially useful for parsing with non-concatenative
grammar formalisms. In [Lavelli and Satta, 1991]
a head-driven parsing strategy for Lexicalized Tree
Adjoining Grammars ... standard parsers to parse
with lexicalist grammars for English and
for Dutch. The results indicate that for
important classes of lexicalist grammars it
is fruitful to apply parsing strategies which ... standard parsing algorithms to such
grammars is unsatisfactory for a number of rea-
sons. Earley parsing is intractable in general, as the
rule set. is simply too general. For some grammars, ...
- 10
- 188
- 0
Báo cáo khoa học: "Parsing with polymorphism" doc
Ngày tải lên :
09/03/2014, 01:20
...
larity, and with either the same path or with path
p. Also, in leaves of a proof in L (/'\'v), categories
only occur with zero path. Therefore, if we have
124
Parsing with polymorphism ... sequent with a positive occurrence of
ViX.X/X and with non-zero path, then there must
occur higher in the proof, a sequent with V,.X.X/X
occurring again positively and this time with with
zero-path. ...
So parsing with an L(/,\) grammar comes to decid-
ing the derivability of Xl, , xo =:~ s, where xi are
the categories of the lexical items.
This Lambek style of grammar is associated also
with...
- 10
- 232
- 0
Báo cáo khoa học: "Head-driven Transition-based Parsing with Top-down Prediction" pdf
Ngày tải lên :
16/03/2014, 19:20
... lower nodes
from higher nodes with a statistical model.
To improve parsing flexibility in deterministic
parsing, our top-down parser uses beam search al-
gorithm with dynamic programming (Huang ... Experiments on the
English Penn Treebank data and the Chinese
CoNLL-06 data show that the proposed algo-
rithm achieves comparable results with other
data-driven dependency parsing algorithms.
1 Introduction
Transition-based ... 166–170.
M. Collins and B. Roark. 2004. Incremental parsing with
the perceptron algorithm. In Proc. the 42nd ACL.
J. Earley. 1970. An efficient context-free parsing algo-
rithm. Communications of the Association...
- 9
- 312
- 0
Báo cáo khoa học: "Bitext Dependency Parsing with Bilingual Subtree Constraints" docx
Ngày tải lên :
16/03/2014, 23:20
... Linguistics.
29
ate
He
He:1:2-ate:2:0
ate
meat
ate:1:0-meat:2:1
ate
with
ate:1:0 -with: 2:1
meat
the
the:1:2-meat:2:0
with
fork
with: 1:0-fork:2:1
fork
a
a:1:2-fork:2:0
Figure 4: Examples of bigram-subtrees
ate
meat with
ate:1:0-meat:2:1 -with: 3:1
ate
with ...
ate:1:0-NULL:2:1-meat:3:1
the:1:3-NULL:2:3-meat:3:0
a:1:3-NULL:2:3-fork:3:0
with: 1:0-NULL:2:1-fork:3:1
ate:1:0-the:2:3-meat:3:1 ate:1:0 -with: 2:1-fork:3:2
with: 1:0-a:2:3-fork:3:1
NULL:1:2-He:2:3-ate:3:0
He:1:3-NULL:2:1-ate:3:0 ate:1:0-meat:2:1-NULL:3:2
ate:1:0-NULL:2:3 -with: 3:1 with: 1:0-fork:2:1-NULL:3:2
NULL:1:2-a:2:3-fork:3:0
a:1:3-NULL:2:1-fork:3:0
ate:1:0-NULL:2:3 ... projec-
tive parsing algorithm of Eisner (1996). To use
richer second-order information, we also imple-
ment parent-child-grandchild features (Carreras,
2007) in the MST parsing algorithm.
3.1 Parsing with...
- 9
- 236
- 0
