Results 41 to 50 of about 75,315 (101)
On the Relation between Context-Free Grammars and Parsing Expression Grammars [PDF]
, 2014 Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually presented through formalisms that hinder a proper comparison.
Ierusalimschy, Roberto +2 more
core +1 more source
Top-Down Parsing with Parsing Contexts
, 2014 The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge ...
Kurš Jan +2 more
openaire +4 more sources
An Efficient Implementation of the Head-Corner Parser [PDF]
, 1996 This paper describes an efficient and robust implementation of a bi-directional, head-driven parser for constraint-based grammars. This parser is developed for the OVIS system: a Dutch spoken dialogue system in which information about public transport ...
van Noord, Gertjan
core +10 more sources
Frontiers in Psychology, 2016 Speech sound perception is one of the most fascinating tasks performed by the human brain. It involves a mapping from continuous acoustic waveforms onto the discrete phonological units computed to store words in the mental lexicon.
Anna Dora Manca, Mirko Grimaldi
doaj +1 more source
Error Reporting in Parsing Expression Grammars
, 2016 Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow ...
Ierusalimschy, Roberto +3 more
core +1 more source
Better, Faster, Stronger Sequence Tagging Constituent Parsers [PDF]
, 2019 Sequence tagging models for constituent parsing are faster, but less accurate than other types of parsers. In this work, we address the following weaknesses of such constituent parsers: (a) high error rates around closing brackets of long constituents ...
Abdou, Mostafa +2 more
core +3 more sources
Improved ESP-index: a practical self-index for highly repetitive texts
, 2014 While several self-indexes for highly repetitive texts exist, developing a practical self-index applicable to real world repetitive texts remains a challenge.
F. Claude +10 more
core +1 more source
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation [PDF]
, 1997 This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top–down predictions (deriva- tions and adjacencies).
Quesada Moreno, José Francisco
core
Graph Parsing as Graph Transformation [PDF]
, 2020 Hyperedge replacement (HR) allows to define context-free graph languages, but parsing is NP-hard in the general case. Predictive top-down (PTD) is an efficient, backtrack-free parsing algorithm for subclasses of HR and contextual HR grammars, which has been described and implemented in earlier work, based on a representation of graphs and grammar ...
Frank Drewes +2 more
openaire +2 more sources