Projects / Approximate Dictionaries

Approximate Dictionaries

Approdictio provides implementations of dictionaries that allow approximate lookup. When looking up a word, all words are returned that are approximately equal to the word given. The definition of approximately equal depends on the metric provided to define the distance between two words. An implementation of the Levensthein Metric with customizable edit costs is part of the package.

Tags
Licenses
Implementation

RSS Recent releases

  •  09 Apr 2012 21:31

Release Notes: This release adds an Iterator for BKTree which provides results according to the order defined by a Comparator. This allows retrieving the "best" matches according to this Comparator first.

  •  15 Aug 2010 12:55

Release Notes: Previously, maxDist was a parameter of the construtor of the dictionary implementations denoting the maximum distance a returned word shall have from the query word. It was, however, not necessary to fix this parameter when the dictionaries are created. Now maxDist is an explicit parameter of the lookup method.

  •  20 Dec 2009 17:34

Release Notes: This release adds the method lookupDistinct() to the dictionaries and the Didyoumean class to find words similar to the query word, even if the query word exists in the dictionary.

  •  10 Nov 2009 22:19

Release Notes: This release fixes a NullPointerException for lookups on empty NgramDict and adds the respective test. It adds an @throws comment to NgramDict.lookup() with regard to ConcurrentModificationException.

  •  23 Nov 2008 22:57

Release Notes: The build process has been changed to produce Java 1.5 class files for wider compatibility. Some classes have been refactored for better readability and maintainability.

Screenshot

Project Spotlight

GluCat

A generic library of universal Clifford algebra templates.

Screenshot

Project Spotlight

Gitblit

A pure Java Git solution.