| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blurts (0) - 7 freq blurt (1) - 1 freq blurs (1) - 1 freq plunts (2) - 1 freq bunts (2) - 1 freq blatts (2) - 5 freq busts (2) - 2 freq blurtit (2) - 2 freq buts (2) - 2 freq blurr (2) - 1 freq blue's (2) - 3 freq slurps (2) - 1 freq slurs (2) - 3 freq butts (2) - 4 freq spurts (2) - 1 freq berts (2) - 1 freq clarts (2) - 2 freq bouts (2) - 2 freq blurtet (2) - 3 freq blurry (2) - 7 freq flures (2) - 2 freq burt (2) - 2 freq bluims (2) - 5 freq blunt (2) - 8 freq blurten (2) - 1 freq |
blurts (0) - 7 freq blurs (2) - 1 freq blurt (2) - 1 freq baults (3) - 3 freq blists (3) - 2 freq clarts (3) - 2 freq bloats (3) - 1 freq blurtet (3) - 3 freq blurten (3) - 1 freq bruits (3) - 2 freq blirt (3) - 8 freq blasts (3) - 14 freq birts (3) - 1 freq berts (3) - 1 freq blotts (3) - 1 freq blurted (3) - 6 freq blatts (3) - 5 freq bleats (3) - 1 freq blurtit (3) - 2 freq blowts (3) - 1 freq bolts (4) - 12 freq bourds (4) - 1 freq brits (4) - 5 freq ballots (4) - 1 freq bluto (4) - 1 freq |
SoundEx code - B463 bleert - 1 freq bleart - 5 freq billiards - 1 freq blawhard - 3 freq blurted - 6 freq blurred - 6 freq bollard - 3 freq blirt - 8 freq blurtet - 3 freq blurten - 1 freq blirted - 1 freq blared - 3 freq bleared - 7 freq blewarts - 2 freq bleered - 1 freq bleirit - 2 freq billiart - 1 freq bleary-eyed - 1 freq ballarat - 1 freq blurts - 7 freq bollards - 2 freq bullert - 2 freq blaewort-fu - 1 freq blawhards - 1 freq bleerie-eed - 1 freq billiard - 1 freq blurt - 1 freq blurtit - 2 freq blear-eyed - 1 freq blirtin - 2 freq blairite - 1 freq blairites - 1 freq blairdaff - 1 freq boilyirheed - 1 freq |
MetaPhone code - BLRTS billiards - 1 freq blurts - 7 freq bollards - 2 freq blairites - 1 freq |
BLURTS |
| Time to execute Levenshtein function - 0.341602 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.531347 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.062633 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.040463 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001112 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |