View the Project on GitHub jpbarrette/moman



This was supposed to be a suite of tools to be used by an orthographic/grammatical checker and the checker itself. However, the project is mainly dead right now. But I encourage you to look through the code and use it as inspiration/reference. The tools are currently coded in Python, but I started a while back to rewrite it in Lisp (which will never be finished). Moman, the suite itself, consist of the following tools:

Mostly, the only part of the tools suite which is worthwhile mentioning is the "Fast String Correction" which is used by Lucene's FuzzyQuery. You can read about the inclusion of this project in Lucene by reading Michael McCandless's article.


The FineNight library contains many algorithms for Finite State Automatons. That includes:

Almost all algorithms were taken from the book Introduction to Automata Theory, Languages, and Computation. The minimization algorithm is an implementation of Brzozowski's method. In this method, the (possibly non-deterministic) automaton is reversed, determinized, reversed and determinized. I'll eventually add the Hopcroft's nlog(n) minimization algorithm.


ZSpell is meant to be a concurrent of aspell, made by Kevin Atkinson. At this time, ZSpell can suggest words with a Levenshtein-distance of one. Before we were using Kemal Oflazer's algorithm. This algorithm is very slow, but now we use a faster algorithm (Schulz's and Mihov's algorithm). However, only substitution, removal and insertion are used for the faster algorithm. It means that transpositions errors, like "ehllo" -> "hello", are considered as two operations.

TODOs includes: