How to squeeze a lexicon
From MaRDI portal
Publication:2783368
DOI10.1002/spe.402zbMath0987.68782OpenAlexW2134683501MaRDI QIDQ2783368
Marcin G. Ciura, Sebastian Deorowicz
Publication date: 26 June 2002
Published in: Software: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/spe.402
Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Data structures (68P05) Natural language processing (68T50)
Related Items
Incremental construction of minimal tree automata ⋮ Optimal insertion in deterministic DAWGs ⋮ Smaller representation of finite state automata ⋮ Smaller Representation of Finite State Automata ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
Cites Work