{"id":1389,"date":"2018-10-09T00:44:26","date_gmt":"2018-10-09T07:44:26","guid":{"rendered":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/"},"modified":"2018-10-09T00:44:26","modified_gmt":"2018-10-09T07:44:26","slug":"fuzzy-matching","status":"publish","type":"post","link":"https:\/\/www.couchbase.com\/blog\/pt\/fuzzy-matching\/","title":{"rendered":"What Is Fuzzy Matching and How to Use It Correctly"},"content":{"rendered":"\n

Have you sound yourself asking the question, \u201cWhat is fuzzy matching?\u201d Fuzzy matching allows you to identify non-exact matches of your target item. It is the foundation stone of many search engine frameworks and one of the main reasons why you can get relevant search results even if you have a typo in your query or a different verbal tense.<\/p>\n\n\n\n

As you might expect, there are many fuzzy searching algorithms that can be used for text, but virtually all search engine frameworks (including bleve<\/a>) use primarily the Levenshtein Distance for fuzzy string matching:<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Levenshtein Distance<\/strong><\/h3>\n\n\n\n

Also known as Edit Distance<\/strong>, it is the number of transformations (deletions, insertions, or substitutions) required to transform a source string into the target one. For a fuzzy search example, if the target term is \u201cbook\u201d and the source is \u201cback\u201d, you will need to change the first \u201co\u201d to \u201ca\u201d and the second \u201co\u201d to \u201cc\u201d, which will give us a Levenshtein Distance of 2.Edit Distance is very easy to implement, and it is a popular challenge during code interviews (You can find Levenshtein implementations in JavaScript, Kotlin, Java, and many others here<\/a>).<\/p>\n\n\n\n

Additionally, some frameworks also support the Damerau-Levenshtein distance:<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Damerau-Levenshtein distance<\/strong><\/h3>\n\n\n\n

It is an extension to Levenshtein Distance, allowing one extra operation: Transposition<\/em><\/strong>\u00a0of two adjacent characters:<\/p>\n\n\n\n

Ex: <\/strong>TSAR to STAR<\/p>\n\n\n\n

Damerau-Levenshtein distance = <\/strong>1\u00a0 (Switching S and T positions cost only one operation)<\/p>\n\n\n\n

Levenshtein distance = 2\u00a0<\/strong> (Replace S by T and T by S)<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Fuzzy matching and relevance<\/strong><\/h2>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Fuzzy matching has one big side effect; it messes up with relevance. Although Damerau-Levenshtein is a fuzzy matching algorithm that considers most of the common user\u2019s misspellings, it also can include a significant number of false positives<\/strong>, especially when we are using a language with an average of just 5 letters per word<\/a>, such as English. That is why most of the search engine frameworks prefer to stick with Levenshtein distance. Let\u2019s see a real fuzzy matching example of it:<\/p>\n\n\n\n

First, we are going to use this movie catalog dataset<\/a>. I highly recommend it if you want to play with full-text search. Then, let\u2019s search for movies with \u201cbook<\/strong>\u201d in the title. A simple code would look like the following:<\/p>\n\n\n

[crayon lang=”java” decode=”true”]String indexName = “movies_index”;
\nMatchQuery query = SearchQuery.match(“book”).field(“title”);
\nSearchQueryResult result = movieRepository.getCouchbaseOperations().getCouchbaseBucket().query(
\nnew SearchQuery(indexName, query).highlight().limit(6));<\/p>\n

printResults(movies);[\/crayon]<\/p>\n\n\n\n

The code above will bring the following results:<\/p>\n\n\n

[crayon lang=”default” decode=”true”]1) The Book Thief
\n score: 4.826942606027416
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> Thief]
\n —————————–<\/p>\n

2) The Book of Eli
\n score: 4.826942606027416
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Eli]
\n —————————–<\/p>\n

3) The Book of Life
\n score: 4.826942606027416
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Life]
\n —————————–<\/p>\n

4) Black Book
\n score: 4.826942606027416
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[Black <mark>Book<\/mark>]
\n —————————–<\/p>\n

5) The Jungle Book
\n score: 4.826942606027416
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark>]
\n —————————–<\/p>\n

