On the public citation graph

Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1995.1026openalex-snapshot
When Won′t Membership Queries Help?
inferredcites →https://doi.org/10.1007/3-540-45164-1openalex-snapshot
Machine Learning: ECML 2000
inferredcites →https://doi.org/10.1007/3-540-45164-1_23openalex-snapshot
Learning Context-Free Grammars with a Simplicity Bias
inferredcites →https://doi.org/10.1007/3-540-45435-7_13openalex-snapshot
Inferring Deterministic Linear Languages
inferredcites →https://doi.org/10.1007/3-540-45790-9_14openalex-snapshot
Incremental Learning of Context Free Grammars
inferredcites →https://doi.org/10.1007/3-540-62927-0openalex-snapshot
Foundations of Inductive Logic Programming
inferredcites →https://doi.org/10.1007/978-3-540-45257-7_15openalex-snapshot
Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-45257-7_19openalex-snapshot
Learning Context-Free Grammars from Partially Structured Examples
inferredcites →https://doi.org/10.1016/0010-4485(86)90018-7openalex-snapshot
Prolog programming for artificial intelligence
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0743-1066(91)90002-7openalex-snapshot
Definite-clause set grammars: a formalism for problem solving
inferredcites →https://doi.org/10.1016/0890-5401(92)90003-xopenalex-snapshot
Efficient learning of context-free grammars from positive structural examples
inferredcites →https://doi.org/10.1016/j.patcog.2005.01.004openalex-snapshot
Incremental learning of context free grammars based on bottom-up parsing and search
inferredcites →https://doi.org/10.1016/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferredcites →https://doi.org/10.1145/138027.138042openalex-snapshot
The minimum consistent DFA problem cannot be approximated within any polynomial
inferredcites →https://doi.org/10.1527/tjsai.21.371openalex-snapshot
Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_3openalex-snapshot
The Omphalos Context-Free Grammar Learning Competition
inferred← citeshttps://doi.org/10.1007/978-3-540-87481-2_7openalex-snapshot
Towards Machine Learning of Grammars and Compilers of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-16184-1_9openalex-snapshot
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_39openalex-snapshot
Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars
inferred← citeshttps://doi.org/10.1007/s10703-023-00420-3openalex-snapshot
Symbolic encoding of LL(1) parsing and its applications
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.12.002openalex-snapshot
Grammatical inference of directed acyclic graph languages with polynomial time complexity
inferred← citeshttps://doi.org/10.1109/icat.2009.5348441openalex-snapshot
Grammar inference algorithms and applications in software engineering
inferred← citeshttps://doi.org/10.1109/icmla.2009.28openalex-snapshot
Learning Context Free Grammars by Using SAT Solvers
inferred← citeshttps://doi.org/10.1117/1.jei.23.3.033016openalex-snapshot
Human behavior recognition using a context-free grammar
inferred← citeshttps://doi.org/10.1117/12.2004228openalex-snapshot
Weighted symbolic analysis of human behavior for event detection
inferred← citeshttps://doi.org/10.1142/9781848165458_0008openalex-snapshot
Applications of Grammatical Inference in Software Engineering: Domain Specific Language Development
inferred← citeshttps://doi.org/10.1145/1953355.1953380openalex-snapshot
Gramin
inferred← citeshttps://doi.org/10.1145/3486608.3486910openalex-snapshot
Automatic grammar repair
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.1197openalex-snapshot
Search for Minimal and Semi-Minimal Rule Sets in Incremental Learning of Context-Free and Definite Clause Grammars
inferred← citeshttps://doi.org/10.3115/1599081.1599172openalex-snapshot
Unsupervised induction of labeled parse trees by clustering with syntactic features
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.