<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>String Similarity on Artur Rios Lab</title><link>https://lab.artur-rios.tech/tags/string-similarity/</link><description>Recent content in String Similarity on Artur Rios Lab</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 21 Oct 2026 20:00:00 +0000</lastBuildDate><atom:link href="https://lab.artur-rios.tech/tags/string-similarity/index.xml" rel="self" type="application/rss+xml"/><item><title>String Similarity: Levenshtein, Jaro and Jaro–Winkler</title><link>https://lab.artur-rios.tech/fundamentals/string-similarity/</link><pubDate>Wed, 21 Oct 2026 20:00:00 +0000</pubDate><guid>https://lab.artur-rios.tech/fundamentals/string-similarity/</guid><description>&lt;p&gt;Two strings are equal or they are not, and for a computer that is the end of&#10;it: &lt;code&gt;&amp;quot;Smith&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;Smyth&amp;quot;&lt;/code&gt; differ, and so do &lt;code&gt;&amp;quot;recieve&amp;quot;&lt;/code&gt; and &lt;code&gt;&amp;quot;receive&amp;quot;&lt;/code&gt;. For&#10;the person who typed them, though, they are almost the same, and a lot of&#10;software has to act on that &amp;ldquo;almost&amp;rdquo;. A spell checker has to find the word&#10;that was meant. A search box has to forgive a typo. A company merging two&#10;customer lists has to notice that &amp;ldquo;Jon Smyth, 12 Main St&amp;rdquo; and &amp;ldquo;John Smith,&#10;12 Main Street&amp;rdquo; are probably the same person. A &lt;strong&gt;string similarity measure&lt;/strong&gt;&#10;puts a number on how close two strings are, so a program can make those calls.&lt;/p&gt;</description></item></channel></rss>