# Fuzzy string matching + simplest possible spellchecking + hunting for typos and misspellings in Wikipedia

DevFeed: [Fuzzy string matching + simplest possible spellchecking + hunting for typos and misspellings in Wikipedia](<https://devfeed.tech/articles/fuzzy-string-matching-simplest-possible-spellchecking-hunting-for-typos-and-misspellings-in-wikipedia-20561.md>)

Original publisher: [Read original article](<https://yurichev.com/blog/fuzzy_string/>)

Published: 2015-07-22T22:00:00Z

Content type: tutorial

Language: en

Sources: [Dennis Yurichev](<https://devfeed.tech/sources/dennis-yurichev.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Code](<https://devfeed.tech/topics/code.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Python](<https://devfeed.tech/topics/python.md>), [Wiki](<https://devfeed.tech/topics/wiki.md>), [Linux](<https://devfeed.tech/topics/linux.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [article](<https://devfeed.tech/tags/article.md>), [code](<https://devfeed.tech/tags/code.md>), [linux](<https://devfeed.tech/tags/linux.md>), [opensource](<https://devfeed.tech/tags/opensource.md>), [python](<https://devfeed.tech/tags/python.md>), [wikipedia](<https://devfeed.tech/tags/wikipedia.md>), [xml](<https://devfeed.tech/tags/xml.md>)

## AI overview

This tutorial explains fuzzy string matching through Levenshtein distance, which counts insertions, deletions, and replacements needed to transform one string into another. It demonstrates approximate matching with agrep and describes a Python script that uses a Levenshtein distance module to find spelling errors in a Wikipedia dump.

## Source excerpt

Fuzzy string matching + simplest possible spellchecking + hunting for typos and misspellings in Wikipedia