Results 21 to 30 of about 127,422 (77)
Improving Incremental Packrat Parsing
, 2019 Packrat parsing, introduced by Ford in 2002 [12, 13] is a na ̈ıve, backtracking, recursive-descent parsing technique that guarantees linear parse times by using memo- ization. Most of the time, a packrat parser is specified using parsing expression gram-
Guillermo, Jerwin Mark
core +1 more source
Software Language EngineeringMany current language workbenches do not support incremental parsing or left recursion, lack support for resolving references and pretty-printing or make it difficult to implement the Language Server Protocol (LSP) based on the generated parser.
Georg Hinkel +3 more
semanticscholar +1 more source
, 1993 It is shown how parsing can be described as a problem in the class ISBES, Intersections of Sets and Bags of Extended Substructures, defined in /pubs/1991/161/, by viewing parsing as a generalization of pattern matching in several ways.
Broy, M. +4 more
core +1 more source
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
CoRR, 2006 Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing with backtracking and unlimited lookahead, but nevertheless guarantees linear parse time. Any language defined by an LL(k) or LR(k) grammar can be recognized by a packrat parser,
openaire +2 more sources
Scene Parsing through ADE20K Dataset
Computer Vision and Pattern Recognition, 2017 Scene parsing, or recognizing and segmenting objects and stuff in an image, is one of the key problems in computer vision. Despite the communitys efforts in data collection, there are still few image datasets covering a wide range of scenes and object ...
Bolei Zhou +5 more
semanticscholar +1 more source
Statistical parsing of morphologically rich languages (SPMRL): what, how and whither [PDF]
, 2010 The term Morphologically Rich Languages (MRLs) refers to languages in which significant information concerning syntactic units and relations is expressed at word-level. There is ample evidence that the application of readily available statistical parsing
Jennifer Foster +17 more
core +2 more sources
An earley parsing algorithm for range concatenation grammars [PDF]
, 2009 We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to ...
Yannick Parmentier +5 more
core +1 more source
The PaGe 2008 shared task on parsing German [PDF]
, 2008 The ACL 2008 Workshop on Parsing German features a shared task on parsing German. The goal of the shared task was to find reasons for the radically different behavior of parsers on the different treebanks and between constituent and dependency ...
Kübler, Sandra, Sandra Kübler
core +1 more source
Tree parsing with synchronous tree-adjoining grammars [PDF]
, 2012 Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of ...
Vogler, Heiko +2 more
core +2 more sources
Edge-Based Best-First Chart Parsing [PDF]
, 1998 Best-first probabilistic chart parsing attempts to parse efficiently by working on edges that are judged "best" by some probabilistic figure of merit (FOM).
Johnson, Mark +5 more
core