| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blirt (0) - 8 freq birt (1) - 1 freq blint (1) - 3 freq beirt (1) - 1 freq blurt (1) - 1 freq blist (1) - 32 freq flirt (1) - 6 freq puirt (2) - 2 freq slipt (2) - 6 freq blisst (2) - 19 freq virt (2) - 1 freq bleat (2) - 5 freq bint (2) - 10 freq liht (2) - 2 freq scirt (2) - 1 freq glert (2) - 1 freq birn (2) - 17 freq lliot (2) - 1 freq beilt (2) - 1 freq dirt (2) - 70 freq burt (2) - 2 freq eliot (2) - 1 freq bair (2) - 1 freq beir (2) - 18 freq buir (2) - 10 freq |
blirt (0) - 8 freq blurt (1) - 1 freq bleert (2) - 1 freq flirt (2) - 6 freq bleirit (2) - 2 freq bleart (2) - 5 freq blist (2) - 32 freq blint (2) - 3 freq beirt (2) - 1 freq birt (2) - 1 freq blat (3) - 37 freq blirry (3) - 1 freq bliree (3) - 1 freq blent (3) - 6 freq beart (3) - 1 freq blast (3) - 72 freq kulirt (3) - 1 freq blur (3) - 14 freq blait (3) - 2 freq blurr (3) - 1 freq blunt (3) - 9 freq blairite (3) - 1 freq blekt (3) - 1 freq bleet (3) - 2 freq clort (3) - 3 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 - BLRT bleert - 1 freq bleart - 5 freq blurred - 6 freq bollard - 3 freq blirt - 8 freq blared - 3 freq bleared - 7 freq bleered - 1 freq bleirit - 2 freq billiart - 1 freq ballarat - 1 freq bullert - 2 freq bleerie-eed - 1 freq billiard - 1 freq blurt - 1 freq blairite - 1 freq |
BLIRT |
| Time to execute Levenshtein function - 0.199265 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.373735 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.027996 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.037240 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.000871 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. |