6) The Jungle Book 2
\n score: 3.9411821308689627
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark> 2]
\n —————————–
\n[\/crayon]<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

By default, the results are case-insensitive, but you can easily change this behavior by creating new indexes with different analyzers.<\/p>\n\n\n\n

Now, let\u2019s add a fuzzy matching capability to our query by setting fuzziness as 1 (Levenshtein distance 1), which means that \u201cbook<\/strong>\u201d and \u201clook<\/strong>\u201d will have the same relevance.<\/p>\n\n\n

[crayon lang=”java” decode=”true”]String indexName = “movies_index”;
\nMatchQuery query = SearchQuery.match(“book”).field(“title”).fuzziness(1);
\nSearchQueryResult result = movieRepository.getCouchbaseOperations().getCouchbaseBucket().query(
\nnew SearchQuery(indexName, query).highlight().limit(6));<\/p>\n

printResults(movies);[\/crayon]<\/p>\n\n\n\n

And here is the fuzzy search result:<\/p>\n\n\n

[crayon lang=”default” decode=”true”]1) Hook
\n score: 1.1012248063242538
\n Hit Locations:
\n field:title
\n term:hook
\n fragment:[<mark>Hook<\/mark>]
\n —————————–<\/p>\n

2) Here Comes the Boom
\n score: 0.7786835148361213
\n Hit Locations:
\n field:title
\n term:boom
\n fragment:[Here Comes the <mark>Boom<\/mark>]
\n —————————–<\/p>\n

3) Look Who’s Talking Too
\n score: 0.7047266634351538
\n Hit Locations:
\n field:title
\n term:look
\n fragment:[<mark>Look<\/mark> Who’s Talking Too]
\n —————————–<\/p>\n

4) Look Who’s Talking
\n score: 0.7047266634351538
\n Hit Locations:
\n field:title
\n term:look
\n fragment:[<mark>Look<\/mark> Who’s Talking]
\n —————————–<\/p>\n

5) The Book Thief
\n score: 0.5228811753737184
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> Thief]
\n —————————–<\/p>\n

6) The Book of Eli
\n score: 0.5228811753737184
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Eli]
\n —————————–
\n[\/crayon]<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Now, the movie called \u201cHook<\/strong>\u201d is the very first search result, which might not be exactly what the user is expecting in a search for \u201cBook<\/strong>\u201d.<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

How to minimize false positives during fuzzy lookups<\/strong><\/h3>\n\n\n\n

\u00a0<\/strong><\/p>\n\n\n\n

\u00a0<\/strong>In an ideal world, users would never make any typos while searching for something. However, that is not the world we live in, and if you want your users to have a pleasant experience, you have got to handle at least an edit distance of 1. Therefore, the real question is: How can we make fuzzy string matching while minimizing relevance loss?<\/p>\n\n\n\n

We can take advantage of one characteristic of most search engine frameworks: A match with a lower edit distance will usually score higher. That characteristic allows us to combine those two queries with different fuzziness levels into one:<\/p>\n\n\n

[crayon lang=”java” decode=”true”]String indexName = “movies_index”;
\nString word = “Book”;
\nMatchQuery titleFuzzy = SearchQuery.match(word).fuzziness(1).field(“title”);
\nMatchQuery titleSimple = SearchQuery.match(word).field(“title”);
\nDisjunctionQuery ftsQuery = SearchQuery.disjuncts(titleSimple, titleFuzzy);<\/p>\n

SearchQueryResult result = movieRepository.getCouchbaseOperations().getCouchbaseBucket().query(
\nnew SearchQuery(indexName, ftsQuery).highlight().limit(20));\u00a0printResults(result);[\/crayon]<\/p>\n\n\n\n

Here is the result of the fuzzy query above:<\/p>\n\n\n

[crayon lang=”default” decode=”true”]1) The Book Thief
\n score: 2.398890092610849
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> Thief]
\n —————————–
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> Thief]
\n —————————–<\/p>\n

2) The Book of Eli
\n score: 2.398890092610849
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Eli]
\n —————————–
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Eli]
\n —————————–<\/p>\n

3) The Book of Life
\n score: 2.398890092610849
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Life]
\n —————————–
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Life]
\n —————————–<\/p>\n

