danieldk/dictomaton
View on GitHub ↗ ★ 133 Java archived
Finite state dictionaries in Java
13 mentions on Hacker News by 2 people: 0 stories, 13 comments · first 2013-05-05 · latest 2023-09-11
20082026
-
…the intersection automaton. I wrote a Java package a decade ago that implements some of this stuff: https://github.com/danieldk/dictomaton
comment by danieldk · 2023-09-11 · in Calculate the difference and intersection of any two regexes -
…I made a Java package in 2013 that supports: DAWGs, Levenshtein automata and perfect hash automata: https://github.com/danieldk/dictomaton
comment by danieldk · 2022-07-22 · in Ask HN: What are some cool but obscure data structures you know about? -
…does some of the things described in the article (DAWGS, perfect hashing, Levenshtein automata): https://github.com/danieldk/dictomaton
comment by danieldk · 2015-11-12 · in Finite state machines as data structure for representing ordered sets and maps -
…is O(mn) in the number of states of the two automata). For an implementation of this and more, see: https://github.com/danieldk/dictomaton
comment by danieldk · 2015-09-21 · in Fuzzy string matching using cosine similarity -
…but they don't use an LRU cache and I think still permit the registry to grow without bound. [1] - https://github.com/danieldk/dictomaton/blob/master/src/main/... [2] - https://github.com/BurntSushi/fst/blob/master/src/fst/regist... (The…
comment by burntsushi · 2015-09-20 · in Implementing Levenshtein Automata -
…state dictionaries, perfect hash automata, and String mappings based on perfect hash automata): https://github.com/danieldk/dictomaton
comment by danieldk · 2015-09-20 · in Implementing Levenshtein Automata -
…the Levenshtein automaton. This approach is fast and very compact. I have a Java implementation: https://github.com/danieldk/dictomaton
comment by danieldk · 2015-03-07 · in The ups of downs of porting 50k lines of C++ to Go -
…word/sequence). - String-keyed maps that use a finite state automaton to store keys. More info: https://github.com/danieldk/dictomaton http://search.maven.org/#artifactdetails%7Ceu.danieldk.dicto...
comment by danieldk · 2014-08-10 · in Fast and easy Levenshtein distance using a trie (2011) -
…for String keys, that store strings in an automaton and uses a flat array to store values: https://github.com/danieldk/dictomaton [1] http://csi.ufs.ac.za/resres/files/Schultz.pdf
comment by danieldk · 2014-06-19 · in Minimal Perfect Hashing -
Or store the lexicon in a determinisitic acyclic finite state automaton. E.g. (shameless plug): https://github.com/danieldk/dictomaton Though, having implemented a language guesser myself, it's only an issue with very short texts (a few…
comment by danieldk · 2013-11-19 · in Show HN: Language detection as a service -
And my implementation in Java :): https://github.com/danieldk/dictomaton
comment by danieldk · 2013-08-13 · in frak: Transform collections of strings into regular expressions -
…in my library that (among other things) uses a minimized DFA to store String sets in Java: https://github.com/danieldk/dictomaton (It also supports perfect hashing automata and Levenshtein automata.)
comment by danieldk · 2013-08-13 · in frak: Transform collections of strings into regular expressions