| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blurted (0) - 6 freq blurten (1) - 1 freq blurtet (1) - 3 freq blirted (1) - 1 freq blurred (1) - 6 freq elufted (2) - 1 freq lufted (2) - 5 freq lurked (2) - 4 freq alerted (2) - 2 freq bluffed (2) - 1 freq burped (2) - 2 freq hurted (2) - 2 freq clerted (2) - 1 freq buited (2) - 1 freq bloated (2) - 2 freq clarted (2) - 14 freq bleated (2) - 1 freq blarged (2) - 1 freq slurped (2) - 1 freq bluster (2) - 8 freq burled (2) - 2 freq slurred (2) - 7 freq blurt (2) - 1 freq lured (2) - 2 freq blushed (2) - 8 freq |
blurted (0) - 6 freq blirted (1) - 1 freq blurred (2) - 6 freq blurtet (2) - 3 freq blurten (2) - 1 freq blurt (3) - 1 freq blarged (3) - 1 freq clarted (3) - 14 freq blasted (3) - 7 freq blotted (3) - 5 freq bloated (3) - 2 freq blurtit (3) - 2 freq blared (3) - 3 freq blurts (3) - 8 freq bleated (3) - 1 freq clerted (3) - 1 freq alerted (3) - 2 freq bolted (4) - 19 freq blumed (4) - 4 freq boortd (4) - 1 freq bluiter (4) - 1 freq fluted (4) - 1 freq blirtin (4) - 2 freq bleered (4) - 1 freq beleted (4) - 1 freq |
SoundEx code - B463 bleert - 1 freq bleart - 5 freq billiards - 2 freq blawhard - 3 freq blurted - 6 freq blurred - 6 freq bollard - 3 freq blirt - 8 freq blurtet - 3 freq blurten - 1 freq blurts - 8 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 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 - BLRTT blurted - 6 freq blurtet - 3 freq blirted - 1 freq blurtit - 2 freq |
BLURTED |
| Time to execute Levenshtein function - 0.207144 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.360695 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.030196 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.050894 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.000876 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. |