Levenshtein distance - wikipedia


	Levenshtein distance - wikipedia

ghiberti

9-14-2006 9:13 AM

516 views

tags:

levenshtein, algorithm, programming, text comparison, soundex, php

ghiberti says:

An algorithm to calculate how similar strings (words) are.

Add a Comment

Login to Comment. Not a member yet? Sign up

Today's Top Clips

visit the Top Clips page

View the Top Clips from September 14, 2006

Embed This Clip In Your Site...

<div style="margin: 12px 0px; font-family: arial; color: #333333; background: #ffffff; border: solid 4px #e5e5e5; width: 100%; clear: left;"><div class="CM_CTB_Content_Wrap" style="margin: 0px; padding: 0px;background-color: #ffffff;"><div style="border-bottom: solid 1px #dcdcdc; white-space: nowrap; margin-bottom: 8px; background-color: #eeeeee ;background-image: url(http://www.clipmarks.com/images/source-bg.gif); background-repeat: repeat-x; height: 24px; line-height: 24px; vertical-align: middle; padding-bottom: 4px; color: #666666; font-size: 10px;" ><a href="http://clipmarks.com/clip-to-blog/" title="see clips that are hot right now"><img src="http://content.clipmarks.com/blog_embed/bb2d9c56-66ce-47bf-83d7-4768792d2ea5/26F5EC27-1378-44B8-9758-94DB3D7625A5/" alt="" width="19" height="19" border="0" style="vertical-align: middle; margin: 0px 4px; display: inline; border: none; float:none;" /></a>clipped from <a title="http://en.wikipedia.org/w/index.php?title=Levenshtein_distance&oldid=74647176" href="http://en.wikipedia.org/w/index.php?title=Levenshtein_distance&oldid=74647176" style="font-size: 11px;">en.wikipedia.org</a></div><blockquote style="text-align: left; padding: 0px 8px; margin: 4px 0px 8px 0px; background: transparent; border: none;" cite="http://en.wikipedia.org/w/index.php?title=Levenshtein_distance&oldid=74647176"><H1 class="firstHeading">Levenshtein distance</H1></blockquote><div style="height: 2px; font-size: 2px; background: #dcdcdc; border-bottom: solid 1px #f5f5f5; margin: 2px 4px;"></div><blockquote style="text-align: left; padding: 0px 8px; margin: 4px 0px 8px 0px; background: transparent; border: none;" cite="http://en.wikipedia.org/w/index.php?title=Levenshtein_distance&oldid=74647176"><H3 id="siteSub">From Wikipedia, the free encyclopedia</H3></blockquote><div style="height: 2px; font-size: 2px; background: #dcdcdc; border-bottom: solid 1px #f5f5f5; margin: 2px 4px;"></div><blockquote style="text-align: left; padding: 0px 8px; margin: 4px 0px 8px 0px; background: transparent; border: none;" cite="http://en.wikipedia.org/w/index.php?title=Levenshtein_distance&oldid=74647176"><P>In <A title="Information%20theory" href="http://en.wikipedia.org/wiki/Information_theory">information theory</A> and <A title="Computer%20science" href="http://en.wikipedia.org/wiki/Computer_science">computer science</A>, the <B>Levenshtein distance</B> or <B>edit distance</B> between two <A title="String%20%28computer%20science%29" href="http://en.wikipedia.org/wiki/String_%28computer_science%29">strings</A> is given by the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character. It is named after <A title="Vladimir%20Levenshtein" href="http://en.wikipedia.org/wiki/Vladimir_Levenshtein">Vladimir Levenshtein</A>, who considered this distance in <A title="1965" href="http://en.wikipedia.org/wiki/1965">1965</A>. It is useful in applications that need to determine how similar two strings are, such as <A title="Spell%20checker" href="http://en.wikipedia.org/wiki/Spell_checker">spell checkers</A>.</P></blockquote></div><div style="margin: 0px 6px 6px 4px;"><table style="font-size: 11px;border-spacing: 0px;padding: 0px;" cellpadding="0" cellspacing="0" width="100%"><tr><td style="background:transparent;border-width:0px;padding:0px;">&nbsp;</td><td align="right" style="background:transparent;border-width:0px;padding:0px;width:107px" width="107"><a href="http://clipmarks.com/share/26F5EC27-1378-44B8-9758-94DB3D7625A5/blog/" title="blog or email this clip"><img src="http://content8.clipmarks.com/images/c2b-foot.png" border="0" alt="blog it" width="107" height="17" style="border-width:0px;padding:0px;margin:0px;" /></a></td></tr></table></div></div>

New from the makers of Clipmarks: Amplify.com - Don't just share the news...Amplify it!

Clipmarks: Home; New Clips; Top Clips; Dashboard

Popular Topics: News; Life; Science; Technology; Entertainment

Get Started: Sign Up; Install Clipping Tool; How Clipping Works; Clip-to-Blog™; ClipSearch

Tools and Resources: FAQ; ClipWeek; Top Clippers; Top Tags; Site Map

About Clipmarks: About Us; Contact; Copyright; Privacy; EULA

Search Options

Today's Top Clips