Results 21 to 30 of about 141,588 (171)
LR Parsing of Permutation Phrases
CoRRThis paper presents an efficient method for LR parsing of permutation phrases. In practical cases, the proposed algorithm constructs an LR(0) automaton that requires significantly fewer states to process a permutation phrase compared to the standard construction. For most real-world grammars, the number of states is typically reduced from $Ω(n!)$ to $O(
Kostičová, Jana
openaire +5 more sources
Deductive parsing with interaction grammars [PDF]
, 2009 We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving ...
Joseph Le Roux, Le Roux, Joseph
core +4 more sources
Parsing of partially bracketed structures for parse selection [PDF]
, 2012 We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars.
S´anchez-S´aez, Ricardo +1 more
core +2 more sources
Digitization and mapping of national legacy soil data of Montenegro
Soil and Water Research, 2018 This paper describes the process of digitizing Montenegro's legacy soil data, and an initial attempt to use it for digital soil mapping (DSM) purposes. The handwritten legacy numerical records of physical and chemical properties for more than 10 000 soil
Edin SALKOVIĆ +4 more
doaj +1 more source
On LR Parsing with Selective Delays [PDF]
, 2013 The paper investigates an extension of LR parsing that allows the delay of parsing decisions until a sufficient amount of context has been processed. We provide two characterizations for the resulting class of grammars, one based on grammar transformations, the other on the direct construction of a parser.
Eberhard Bertsch +2 more
openaire +2 more sources
Faster Generalized LR Parsing [PDF]
, 1999 Tomita devised a method of generalized LR (GLR) parsing to parse ambiguous grammars efficiently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back on more expensive general techniques when necessary.
John Aycock, R. Nigel Horspool
openaire +2 more sources
Unifying LL and LR parsing [PDF]
, 1993 In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper the relation between these methods is clarified.As shown in literature on parsing theory, for every context-free grammar, a so-called non-deterministic LR(
Pijls, W.H.L.M. (Wim)
core +1 more source
Transformations of grammars and translation directed by $LR$ parsing [PDF]
, 1968 summary:The class of $LR$ translation grammars is introduced. This class is characterized by a possibility to implement a formal translation as an algorithm directed by $LR$ parsing. To perform a translation, the conventional $LR$ parser is extended by a
Bac, Nguyen van +3 more
core +1 more source
A Comparison of Parsing Technologies for the Biomedical Domain [PDF]
, 2005 This paper reports on a number of experiments which are designed to investigate the extent to which current nlp resources are able to syntactically and semantically analyse biomedical text.
Claire Grover +5 more
core +1 more source
DyProL: Dynamic Ensemble Representation Learning for Protein–Nucleic Acid Binding Site Prediction
Advanced Science, EarlyView.Protein function is represented as a dynamic conformational ensemble rather than a single static structure. A multi‐conformation geometric attention framework aligns, clusters, and learns representative states to capture residue‐ and ensemble‐level signals. Integrating structural dynamics improves interpretable protein‐NA binding prediction and reveals
Pengpai Li +3 more
wiley +1 more source