4) Black Book
\n score: 2.398890092610849
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[Black <mark>Book<\/mark>]
\n —————————–
\n field:title
\n term:book
\n fragment:[Black <mark>Book<\/mark>]
\n —————————–<\/p>\n

5) The Jungle Book
\n score: 2.398890092610849
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark>]
\n —————————–
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark>]
\n —————————–<\/p>\n

6) The Jungle Book 2
\n score: 1.958685557004688
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark> 2]
\n —————————–
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark> 2]
\n —————————–<\/p>\n

7) National Treasure: Book of Secrets
\n score: 1.6962714808368062
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[National Treasure: <mark>Book<\/mark> of Secrets]
\n —————————–
\n field:title
\n term:book
\n fragment:[National Treasure: <mark>Book<\/mark> of Secrets]
\n —————————–<\/p>\n

8) American Pie Presents: The Book of Love
\n score: 1.517191317611584
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[American Pie Presents: The <mark>Book<\/mark> of Love]
\n —————————–
\n field:title
\n term:book
\n fragment:[American Pie Presents: The <mark>Book<\/mark> of Love]
\n —————————–<\/p>\n

9) Hook
\n score: 0.5052232518679681
\n Hit Locations:
\n field:title
\n term:hook
\n fragment:[<mark>Hook<\/mark>]
\n —————————–<\/p>\n

10) Here Comes the Boom
\n score: 0.357246781294941
\n Hit Locations:
\n field:title
\n term:boom
\n fragment:[Here Comes the <mark>Boom<\/mark>]
\n —————————–<\/p>\n

11) Look Who’s Talking Too
\n score: 0.32331663301992025
\n Hit Locations:
\n field:title
\n term:look
\n fragment:[<mark>Look<\/mark> Who’s Talking Too]
\n —————————–<\/p>\n

12) Look Who’s Talking
\n score: 0.32331663301992025
\n Hit Locations:
\n field:title
\n term:look
\n fragment:[<mark>Look<\/mark> Who’s Talking]
\n —————————–<\/p>\n

[\/crayon]<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

As you can see, this result is much closer to what the user might expect. Note that we are using a class called DisjunctionQuery now, disjunctions are an equivalent to the \u201cOR<\/strong>\u201d operator in SQL.<\/p>\n\n\n\n

What else could we improve to reduce the negative side effect of a fuzzy matching algorithm? Let\u2019s reanalyze our problem to understand if it needs further improvement:<\/p>\n\n\n\n

We already know that fuzzy lookups can produce some unexpected results (e.g. Book -><\/strong> Look, Hook). However, a single term search is usually a terrible query, as it barely gives us a hint of what exactly the user is trying to accomplish.<\/p>\n\n\n\n

Even Google, which has arguably one of the most highly developed fuzzy search algorithms in use, does not know exactly what I\u2019m looking for when I search for \u201ctable<\/strong>\u201d:<\/p>\n\n\n\n

\"google<\/p>\n\n\n\n

So, what is the average length of keywords in a search query? To answer this question, I will show a graph from Rand Fishkin\u2019s 2016 presentation<\/a>. (He is one of the most famous gurus in the SEO world)<\/p>\n\n\n\n

\"keyword<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

According to the graph above, ~80%<\/strong> of the search queries have 2 or more keywords, so let\u2019s try to search for the movie \u201cBlack Book\u201d using fuzziness 1:<\/p>\n\n\n

[crayon lang=”java” decode=”true”]String indexName = “movies_index”;
\nMatchQuery query = SearchQuery.match(“Black Book”).field(“title”).fuzziness(1);
\nSearchQueryResult result = movieRepository.getCouchbaseOperations().getCouchbaseBucket().query(
\nnew SearchQuery(indexName, query).highlight().limit(12));<\/p>\n

printResults(movies);[\/crayon]<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Result:<\/p>\n\n\n

[crayon lang=”default” decode=”true”]1) Black Book
\n score: 0.6946442424065404
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[<mark>Black<\/mark> <mark>Book<\/mark>]
\n —————————–
\n field:title
\n term:black
\n fragment:[<mark>Black<\/mark> <mark>Book<\/mark>]
\n —————————–<\/p>\n

