earley an efficient context free parsing algorithm
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
... that CCGbank contains no non -context-
free structure and that the Clark and Curran parser
is actually a context- free parser. Based on these
results, we trained the Petrov parser on CCGbank
and achieved ... important in terms of the lan-
guage classes of each CCG. We prove
that a wide range of CCGs are strongly
context- free, including the CCG of CCG-
bank and of the parser of Clark and Cur-
ran (2007). ... formalism. Unlike
the context- free grammars extracted from the Penn
treebank, these allow for the categorial semantics
that accompanies any categorial parse and for a
more elegant analysis of linguistic...
- 10
- 433
- 0
Báo cáo khoa học: "FOR A N EFFICIENT CONTEXT-FREE PARSER AUGMENTED PHRASE-STRUCTURE GRAMMARS" potx
Ngày tải lên :
09/03/2014, 01:20
... consumed and no more rule
can be applied.
3.3. Lexical ambiguity
The algorithm can efficiently handle lexical
ambiguity.
For those forms which have more than one
interpretation, a special annotation ... we present an efficient
context- free (CF) bottom-up, non deterministic
parser. It is an extension of the ICA (Immediate
Constituent Analysis) parser proposed by
Grishman (1976), and its major ...
<EXPRESSION>::= a semantic interpretation in
any chosen formalism
As we have already stated, the
<PRODUCTION>'s can be instantiated both with
syntactic and with semantic grammars. The...
- 7
- 303
- 0
Báo cáo khoa học: "Unary Constraints for Efficient Context-Free Parsing" docx
Ngày tải lên :
17/03/2014, 00:20
... Computational
Linguistics.
Dan Klein and Christopher D. Manning. 2001. Parsing
with treebank grammars: Empirical bounds, theoret-
ical models, and the structure of the Penn treebank.
In Proceedings of 39th Annual ... Linguistics.
Brian Roark and Kristy Hollingshead. 2009. Linear
complexity context- free parsing pipelines via chart
constraints. In Proceedings of Human Language Tech-
nologies: The 2009 Annual Conference ... treebank are rare and used primarily to mark
quantifier phrases as noun phrases. But due to the
removal of empty nodes, the transformed treebank
contains many more unary productions that span
multiple...
- 6
- 293
- 0
Tài liệu Báo cáo khoa học: "Efficient Parsing for Bilexical Context-Free Grammar sand Head Automaton Grammars*" pptx
Ngày tải lên :
20/02/2014, 19:20
... reversed, Is is exchanged with Fa, and any transi-
tion probabilities are replaced by those of the reversed
Markov chain.
461
Efficient Parsing for Bilexical Context- Free Grammars
and Head Automaton ... expressiveness is a very large
grammar. Standard context- free parsing algo-
rithms are inefficient in such a case. The CKY
algorithm (Younger, 1967; Aho and Ullman,
1972) is time O(n 3. IPI), where ... mapping (Hopcroft and Ull-
man, 1979). This property also holds for our
class of bilexical CFGs.
References
A. V. Aho and J. D. Ullman. 1972. The Theory
of Parsing, Translation and Compiling,...
- 8
- 409
- 0
Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx
Ngày tải lên :
08/03/2014, 01:20
... Parmentier, and Johannes Dellert. 2008. De-
veloping an MCTAG for German with an RCG-
based parser. In Proceedings of LREC-2008, Mar-
rakech, Morocco.
Wolfgang Maier and Anders Søgaard. 2008. Tree-
banks ... Trento.
H
˚
akan Burden and Peter Ljungl
ă
of. 2005. Parsing lin-
ear context- free rewriting systems. In Proceedings
of IWPT 2005, pages 11–17, Vancouver.
Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yan-
nick ... Clergerie. 2001. Guided
parsing of Range Concatenation Languages. In Pro-
ceedings of ACL, pages 42–49.
Tilman Becker, Aravind K. Joshi, and Owen Rambow.
1991. Long-distance scrambling and tree adjoining
grammars....
- 4
- 354
- 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
Ngày tải lên :
20/02/2014, 22:20
... Johnson, Andrew
Kay and Antonio Sanfilippo at SLE, and our anonymous
reviewers for useful feedback and discussions on the re-
search reported here and on earlier drafts of this paper.
of instantiated ...
as translation coverage is extended and new lan-
guage pairs are added.
5 Conclusion
We have presented a polynomial complexity gener-
ation algorithm which can form part of any Shake-
and-Bake ... great man
translated
as un homme grand).
The problem is justifying
the main/subordinate distinction in every language
that we might wish to translate into German. This
distinction can be...
- 7
- 410
- 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
... Aho and Ullman (1987)
and Aho and Johnson (1974), and more
formal definitions and notations of a feature-
based grammar formalism from Pollard and
Sag (1987) and Shieber (1986).
2 The LR Parsing ... not require any
preliminary instantiation of categories or a
search for them, and a reduce action which
pe,forms instanliation tit)ring parsing.
Some details of the LR parsing algorithm
are ... AN EXTENDED LR PARSING ALGORITHM
FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES
Tsuneko Nakazawa
Beckman Institute for Advanced Science and Technology
and
Linguistics...
- 6
- 334
- 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
... linear context- free rewriting systems. In
Proc. of ACL.
Amit Dubey and Frank Keller. 2003. Parsing ger-
man with sister-head dependencies. In Proc. of
ACL, pages 96–103.
Kilian Evang and Laura ... two German treebanks (Maier and
Søgaard, 2008; Maier and Lichte, 2009). Re-
cent work on treebank parsing with discontinuous
constituents (Kallmeyer and Maier, 2010; Maier,
2010; Evang and Kallmeyer, ... (2010) and Evang and Kallmeyer (2011) the
limit was 25 words. Maier (2010) and van Cranen-
burgh et al. (2011) manage to parse up to 30 words
with heuristics and optimizations, but no further.
Algorithms...
- 11
- 437
- 0
Báo cáo khoa học: "A Comparison of Rule-Invocation Strategies in Context-Free Chart Parsing" pot
Ngày tải lên :
09/03/2014, 01:20
... very efficient,
extended LR -parsing algorithm that can deal with
full context- free languages. Based on empirical com-
parisons, Tomita shows his algorithm to be superior
to Earley& apos;s algorithm ...
Earley, Jay (1970). An Efficient Context- Free
Parsing Algorithm. Communications of the ACM
13(2):94 102.
Griffiths, T. V. and Stanley R. Petrick (1965).
On the Relative Efficiences of Context- Free ... (1985). An Efficient Context- free
Parsing Algorithm For Natural Languages. Proc.
9th IJCAI, Los Angeles, California: 756=764.
Tomita, Masaru (1986). E~cient Parsing for Nat-
ural Language....
- 8
- 355
- 0
Báo cáo khoa học: "Parsing Non-Recursive Context-Free Grammars" doc
Ngày tải lên :
17/03/2014, 08:20
... of a general context- free language and a
regular language is still context- free.
In the present paper we leave the theoretical
framework of Bar-Hillel et al. (1964), and consider
parsing grammars ... or
more push transitions, followed by a single scan
transition and by zero or more pop transitions. In
what follows, we will formalize this basic idea and
exploit it within our parsing algorithm.
We ... more push
transitions, followed by one scan transition
reading and by zero or more pop transitions;
(iii) if then the top-most symbol of must
be in the right-hand side of a pop or scan tran-
sition...
- 8
- 190
- 0
Báo cáo khoa học: "AN OPTIMAL TABULAR PARSING ALGORITHM" pdf
Ngày tải lên :
17/03/2014, 09:20
... recursion and is generally less
efficient.
Nondeterministic LC parsing is the foundation of a
very efficient parsing algorithm [7], related to Tomita's
algorithm and Earley& apos;s algorithm. ... common-prefix (CP) parsing, which are al-
gorithms capable of simultaneous processing of all com-
mon prefixes. ELR and CP parsing are the foundation
of tabular parsing algorithms and a parallel parsing ... 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 can
never compute...
- 8
- 246
- 0
Báo cáo khoa học: "A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing" pdf
Ngày tải lên :
18/03/2014, 02:20
... the morphemes be- (en-)
and nevel (mist) can belong to more than one lex-
ical category and as a consequence can be reduced
in more than one way. The ambiguity in (5a) and
(5b), is spurious ... rules are not always context- free [Magerman and
a2For reasons I will not go into here, the newspaper
and dictionary words did not comprise highly frequent
words [Nunn and van Heuven, 1993].
13See ...
[van Beurden, 1987] L. van Beurden. Playing level
with Dutch morphology. In F. Beukema and
P. Coopmans, editors,
Linguistics is the Nether-
lands 1987,
pages 21-30, 1987.
[van den Bosch and...
- 10
- 435
- 0
