Htaccess    html   Php    javascript   Asp   css    maths  Past Questions  Practice Tests Online

levenshtein function syntax tag tutorial 2013 Donate at flattr Flattr this

Alert! Connect with 10,000 Chating Online. Join Now

Php levenshtein () function

Write your php code

<?php ?>

Php Result

Your code below

(PHP 3>= 3.0.17, PHP 4 >= 4.0.1, PHP 5)

levenshtein --  Calculate Levenshtein distance between two strings


int levenshtein ( string str1, string str2 [, int cost_ins [, int cost_rep, int cost_del]] )

This function returns the Levenshtein-Distance between the two argument strings or -1, if one of the argument strings is longer than the limit of 255 characters.

The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform str1 into str2. The complexity of the algorithm is O(m*n), where n and m are the length of str1 and str2 (rather good when compared to similar_text(), which is O(max(n,m)**3), but still expensive).

In its simplest form the function will take only the two strings as parameter and will calculate just the number of insert, replace and delete operations needed to transform str1 into str2.

A second variant will take three additional parameters that define the cost of insert, replace and delete operations. This is more general and adaptive than variant one, but not as efficient.

Example 1. levenshtein() example

// input misspelled word
$input = 'carrrot';

// array of words to check against
$words  = array('apple','pineapple','banana','orange',

// no shortest distance found, yet
$shortest = -1;

// loop through words to find the closest
foreach ($words as $word) {

// calculate the distance between the input word,
    // and the current word
$lev = levenshtein($input, $word);

// check for an exact match
if ($lev == 0) {

// closest word is this one (exact match)
$closest = $word;
$shortest = 0;

// break out of the loop; we've found an exact match

// if this distance is less than the next found shortest
    // distance, OR if a next shortest word has not yet been found
if ($lev <= $shortest || $shortest < 0) {
// set the closest match, and shortest distance
$closest  = $word;
$shortest = $lev;

"Input word: $input\n";
if (
$shortest == 0) {
"Exact match found: $closest\n";
} else {
"Did you mean: $closest?\n";


The above example will output:

Input word: carrrot
Did you mean: carrot?

See also soundex(), similar_text(), and metaphone().

Php levenshtein Function syntax tag

levenshtein php code on this is provided for your study purpose, it will guide you to know how create and design a website using php. use it to practice and train your self online

Php levenshtein syntax tutorial

php tutorial guide and code design are for easy learning and programming. The code practice section provided at the top is for practising of this syntax. Use the code section up to practice your php programming online. Learning php is very easy, all you need is to use the examples on this site and practice them to perfect your skills.

Function index







Date & Time

Directory function




Form data handling

Mathematics operators


Php Mysql

Network Functions


php tutorial guides,functions, classes, code examples and tags for creating simple dynamic site to mysql database driven sites
Htaccess    html   Php    javascript   Asp   css    maths  Past Questions  Practice Tests Online