2) Hook
\n score: 0.40139742528039857
\n Hit Locations:
\n field:title
\n term:hook
\n fragment:[<mark>Hook<\/mark>]
\n —————————–<\/p>\n

3) Attack the Block
\n score: 0.2838308365090324
\n Hit Locations:
\n field:title
\n term:block
\n fragment:[Attack the <mark>Block<\/mark>]
\n —————————–<\/p>\n

4) Here Comes the Boom
\n score: 0.2838308365090324
\n Hit Locations:
\n field:title
\n term:boom
\n fragment:[Here Comes the <mark>Boom<\/mark>]
\n —————————–<\/p>\n

5) Look Who’s Talking Too
\n score: 0.25687349813115684
\n Hit Locations:
\n field:title
\n term:look
\n fragment:[<mark>Look<\/mark> Who’s Talking Too]
\n —————————–<\/p>\n

6) Look Who’s Talking
\n score: 0.25687349813115684
\n Hit Locations:
\n field:title
\n term:look
\n fragment:[<mark>Look<\/mark> Who’s Talking]
\n —————————–<\/p>\n

7) Grosse Pointe Blank
\n score: 0.2317469073782136
\n Hit Locations:
\n field:title
\n term:blank
\n fragment:[Grosse Pointe <mark>Blank<\/mark>]
\n —————————–<\/p>\n

8) The Book Thief
\n score: 0.19059065534780495
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> Thief]
\n —————————–<\/p>\n

9) The Book of Eli
\n score: 0.19059065534780495
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Eli]
\n —————————–<\/p>\n

10) The Book of Life
\n score: 0.19059065534780495
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of Life]
\n —————————–<\/p>\n

11) The Jungle Book
\n score: 0.19059065534780495
\n Hit Locations:
\n field:title
\n term:book
\n fragment:[The Jungle <mark>Book<\/mark>]
\n —————————–<\/p>\n

12) Back to the Future
\n score: 0.17061000968368
\n Hit Locations:
\n field:title
\n term:back
\n fragment:[<mark>Back<\/mark> to the Future]
\n —————————–
\n[\/crayon]<\/p>\n\n\n\n

Not bad. We got the movie we were searching for as the first result. However, a disjunction query would still bring a better set of results.<\/p>\n\n\n\n

But still, looks like we have a new nice property here; the side effect of fuzziness matching slightly decreases as the number of keywords increases. A search for \u201cBlack Book<\/strong>\u201d with fuzziness 1<\/strong> can still bring results like back look or lack cook (some combinations with edit distance 1), but these are unlikely to be real movie titles.<\/p>\n\n\n\n

A search for \u201cbook eli<\/strong>\u201d with fuzziness 2 would still bring it as the third result:<\/p>\n\n\n

[crayon lang=”java” decode=”true”]String indexName = “movies_index”;
\nMatchQuery query = SearchQuery.match(“book eli”).field(“title”).fuzziness(2);
\nSearchQueryResult result = movieRepository.getCouchbaseOperations().getCouchbaseBucket().query(
\nnew SearchQuery(indexName, query).highlight().limit(12));<\/p>\n

printResults(movies);[\/crayon]<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n

[crayon lang=”default” decode=”true”]1) Ed Wood
\n score: 0.030723793900031805
\n Hit Locations:
\n field:title
\n term:wood
\n fragment:[<mark>Ed<\/mark> <mark>Wood<\/mark>]
\n —————————–
\n field:title
\n term:ed
\n fragment:[<mark>Ed<\/mark> <mark>Wood<\/mark>]
\n —————————–<\/p>\n

2) Man of Tai Chi
\n score: 0.0271042761982626
\n Hit Locations:
\n field:title
\n term:chi
\n fragment:[Man of <mark>Tai<\/mark> <mark>Chi<\/mark>]
\n —————————–
\n field:title
\n term:tai
\n fragment:[Man of <mark>Tai<\/mark> <mark>Chi<\/mark>]
\n —————————–<\/p>\n

