Results 71 to 80 of about 168,331 (215)
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
A Simple, Possibly Correct LR Parser for C11
ACM Transactions on Programming Languages and Systems, 2017 Jacques-Henri Jourdan, F. Pottier
semanticscholar +1 more source
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
Inessential Error Entries and Their Use in LR Parser Optimization
ACM Transactions on Programming Languages and Systems, 1982 E. Soisalon-Soininen
semanticscholar +1 more source
State Merging in LR Parser under Count based Reduction
, 2014 R. D. SolomonRaju, Priyesh Kumar
semanticscholar +1 more source
A Bounded Graph-Connect Construction for LR-regular Parsers [PDF]
, 2001 Jacques Farré, José Fortes Gálvez
openalex +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
A practical algorithm for generating LR parsers maintaining immediate error detection (abstract) [PDF]
, 1986 W. Douglas Findley, V. Santhanam
openalex +1 more source
On LR(k)-parsers of polynomial size
, 2015 Usually, a parser for an $LR(k)$-grammar $G$ is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string $x \in L(G)$. The best known upper bound for the size of such a parser is $O(2^{|G|| |^k+k\log | | + \log |G|})$ where $|G|$ and $| |$ are the sizes of the grammar $G$ and the terminal ...
openaire +2 more sources