Results 11 to 20 of about 116,721 (179)
Adapting a WSJ-trained parser to grammatically noisy text [PDF]
We present a robust parser which is trained on a treebank of ungrammatical sentences. The treebank is created automatically by modifying Penn treebank sentences so that they contain one or more syntactic errors.
Jennifer Foster +5 more
core +3 more sources
Certain techniques for modifying LR(k) parsing tables to decrease their size have been developed by Korenjak [2] and DeRemer [3, 4]. We show that the techniques of the latter can be characterized by two transformations on sets of tables. We then show that the “simple” LR(1) method of DeRemer [4] can be considered a special case of Korenjak's method [2].
Alfred V. Aho, Jeffrey D. Ullman
openaire +1 more source
LR parsers for natural languages [PDF]
MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a shift-reduce parser which is deterministically guided by a parsing table. A parsing table can be obtained automatically from a context-free phrase structure grammar.
openaire +1 more source
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution [PDF]
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a deficiency in the state of the art of practical LR parser table generation ...
Malloy, Brian A., Denny, Joel E.
core +1 more source
Towards Efficient, Typed LR Parsers
AbstractThe LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient ...
Pottier, François, Régis-Gianas, Yann
openaire +2 more sources
LR(1) parser generation system
The LR(1) Parser Generation System generates full LR(1) parsers that are comparable in speed and size to those generated by LALR(1) parser generators, such as yacc [5]. In addition to the inherent advantages of full LR(1) parsing, it contains a number of
Peter Donovan, Arthur Sorkin
core +1 more source
DyProL: Dynamic Ensemble Representation Learning for Protein–Nucleic Acid Binding Site Prediction
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
scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see ...
STEEN, Alexander
core +1 more source
From Swarm to Individual: Emergent Individuality in Light‐Mediated Robot Collectives
Can individuality emerge from a swarm? Using nominally homogeneous phototactic robots, we show that collective light conditions reorganize robot‐level behavioral profiles. Global illumination amplifies persistent differences in state occupancy, while robot‐mounted local light cues reduce fixed differentiation and favor transient high‐switching profiles.
John Smith +4 more
wiley +1 more source
Secure Fusion‐X harmonizes unstructured NVD descriptions with structured CVSS/CWE/CPE metadata via decision‐level fusion, overcoming the fragility of traditional unimodal models. Automated assessment of software vulnerability exploitability is essential for intelligent cyber defense, yet its effectiveness is often hindered by unstable, delayed, or ...
Mona Dolati +3 more
wiley +1 more source

