Levenshtein

A Java package that provides several computations related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed. Platforms: Windows, Mac, Linux

This package provides implementations of the Levenshtein, Damerau-Levenshtein, and a weighted edit distance for strings as well as key lists (i.e. cell arrays of strings) Platforms: Matlab

iTrash is an uninstall utility that uses a special search algorithm (Levenshtein Distance algorithm) to find all related files and deletes them when asked. Applications distribute several files throughout your system storage devices. Deleting an application itself is mostly not enough and will... Platforms: Mac

GenericLevenshtein Yet another Implementation of Levenshtein Distance GenericLevenshtein is an implementation of Minimum Edit Distance, also called Levenshtein Distance, written by Ramon Ziai and Niels Ott. This algorithm is very popular and it is often used to compute the similarity of... Platforms: Mac

MarcXimiL is a free, flexible, fully standards-compliant and efficient bibliographic similarity analysis framework. MarcXimiL comes out of the box with generic predefined similarity strategies. However, strategies may be customized in a flexible way: the order of comparisons between or within... Platforms: *nix

Text::WagnerFischer is an implementation of the Wagner-Fischer edit distance. SYNOPSIS use Text::WagnerFischer qw(distance); print distance("foo","four");# prints "2" print distance([0,1,2],"foo","four");# prints "3" my @words=("four","foo","bar"); my... Platforms: *nix

SoftChronizer is a very easy to use, fast and versatile double-file search program, that was designed for to help you to keep your private or corporate book, music or picture collection in order, as well as for other use cases. SoftChronizer can search reliably for any type of duplicate... Platforms: Windows

jLevenshtein was developed as a Java project that is able to provide several computations that are related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed. Platforms: Windows

Applications distribute several files throughout your system storage devices. Deleting a application itself is mostly not enough and will leave several files untouched. iTrash uses a special search algorithm to find all related files and deletes them when asked. Features Ghost Mode Background... Platforms: Mac

Stardict is a free open source off-line dictionary program that allows you to use all those free dictionaries(at the moment more than 100 dictionaries are available). Glob-style pattern matching You can input strings containing '*' (wildcard) and '?' (joker) as the pattern. '*' matches an... Platforms: *nix

Remadder is a software tool which can be used both to identify related records in two separate data sets or to identify duplicate records in a data set. This class of tasks is commonly reffered as record linkage, data matching, data duplicate detection, data deduplication, etc. Remadder... Platforms: Windows, Windows 8, Windows 7, Windows Server