3) The Book of Eli
\n score: 0.02608335441670756
\n Hit Locations:
\n field:title
\n term:eli
\n fragment:[The <mark>Book<\/mark> of <mark>Eli<\/mark>]
\n —————————–
\n field:title
\n term:book
\n fragment:[The <mark>Book<\/mark> of <mark>Eli<\/mark>]
\n —————————–<\/p>\n

4) The Good Lie
\n score: 0.02439822770591834
\n Hit Locations:
\n field:title
\n term:lie
\n fragment:[The <mark>Good<\/mark> <mark>Lie<\/mark>]
\n —————————–
\n field:title
\n term:good
\n fragment:[The <mark>Good<\/mark> <mark>Lie<\/mark>]
\n —————————–
\n[\/crayon]<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

However, as the average English word is 5 letters long, I would NOT<\/strong> recommend using an edit distance bigger than 2 unless the user is searching for long words that are easy to misspell, like \u201cSchwarzenegger\u201d for instance (at least for non-Germans or non-Austrians).<\/p>\n\n\n\n

\u00a0<\/p>\n\n\n\n

Conclusion<\/strong><\/h2>\n\n\n\n

\u00a0<\/p>\n\n\n\n

In this article, we discussed fuzziness matching and how to overcome its major side effect without messing up with its relevance. Mind you, fuzzy matching is just one of the many features which you should take advantage of while implementing a relevant and user-friendly search. We are going to discuss some of them during this series: N-Grams, Stopwords, Steeming, Shingle, Elision. Etc.<\/p>\n\n\n\n

Check out also the Part 1<\/a> and Part 2<\/a> of this series.<\/p>\n\n\n\n

In the meantime, if you have any questions, tweet me at @deniswsrosa<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"

