dictomaton

Finite state dictionaries in Java (by danieldk)

Dictomaton Alternatives

Similar projects and alternatives to dictomaton

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better dictomaton alternative or higher similarity.

dictomaton reviews and mentions

Posts with mentions or reviews of dictomaton. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-09-11.
  • Calculate the difference and intersection of any two regexes
    4 projects | news.ycombinator.com | 11 Sep 2023
    Say you want to compute all strings of length 5 that the automaton can generate. Conceptually the nicest way is to create an automaton that matches any five characters and then compute the intersection between that automaton and the regex automaton. Then you can generate all the strings in the intersection automaton. Of course, IRL, you wouldn't actually generate the intersection (you can easily do this on the fly), but you get the idea.

    Automata are really a lost art in modern natural language processing. We used to do things like store a large vocabulary in an deterministic acyclic minimized automaton (nice and compact, so-called dictionary automaton). And then to find, say all words within Levenshtein distance 2 of hacker, create a Levenshtein automaton for hacker and then compute (on the fly) the intersection between the Levenshtein automaton and the dictionary automaton. The language of the automaton is then all words within the intersection automaton.

    I wrote a Java package a decade ago that implements some of this stuff:

    https://github.com/danieldk/dictomaton

  • Ask HN: What are some 'cool' but obscure data structures you know about?
    54 projects | news.ycombinator.com | 21 Jul 2022
    Also related: Levenshtein automata - automata for words that match every word within a given Levenshtein distance. The intersection of a Levenshtein automaton of a word and a DAWG gives you an automaton of all words within the given edit distance.

    I haven't done any Java in years, but I made a Java package in 2013 that supports: DAWGs, Levenshtein automata and perfect hash automata:

    https://github.com/danieldk/dictomaton

Stats

Basic dictomaton repo stats
2
130
1.8
about 2 years ago
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com