Báo cáo khoa học: "AN OPTIMAL TABULAR PARSING ALGORITHM" pdf
Báo cáo khoa học: "AN OPTIMAL TABULAR PARSING ALGORITHM" pdf
... [1, 4], which deal with tabular LR parsing.
As we will explain, CP and ELR parsing are more
deterministic than most other parsing algorithms for
many grammars, but their tabular realizations ... first discuss a tabular form of CP parsing,
since this is the most simple parsing technique discussed
above. We will then move on to the more difficult ELR
technique. Tabular PLR...
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot
... eliminates the necessity of search
for GOTO table entries during parsing.
1 Introduction
The LR method is known to be a very
efficient parsing algorithm that involves no
searching or backtracking. ... a
search for them, and a reduce action which
pe,forms instanliation tit)ring parsing.
Some details of the LR parsing algorithm
are assumed from Aho and Ullman (1987)
and Aho and...
Báo cáo khoa học: "An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two" ppt
... achieved an
optimal reduction in the rank, but we can still ob-
tain an asymptotic improvement in parsing time if
we use the new productions obtained in the trans-
formation.
Our algorithm has optimal ... example, in
the case where f = 2, binarization of a LCFRS
would result in parsing time of O(|G| · |w|
6
).
With the motivation of parsing efficiency, much
research has been recently...
Báo cáo khoa học: "Attention Shifting for Parsing Speech ∗" pdf
... 2003).
2.2 Multi-stage parsing
Π
PCFG Parser
π
⊂ Π
Lexicalized
Parser
Figure 4: Coarse-to-fine lattice parsing.
In Figure 4 we present the general overview of
a multi-stage parsing technique (Goodman, ... and each parsing iteration runs until it has found
a complete parse using at least one of the unused
words.
As with multi-stage parsing, an adjustable param-
eter determines how m...
Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot
... tuples from the grammar. This re-
sults in a combinatorial explosion of parsing anal-
yses. In order to obtain a polynomial parsing al-
gorithm, we need to avoid this effect.
On this line, we propose ... conditions on these counts. This allows
for parsing in polynomial deterministic time.
TT-MCTAG uses so-called ‘parallel unordered’
rewriting. The first polynomial time parsing
results...
Báo cáo khoa học: "An Automatic Treebank Conversion Algorithm for Corpus Sharing" potx
... above
model, it is, of course, possible to incorporate any
kind of preference mechanism in the parsing mech-
anism of Parser II to prevent the converter from
enumerating all possible syntactic
Báo cáo khoa học: "AN ATN TREATMENT WH-MOVEMENT" pdf
... agenda, which contains an
explicit representation of all further tasks to be
processed, the chart parsing framework is especially
suited for mul-ti-way analyses on syntacticly and
lexically highly ...
arcs to the grammar, which can accept empty
constituents. This means that you have JUMP-
arcs parsing traces of type XP, which in the
gr~mm~r are alternative arcs to the
correspondi...
Từ khóa: