PHP-Fusion Powered Website - Articles: C++ Program to Implement Levenshtein Distance Computing Algorithm

Users Online

· Guests Online: 120

· Members Online: 0

· Total Members: 188
· Newest Member: meenachowdary055

Forum Threads

Newest Threads

No Threads created

Hottest Threads

No Threads created

Latest Articles

· Do while loop
· The for loop in C
· C while loop
· Pointers in C
· Functions in C

Oh no! Where's the JavaScript?
Your Web browser does not have JavaScript enabled or does not support JavaScript. Please enable JavaScript on your Web browser to properly view this Web site,
or upgrade to a Web browser that does support JavaScript; Firefox, Safari, Opera, Chrome or a version of Internet Explorer newer then version 6.

Articles Hierarchy

Articles Home » C++ » C++ Program to Implement Levenshtein Distance Computing Algorithm

C++ Program to Implement Levenshtein Distance Computing Algorithm

This is a C++ Program to find Levenshtein Distance. The Wagner–Fischer algorithm is a dynamic programming algorithm that measures the Levenshtein distance between two strings of characters.
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:

Here is source code of the C++ Program to Implement Levenshtein Distance Computing Algorithm. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
#include <stdio.h>
```
```
#include <math.h>
```
```
#include <string.h>
```
```
int d[100][100];
```

#define MIN(x,y) ((x) < (y) ? (x) : (y))

```
int main()
```
```
{
```
```
    int i,j,m,n,temp,tracker;
```
```
    char s[] = "Sanfoundry";
```
```
    char t[] = "Education";
```
```
    m = strlen(s);
```
```
    n = strlen(t);
```
```
 
```
```
    for(i=0;i<=m;i++)
```
```
    d[0][i] = i;
```
```
    for(j=0;j<=n;j++)
```
```
    d[j][0] = j;
```
```
 
```
```
    for (j=1;j<=m;j++)
```
```
    {
```
```
        for(i=1;i<=n;i++)
```
```
        {
```
```
            if(s[i-1] == t[j-1])
```
```
            {
```
```
                tracker = 0;
```
```
            }
```
```
            else
```
```
            {
```
```
                tracker = 1;
```
```
            }
```

            temp = MIN((d[i-1][j]+1),(d[i][j-1]+1));

            d[i][j] = MIN(temp,(d[i-1][j-1]+tracker));

```
        }
```
```
    }
```

    printf("the Levinstein distance is %d\n",d[n][m]);

```
    return 0;
```
```
}
```

Output:

$ g++ LevenshteinDist.cpp
$ a.out
 
the Levinstein distance is 9
 
------------------
(program exited with code: 0)
Press return to continue

Users Online

Forum Threads

Latest Articles

Articles Hierarchy

C++ Program to Implement Levenshtein Distance Computing Algorithm

C++ Program to Implement Levenshtein Distance Computing Algorithm

Comments

Post Comment

Ratings