Filters








415 Hits in 1.5 sec

Directly-Executable Earley Parsing [chapter]

John Aycock, Nigel Horspool
2001 Lecture Notes in Computer Science  
Deterministic parsing techniques are typically used in favor of general parsing algorithms for efficiency reasons.  ...  We describe how to narrow the performance gap between general and deterministic parsers, constructing a directlyexecutable Earley parser that can reach speeds comparable to deterministic methods even on  ...  Conclusion We have shown that directly-executable LR parsing techniques can be extended for use in general parsing algorithms such as Earley's algorithm.  ... 
doi:10.1007/3-540-45306-7_16 fatcat:je7tedp6qrh7ffhtfxm3cvem6y

Efficient Earley Parsing with Regular Right-hand Sides

Trevor Jim, Yitzhak Mandelbaum
2010 Electronical Notes in Theoretical Computer Science  
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides.  ...  They directly handle regular right sides, and have been used in Earley parsing [2] . Woods also considered ATNs based on transducers [14] , though not in the context of Earley parsing.  ...  Earley parsing [2] .  ... 
doi:10.1016/j.entcs.2010.08.037 fatcat:ciwrx27ribg6xaishvrfnakznm

LATE Ain'T Earley: A Faster Parallel Earley Parser [article]

Peter Ahrens, John Feser, Robin Hui
2018 arXiv   pre-print
We present the LATE algorithm, an asynchronous variant of the Earley algorithm for parsing context-free grammars.  ...  We show that the LATE algorithm can achieve a 120x speedup over the Earley algorithm on a natural language task.  ...  We then present LATE, a novel parsing algorithm created by augmenting the Earley algorithm with additional data structures to allow for asynchronous execution of Earley tasks.  ... 
arXiv:1807.05642v1 fatcat:g7fw7e3aifgfnfgo54dc2cxjou

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle [chapter]

Tom Ridge
2014 Lecture Notes in Computer Science  
Unfortunately the performance was not as good as other parsing methods such as Earley parsing.  ...  In this paper, we build on this previous work, and combine it in novel ways with existing parsing techniques such as Earley parsing.  ...  For example, the author of SPARK confirmed that SPARK cannot directly handle grammars such as E -> E E E | "1" | ǫ.  ... 
doi:10.1007/978-3-319-11245-9_15 fatcat:m7phkbdbljfpxnaxsomf7p4be4

Parsing with Scannerless Earley Virtual Machines

Audrius Šaikūnas
2019 Baltic Journal of Modern Computing  
Earley parser is a well-known parsing method used to analyse context-free grammars.  ...  As such it can be used as a foundation to build more complex parsing algorithms. We present a new, virtual machine based approach to parsing, heavily based on the original Earley parser.  ...  Even in applications, not directly related to computer science or software development, parsers are a common occurrence.  ... 
doi:10.22364/bjmc.2019.7.2.01 fatcat:hseadx7syvfnlke456klbelwqu

Critical Analysis of Extensible Parsing Tools and Techniques

Audrius Šaikūnas
2017 Baltic Journal of Modern Computing  
parsing and semantic analysis methods with specific qualities is required to facilitate such implementations.  ...  To facilitate the creation of such compilers and languages, new parsing and semantic analysis algorithms are required.  ...  The semantic definition has direct access to the parse tree and is directly executed when a code fragment that matches the grammar rule definition is found in the source code.  ... 
doi:10.22364/bjmc.2017.5.1.09 fatcat:vgbqdannr5dnbiaffox66i75ve

Generalized Earley Parser: Bridging Symbolic Grammars and Sequence Data for Future Prediction [article]

Siyuan Qi, Baoxiong Jia, Song-Chun Zhu
2018 arXiv   pre-print
., Earley parser) only take symbolic sentences as inputs. In this paper, we generalize the Earley parser to parse sequence data which is neither segmented nor labeled.  ...  This generalized Earley parser integrates a grammar parser with a classifier to find the optimal segmentation and labels, and makes top-down future predictions.  ...  Therefore we can directly apply generalized Earley parser to outputs of general detectors/classifiers for parsing and prediction.  ... 
arXiv:1806.03497v1 fatcat:el32bbjpmzatvhc5ljn7yql4wu

Semantics and algorithms for data-dependent grammars

Trevor Jim, Yitzhak Mandelbaum, David Walker
2010 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10  
Finally, (6) legacy parsing libraries, such as sophisticated libraries for dates and times, may be directly incorporated into parser specifications.  ...  YAKKER also includes (3) facilities for binding variables to intermediate parse results and (4) using such bindings within arbitrary constraints to control parsing.  ...  Corollary 27 (Earley Parsing Simulates Transducer Execution) T ∈ Earley(w) iff (q0, [y0:=()], , q0) ⇒ * (q0, E, T, r) and r → A0.  ... 
doi:10.1145/1706299.1706347 dblp:conf/popl/JimMW10 fatcat:kkgvu76mh5cjjpv5lzvivgc5si

