•        0

A C++ class (One short include file) for calculating Levenshtein and Damerau distances. Template-based, no external dependency, compromise between concision and performance.




comments powered by Disqus

Related Projects

Pylevenshtein - A fast implementation of Levenshtein Distance (and others) for Python

Levenshtein Python extension and C library. The Levenshtein Python C extension module contains functions for fast computation of Levenshtein (edit) distance, and edit operations string similarity approximate median strings, and generally string averaging tring sequence and set similarity It supports both normal and Unicode strings. This page exists because the original home page seems to have disappeared. It currently contains version 0.10.1 in both subversion and attached as a download.

Blind Shark

Blind Shark is a musical game, where you have to find the music being played before your opponents.

Pypometre - A python tool for detecting plagiarism in source-code corpora

A python tool for detecting plagiarism in source-code corpora. Packages neededLevenshtein Edit Distance : http://code.google.com/p/pylevenshtein/ Munkres Algorithm : http://pypi.python.org/pypi/hungarian/

Fuzzy-search-tools - Tools for fuzzy string search in text and dictionaries written in Java

Here are the most commonly used algorithms and auxiliary utilities for fuzzy (similarity) string search in large dictionaries written in Java. Levenshtein Distance (with cutoff and prefix version) Damerau-Levenshtein Distance (with cutoff and prefix version) Extension (Spell-checker) Method N-Gram Method (with some modifications) Signature Hash Method Bitap (Shift-Or with Wu-Manber modifications) Burkhard-Keller (BK) Trees Skip algorithm All implementations are aimed to provide simplicity and cl

Rescue-svn - Nominalizer

Application that uses a TST and the "noisy channel transformation" technique, to learn transformation rules between verbs and nouns and apply it to transform verbs to nouns.

Yeti-witch - A collection of Javascript fuzzy string searching techniques.

Yeti WitchThis project adds several well known techniques for finding strings-that-almost-match-other-strings to the native Javascript String object, some of which are phonetic algorithms. The supported list currently includes Soundex, Refined Soundex, Metaphone, Caverphone, Levenshtein distance, anagrams and Porter Stemming. All of these are primarily designed to work with the English language, although anagrams and Levenshtein are just string analysis so will work with anything. The extensions


The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

Djangobile - Django Mobile Extension

Djangobile, Django Mobile ExtensionAbstractDjangobile is a django mobile extension for rendering web pages according to device capabilities. Therefore djangobile offers an implementation for W3C Working Draft IDEAL (Interface DEscription Authoring Language). Note: This software is a bit old, so perhaps it may doesn't work properly with new versions of Django.. DependenciesRequiredPyWURFL (pywurfl-6.4.0b). A Python language package that makes dealing with the WURFL in Python a little easier. Spec

Oracleofwoodyallen - The oracle of Woody Allen

The oracle of Woody AllenDo you know about the "Six degrees of separation" theory? It states that "everyone is at most six steps away from any other person on Earth". Do you know about "The Oracle of Bacon" website? Why actors are so important!? People behind the scenes is as important, or even more, as the actors. This project is dedicated to all of them, specially to one of the best filmmakers: Woody Allen. This project started as a college work and it has only educational purposes. How does i

Bpbio - simple bioinformatics scripts

bioinformatics stuffs. any feedback or contributions would be greatly appreciated i can move code to github/bitbucket to facilitate that if it helps: NOTE: as of 2009/10/13 some modules which previously lived here have been moved to bitbucket biostuff: fast, memory efficient (cython) reader and objects for GFF and tab-delimited BLAST files: http://code.google.com/p/bpbio/source/browse/#svn/trunk/biostuff/biostuff from biostuff import BlastLine for line in open('some_file.blast'): b = BlastLine(l