On the public citation graph

How to squeeze a lexicon

https://doi.org/10.1002/spe.402
0 signed · 42 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.1002/spe.4380230103openalex-snapshot
Applications of finite automata representing large vocabularies
inferredcites →https://doi.org/10.1002/spe.4380230305openalex-snapshot
Bonsai: A compact representation of trees
inferredcites →https://doi.org/10.1002/spe.4380240205openalex-snapshot
A faster scrabble move generation algorithm
inferredcites →https://doi.org/10.1007/3-540-48057-9_11openalex-snapshot
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
inferredcites →https://doi.org/10.1007/bfb0031396openalex-snapshot
Practical optimizations for automata
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/0304-3975(92)90142-3openalex-snapshot
Minimisation of acyclic deterministic automata in linear time
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/s0304-3975(96)00146-6openalex-snapshot
Perfect hashing
inferredcites →https://doi.org/10.1080/00207169408804348openalex-snapshot
An algorithm for dynamic processing of dawg's
inferredcites →https://doi.org/10.1109/tcom.1982.1095395openalex-snapshot
Development of a Spelling List
inferredcites →https://doi.org/10.1142/s0218213095000188openalex-snapshot
TWO ALGORITHMS FOR INCREMENTAL CONSTRUCTION OF DIRECTED ACYCLIC WORD GRAPHS
inferredcites →https://doi.org/10.1145/28869.28873openalex-snapshot
Complete inverted files for efficient text retrieval and analysis
inferredcites →https://doi.org/10.1145/329.295openalex-snapshot
Algorithms for trie compaction
inferredcites →https://doi.org/10.1145/360248.360258openalex-snapshot
Compressed tries
inferredcites →https://doi.org/10.1145/42411.42420openalex-snapshot
The world's fastest Scrabble program
inferredcites →https://doi.org/10.1162/089120100561601openalex-snapshot
Incremental Construction of Minimal Acyclic Finite-State Automata
inferredcites →https://doi.org/10.1184/r1/6287645openalex-snapshot
Error-tolerant Finite State Recognition with Applications to Morphological Analysis and Spelling Correction
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.21437/eurospeech.1991-149openalex-snapshot
Lexical tree compression
inferredcites →https://doi.org/10.3115/1611533.1611538openalex-snapshot
Incremental construction of minimal acyclic finite state automata and transducers
inferredcites →https://doi.org/10.6100/ir444299openalex-snapshot
Taxonomies and toolkits of regular language algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.2261openalex-snapshot
Fast construction of space‐optimized recursive automaton
inferred← citeshttps://doi.org/10.1002/spe.643openalex-snapshot
LZ trie and dictionary compression
inferred← citeshttps://doi.org/10.1002/spe.678openalex-snapshot
Revisiting dictionary-based compression
inferred← citeshttps://doi.org/10.1007/11780885_22openalex-snapshot
On Compact Storage Models for Gazetteers
inferred← citeshttps://doi.org/10.1007/3-540-36456-0_22openalex-snapshot
Per-node Optimization of Finite-State Mechanisms for Natural Language Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-06932-6_31openalex-snapshot
An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_12openalex-snapshot
Smaller Representation of Finite State Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-23169-8_49openalex-snapshot
Efficient Representation of Transition Matrix in the Markov Process Modeling of Computer Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-33783-3_54openalex-snapshot
Large-Lexicon Attribute-Consistent Text Recognition in Natural Images
inferred← citeshttps://doi.org/10.1007/s00453-008-9172-4openalex-snapshot
Incremental Construction of Minimal Tree Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.023openalex-snapshot
Smaller representation of finite state automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00571-6openalex-snapshot
Optimal insertion in deterministic DAWGs
inferred← citeshttps://doi.org/10.1051/ita/2009018openalex-snapshot
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
inferred← citeshttps://doi.org/10.1109/ccwc51732.2021.9376076openalex-snapshot
Data Structures for Ordered Short Character-Sequences
inferred← citeshttps://doi.org/10.1109/iccea.2010.64openalex-snapshot
Customized Tries for Weighted Key Completion
inferred← citeshttps://doi.org/10.1109/scones.2004.1564764openalex-snapshot
Comparison of Hash Table Verses Lexical Transducer Based Implementations of Urdu Lexicon
inferred← citeshttps://doi.org/10.21105/joss.01986openalex-snapshot
DAFSA: a Python library for Deterministic Acyclic Finite State Automata
inferred← citeshttps://doi.org/10.21936/si2010_v31.n4b.338openalex-snapshot
Sekwencyjne i równolegle algorytmy znajdowania podciągów
inferred← citeshttps://doi.org/10.3103/s0147688225700522openalex-snapshot
Algorithm for Constructing a Minimal Deterministic Finite Automaton That Recognizes a Finite Set of Words
inferred← citeshttps://doi.org/10.70675/bd48f7ebz9c21z4ac6z9970z7725b0a53beaopenalex-snapshot
Efficient finite-state algorithms for the application of local grammars
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.