Semantics and algorithms for data-dependent grammars

Trevor Jim, Yitzhak Mandelbaum, David Walker
2010 SIGPLAN notices  
Finally, (6) legacy parsing libraries, such as sophisticated libraries for dates and times, may be directly incorporated into parser specifications.  ...  YAKKER also includes (3) facilities for binding variables to intermediate parse results and (4) using such bindings within arbitrary constraints to control parsing.  ...  Corollary 27 (Earley Parsing Simulates Transducer Execution) T ∈ Earley(w) iff (q0, [y0:=()], , q0) ⇒ * (q0, E, T, r) and r → A0.  ... 
doi:10.1145/1707801.1706347 fatcat:m6i5ex3hwnbztjchbizg7wtwkm

A variant of Earley parsing [chapter]

Mark-Jan Nederhof, Giorgio Satta
1997 Lecture Notes in Computer Science  
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a "delayed" recognition of constituents.  ...  Earley parsing was first defined in [6] , in the context of formal language parsing.  ...  More precisely, the same computation performed by the d(r − 2) executions of Step 3 in Algorithm 1 will be performed by r − 2 executions of the forward substep, and 0 executions of the backward substep  ... 
doi:10.1007/3-540-63576-9_98 fatcat:wnsarqg7bba7tmyn6wucfahbrq

Stochastic Parse-Tree Recognition by a Pushdown Automaton

Frédéric Tendeau
1995 International Workshop/Conference on Parsing Technologies  
This approach is applied in particular to Earley and Left-Comer parsing algorithms.  ...  The main idea of the paper is to precisely relate the parsing strategy with a parse-tree exploration strategy : a computational path of a parsing. algorithm simply performs an exploration of a parse-tree  ...  The execution starts with the top element of 1r i in £, it loops until no more I-item can be added to £ or no more token is to be read. The execution output is the shared-parse-forest of the input.  ... 
dblp:conf/iwpt/Tendeau95 fatcat:nftaswvyyngudeoh5kq677lore

Recursive ascent parsing: from Earley to Marcus

René Leermakers
1992 Theoretical Computer Science  
., Recursive ascent parsing: from Earley to Marcus, Theoretical Computer Science 104 (1992) 299-3 12.  ...  The theory behind it unifies the treatment of hitherto virtually unrelated parsing methods, such as the Earley algorithm and LR parsing.  ...  Frans Kruseman Aretz invented recursive ascent parsing and took the time to comment on my ideas when they were still very immature.  ... 
doi:10.1016/0304-3975(92)90127-2 fatcat:7rtj52bxdrd6zlra7zhfhsxzmu

An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities [article]

Andreas Stolcke
1994 arXiv   pre-print
Finally, the algorithm has simple extensions for processing partially bracketed inputs, and for finding partial parses and their likelihoods on ungrammatical inputs.  ...  Our algorithm compares favorably to standard bottom-up parsing methods for SCFGs in that it works efficiently on sparse grammars by making use of Earley's top-down control structure.  ...  Summary To summarize, the modi ed, probabilistic Earley algorithm works by executing the following steps for each input position.  ... 
arXiv:cmp-lg/9411029v1 fatcat:ri7lozrl5bht5fbnxa2xjercey

Well-Typed Islands Parse Faster [chapter]

Erik Silkensen, Jeremy Siek
2013 Lecture Notes in Computer Science  
In this paper, we present the design of a system that uses a type-oriented variant of island parsing to efficiently parse the syntax of composable DSLs.  ...  In particular, we show how type-oriented island parsing is constant time with respect to the number of DSLs imported.  ...  For the untyped and semi-typed scenarios, the result is too ambiguous and we terminated their execution after waiting for several minutes.  ... 
doi:10.1007/978-3-642-40447-4_5 fatcat:hdlxp4nqx5emtnwdgueqg77zie

Well-typed Islands Parse Faster [article]

Erik Silkensen, Jeremy G. Siek
2011 arXiv   pre-print
In this paper, we present the design of a system that uses a type-oriented variant of island parsing to efficiently parse the syntax of composable DSLs.  ...  In particular, we show how type-oriented island parsing is constant time with respect to the number of DSLs imported.  ...  For the untyped and semi-typed scenarios, the result is too ambiguous and we terminated their execution after waiting for several minutes.  ... 
arXiv:1201.0024v1 fatcat:a6phhvtbb5b2rdsugmjex4ynfq
« Previous Showing results 1 — 15 out of 415 results