Have you sound yourself asking the question, \u201cWhat is fuzzy matching?\u201d Fuzzy matching allows you to identify non-exact matches of your target item. It is the foundation stone of many search engine frameworks and one of the main reasons why you can get relevant search results even if you have a typo in your query […]<\/p>\n","protected":false},"author":8754,"featured_media":1388,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"inline_featured_image":false,"footnotes":""},"categories":[324,144],"tags":[],"ppma_author":[287],"class_list":["post-1389","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-full-text-search","category-java"],"yoast_head":"\nWhat is Fuzzy Matching? String-Searching Algorithms + Example<\/title>\n<meta name=\"description\" content=\"What is fuzzy matching? Learn different string-searching algorithms you can use and examples of how to overcome major side effect without losing relevance.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.couchbase.com\/blog\/pt\/fuzzy-matching\/\" \/>\n<meta property=\"og:locale\" content=\"pt_BR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"What Is Fuzzy Matching and How to Use It Correctly\" \/>\n<meta property=\"og:description\" content=\"What is fuzzy matching? Learn different string-searching algorithms you can use and examples of how to overcome major side effect without losing relevance.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.couchbase.com\/blog\/pt\/fuzzy-matching\/\" \/>\n<meta property=\"og:site_name\" content=\"The Couchbase Blog\" \/>\n<meta property=\"article:published_time\" content=\"2018-10-09T07:44:26+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/05\/fuzzy-matching-blogbanner.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1575\" \/>\n\t<meta property=\"og:image:height\" content=\"628\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"Denis Rosa, Developer Advocate, Couchbase\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@deniswsrosa\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Denis Rosa, Developer Advocate, Couchbase\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"8 minutos\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/\"},\"author\":{\"name\":\"Denis Rosa, Developer Advocate, Couchbase\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#\\\/schema\\\/person\\\/fe3c5273e805e72a5294611a48f62257\"},\"headline\":\"What Is Fuzzy Matching and How to Use It Correctly\",\"datePublished\":\"2018-10-09T07:44:26+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/\"},\"wordCount\":2352,\"commentCount\":2,\"publisher\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#organization\"},\"image\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/wp-content\\\/uploads\\\/sites\\\/5\\\/2026\\\/05\\\/fuzzy-matching-blogbanner.jpg\",\"articleSection\":[\"Full-Text Search\",\"Java\"],\"inLanguage\":\"pt-BR\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/\",\"url\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/\",\"name\":\"What is Fuzzy Matching? String-Searching Algorithms + Example\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/wp-content\\\/uploads\\\/sites\\\/5\\\/2026\\\/05\\\/fuzzy-matching-blogbanner.jpg\",\"datePublished\":\"2018-10-09T07:44:26+00:00\",\"description\":\"What is fuzzy matching? Learn different string-searching algorithms you can use and examples of how to overcome major side effect without losing relevance.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#breadcrumb\"},\"inLanguage\":\"pt-BR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"pt-BR\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#primaryimage\",\"url\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/wp-content\\\/uploads\\\/sites\\\/5\\\/2026\\\/05\\\/fuzzy-matching-blogbanner.jpg\",\"contentUrl\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/wp-content\\\/uploads\\\/sites\\\/5\\\/2026\\\/05\\\/fuzzy-matching-blogbanner.jpg\",\"width\":1575,\"height\":628},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/fuzzy-matching\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"What Is Fuzzy Matching and How to Use It Correctly\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/\",\"name\":\"The Couchbase Blog\",\"description\":\"Couchbase, the NoSQL Database\",\"publisher\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"pt-BR\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#organization\",\"name\":\"The Couchbase Blog\",\"url\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"pt-BR\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/wp-content\\\/uploads\\\/sites\\\/5\\\/2026\\\/06\\\/logo.svg\",\"contentUrl\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/wp-content\\\/uploads\\\/sites\\\/5\\\/2026\\\/06\\\/logo.svg\",\"width\":\"1024\",\"height\":\"1024\",\"caption\":\"The Couchbase Blog\"},\"image\":{\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/#\\\/schema\\\/person\\\/fe3c5273e805e72a5294611a48f62257\",\"name\":\"Denis Rosa, Developer Advocate, Couchbase\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"pt-BR\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/f8d1f5c13115122cab89d0f229b904480bfe20d3dfbb093fe9734cda5235d419?s=96&d=mm&r=gbe0716f6199cfb09417c92cf7a8fa8d6\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/f8d1f5c13115122cab89d0f229b904480bfe20d3dfbb093fe9734cda5235d419?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/f8d1f5c13115122cab89d0f229b904480bfe20d3dfbb093fe9734cda5235d419?s=96&d=mm&r=g\",\"caption\":\"Denis Rosa, Developer Advocate, Couchbase\"},\"description\":\"Denis Rosa is a Developer Advocate for Couchbase and lives in Munich - Germany. He has a solid experience as a software engineer and speaks fluently Java, Python, Scala and Javascript. Denis likes to write about search, Big Data, AI, Microservices and everything else that would help developers to make a beautiful, faster, stable and scalable app.\",\"sameAs\":[\"https:\\\/\\\/x.com\\\/deniswsrosa\"],\"url\":\"https:\\\/\\\/www.couchbase.com\\\/blog\\\/pt\\\/author\\\/denis-rosa\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"What is Fuzzy Matching? String-Searching Algorithms + Example","description":"What is fuzzy matching? Learn different string-searching algorithms you can use and examples of how to overcome major side effect without losing relevance.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.couchbase.com\/blog\/pt\/fuzzy-matching\/","og_locale":"pt_BR","og_type":"article","og_title":"What Is Fuzzy Matching and How to Use It Correctly","og_description":"What is fuzzy matching? Learn different string-searching algorithms you can use and examples of how to overcome major side effect without losing relevance.","og_url":"https:\/\/www.couchbase.com\/blog\/pt\/fuzzy-matching\/","og_site_name":"The Couchbase Blog","article_published_time":"2018-10-09T07:44:26+00:00","og_image":[{"width":1575,"height":628,"url":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/05\/fuzzy-matching-blogbanner.jpg","type":"image\/jpeg"}],"author":"Denis Rosa, Developer Advocate, Couchbase","twitter_card":"summary_large_image","twitter_creator":"@deniswsrosa","twitter_misc":{"Written by":"Denis Rosa, Developer Advocate, Couchbase","Est. reading time":"8 minutos"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#article","isPartOf":{"@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/"},"author":{"name":"Denis Rosa, Developer Advocate, Couchbase","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/fe3c5273e805e72a5294611a48f62257"},"headline":"What Is Fuzzy Matching and How to Use It Correctly","datePublished":"2018-10-09T07:44:26+00:00","mainEntityOfPage":{"@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/"},"wordCount":2352,"commentCount":2,"publisher":{"@id":"https:\/\/www.couchbase.com\/blog\/#organization"},"image":{"@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#primaryimage"},"thumbnailUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/05\/fuzzy-matching-blogbanner.jpg","articleSection":["Full-Text Search","Java"],"inLanguage":"pt-BR","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/","url":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/","name":"What is Fuzzy Matching? String-Searching Algorithms + Example","isPartOf":{"@id":"https:\/\/www.couchbase.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#primaryimage"},"image":{"@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#primaryimage"},"thumbnailUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/05\/fuzzy-matching-blogbanner.jpg","datePublished":"2018-10-09T07:44:26+00:00","description":"What is fuzzy matching? Learn different string-searching algorithms you can use and examples of how to overcome major side effect without losing relevance.","breadcrumb":{"@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#breadcrumb"},"inLanguage":"pt-BR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/"]}]},{"@type":"ImageObject","inLanguage":"pt-BR","@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#primaryimage","url":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/05\/fuzzy-matching-blogbanner.jpg","contentUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/05\/fuzzy-matching-blogbanner.jpg","width":1575,"height":628},{"@type":"BreadcrumbList","@id":"https:\/\/www.couchbase.com\/blog\/fuzzy-matching\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.couchbase.com\/blog\/"},{"@type":"ListItem","position":2,"name":"What Is Fuzzy Matching and How to Use It Correctly"}]},{"@type":"WebSite","@id":"https:\/\/www.couchbase.com\/blog\/#website","url":"https:\/\/www.couchbase.com\/blog\/","name":"The Couchbase Blog","description":"Couchbase, the NoSQL Database","publisher":{"@id":"https:\/\/www.couchbase.com\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.couchbase.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"pt-BR"},{"@type":"Organization","@id":"https:\/\/www.couchbase.com\/blog\/#organization","name":"The Couchbase Blog","url":"https:\/\/www.couchbase.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"pt-BR","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/06\/logo.svg","contentUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/5\/2026\/06\/logo.svg","width":"1024","height":"1024","caption":"The Couchbase Blog"},"image":{"@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/fe3c5273e805e72a5294611a48f62257","name":"Denis Rosa, Developer Advocate, Couchbase","image":{"@type":"ImageObject","inLanguage":"pt-BR","@id":"https:\/\/secure.gravatar.com\/avatar\/f8d1f5c13115122cab89d0f229b904480bfe20d3dfbb093fe9734cda5235d419?s=96&d=mm&r=gbe0716f6199cfb09417c92cf7a8fa8d6","url":"https:\/\/secure.gravatar.com\/avatar\/f8d1f5c13115122cab89d0f229b904480bfe20d3dfbb093fe9734cda5235d419?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/f8d1f5c13115122cab89d0f229b904480bfe20d3dfbb093fe9734cda5235d419?s=96&d=mm&r=g","caption":"Denis Rosa, Developer Advocate, Couchbase"},"description":"Denis Rosa is a Developer Advocate for Couchbase and lives in Munich - Germany. He has a solid experience as a software engineer and speaks fluently Java, Python, Scala and Javascript. Denis likes to write about search, Big Data, AI, Microservices and everything else that would help developers to make a beautiful, faster, stable and scalable app.","sameAs":["https:\/\/x.com\/deniswsrosa"],"url":"https:\/\/www.couchbase.com\/blog\/pt\/author\/denis-rosa\/"}]}},"acf":[],"authors":[{"term_id":287,"user_id":8754,"is_guest":0,"slug":"denis-rosa","display_name":"Denis Rosa, Developer Advocate, Couchbase","avatar_url":"https:\/\/secure.gravatar.com\/avatar\/?s=96&d=mm&r=g","0":null,"1":"","2":"","3":"","4":"","5":"","6":"","7":"","8":""}],"_links":{"self":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/1389","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/users\/8754"}],"replies":[{"embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/comments?post=1389"}],"version-history":[{"count":0,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/1389\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/media\/1388"}],"wp:attachment":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/media?parent=1389"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/categories?post=1389"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/tags?post=1389"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/ppma_author?post=1389"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}