Results 11 to 20 of about 123,382 (182)
Journal of Computer and System Sciences, 1972 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]
Proceedings of the 22nd annual meeting on Association for Computational Linguistics -, 1984 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
LR(1) parser generation system
, 2011 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
Feaspar: a feature structure parser learning to parse spoken language [PDF]
, 1996 We describe and experimentally evaluate a system, FeasPar, that learns parsing spontaneous speech. To train and run FeasPar (Feature Structure Parser), only limited handmodeled knowledge is required.
Buoe, Finn Dag, Waibel, Alex
core +1 more source
Towards Efficient, Typed LR Parsers
Electronic Notes in Theoretical Computer Science, 2006 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
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
From Swarm to Individual: Emergent Individuality in Light‐Mediated Robot Collectives
Advanced Intelligent Systems, EarlyView.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
Advanced Intelligent Systems, EarlyView.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
The Preprint Evolution: The Rise of Unreviewed Drafts on arXiv and Its Implications for Astronomy
Astronomische Nachrichten, EarlyView.ABSTRACT The arXiv preprint server originally democratized astronomical research by removing the financial barriers of journal subscriptions. However, a system designed for the lower publication volumes of the 1990s has fractured under modern research output. Today, the sheer volume of unreviewed manuscripts—often tagged as “submitted,” “under review,”
Luigi Rolly Bedin
wiley +1 more source
An alternative method of training probabilistic LR parsers [PDF]
Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04, 2004 We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in ...
M. J. NEDERHOF, SATTA, GIORGIO
openaire +3 more sources