Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ENTCS
2010
122views more  ENTCS 2010»
10 years 1 months ago
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
Trevor Jim, Yitzhak Mandelbaum
ENTCS
2010
84views more  ENTCS 2010»
10 years 1 months ago
Syntactic Language Extension via an Algebra of Languages and Transformations
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...
Jacob Andersen, Claus Brabrand
FSMNLP
2009
Springer
10 years 2 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
ACL
2009
10 years 2 months ago
Bayesian Learning of a Tree Substitution Grammar
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
Matt Post, Daniel Gildea
CORR
2010
Springer
107views Education» more  CORR 2010»
10 years 2 months ago
Yacc is dead
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
Matthew Might, David Darais
ANSOFT
2002
162views more  ANSOFT 2002»
10 years 4 months ago
Foundations of Fast Communication via XML
Communication with XML often involves pre-agreed document types. In this paper, we propose an offline parser generation approach to enhance online processing performance for docum...
Welf Löwe, Markus L. Noga, Thilo S. Gaul
JALC
2007
84views more  JALC 2007»
10 years 4 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
JCB
2008
108views more  JCB 2008»
10 years 4 months ago
Asymptotics of RNA Shapes
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...
W. A. Lorenz, Yann Ponty, Peter Clote
IJFCS
2006
132views more  IJFCS 2006»
10 years 4 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin
ENTCS
2006
184views more  ENTCS 2006»
10 years 4 months ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
books