Showing posts from January, 2015

Levenshtein distance

Today, There is a discussion on Levenshtein distance. How is working, really exciting.

Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other

For example, the Levenshtein distance between "kitten" and "sitting" is 3, since the following three edits change one into the other, and there is no way to do it with fewer than three edits:

kitten → sitten (substitution of "s" for "k")sitten → sittin (substitution of "i" for "e")sittin → sitting (insertion of "g" at the end).On the surfing found a resource of online calculator for Levenshtein distance.

Online calculator: Levenshtein Distance

But how is this possible. Searching for an algorithm. I found pseudo code
// len_s and len_t are the number of …


Open source doesn't just mean access to the source code. The distribution terms of open-source software must comply with the following criteria:1. Free RedistributionThe license shall not restrict any party from selling or giving away the software as a component of an aggregate software distribution containing programs from several different sources. The license shall not require a royalty or other fee for such sale. 2. Source CodeThe program must include source code, and must allow distribution in source code as well as compiled form. Where some form of a product is not distributed with source code, there must be a well-publicized means of obtaining the source code for no more than a reasonable reproduction cost preferably, downloading via the Internet without charge. The source code must be the preferred form in which a programmer would modify the program. Deliberately obfuscated source code is not allowed. Intermediate forms such as the output of a preprocessor or translator are…