Results 71 to 80 of about 163,441 (217)
A technique for speeding up LR(k) parsers [PDF]
, 1972 Alfred V. Aho, Jeffrey D. Ullman
openalex +1 more source
An empirical evaluation of Lex/Yacc and ANTLR parser generation tools. [PDF]
PLoS One, 2022 Ortin F +3 more
europepmc +1 more source
CHR as grammar formalism. A first report
, 2001 Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity.
Christiansen, Henning
core
Parallel decomposition of LR(k) parsers [PDF]
, 1977 David Benson, Ralph D. Jeffords
openalex +1 more source
Optimizing directly executable LR parsers [PDF]
, 1991 Traditionally, LR parsers are implemented as table interpreters. A parser generator creates tables whose entries are interpreted by the parser driver. Recent research shows that much faster LR parsers can be obtained by converting the table entries into directly executed code.
openaire +2 more sources
Fast LR parsing using rich (Tree Adjoining) Grammars [PDF]
, 2002 Carlos A. Prolo
openalex +1 more source
Chart-driven Connectionist Categorial Parsing of Spoken Korean
, 1995 While most of the speech and natural language systems which were developed for English and other Indo-European languages neglect the morphological processing and integrate speech and natural language at the word level, for the agglutinative languages ...
Lee, Geunbae +2 more
core
Integrated Molecular and Bioinformatics Approaches for Disease-Related Genes in Plants. [PDF]
Plants (Basel), 2023 Joshi A, Song HG, Yang SY, Lee JH.
europepmc +1 more source
Do syntactic trees enhance Bidirectional Encoder Representations from Transformers (BERT) models for chemical-drug relation extraction? [PDF]
Database (Oxford), 2022 Tang A +4 more
europepmc +1 more source