| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aff-blawin (0) - 1 freq aff-drawn (3) - 1 freq aff-fawins (3) - 2 freq aff-pittin (4) - 4 freq flawin (4) - 1 freq aff-han (4) - 1 freq aff-takkin (4) - 1 freq a-flowin (4) - 1 freq pow-clawin (4) - 1 freq late-blawn (4) - 1 freq blawin (4) - 90 freq win-blawn (4) - 1 freq half-blin (4) - 1 freq a-glowin (4) - 1 freq heidblawin (4) - 1 freq mindblawin (4) - 1 freq mind-blawin (4) - 1 freq hauf-blin (4) - 1 freq aff-chance (5) - 1 freq aff-stage (5) - 3 freq abatin (5) - 1 freq a-birlin (5) - 1 freq abain (5) - 23 freq fawin (5) - 88 freq slawin (5) - 2 freq |
aff-blawin (0) - 1 freq aff-drawn (5) - 1 freq win-blawn (6) - 1 freq late-blawn (6) - 1 freq hauf-blin (6) - 1 freq aff-fawins (6) - 2 freq half-blin (7) - 1 freq heidblawin (7) - 1 freq mindblawin (7) - 1 freq mind-blawin (7) - 1 freq full-blawn (7) - 1 freq a-glowin (7) - 1 freq blawin (7) - 90 freq flawin (7) - 1 freq aff-han (7) - 1 freq aff-takkin (7) - 1 freq pow-clawin (7) - 1 freq aff-pittin (7) - 4 freq a-flowin (7) - 1 freq blawen (8) - 1 freq baffy-blessin (8) - 1 freq flowin (8) - 22 freq affable (8) - 1 freq eff-in (8) - 1 freq off-beat (8) - 1 freq |
SoundEx code - A145 aiblins - 282 freq 'aiblins - 8 freq a-plenty - 4 freq aplentie - 2 freq appeelin - 1 freq a-flowin - 1 freq affluence - 1 freq applyin - 5 freq appealin - 6 freq avalanche - 7 freq abilene - 2 freq aflame - 4 freq aplenty - 6 freq abuliments - 1 freq appliances - 2 freq applying - 8 freq aiblains - 3 freq aff-limits - 2 freq affline - 2 freq aff-blawin - 1 freq appliein - 2 freq affluent - 5 freq appealing - 1 freq €œaiblins - 1 freq aplomb - 1 freq applemanyebastard - 1 freq aipplemannie - 1 freq applemak - 2 freq affaloon - 2 freq appalling - 2 freq avalonbunny - 2 freq appallin - 2 freq |
MetaPhone code - AFBLWN aff-blawin - 1 freq |
AFF-BLAWIN |
| Time to execute Levenshtein function - 0.237139 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.385670 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.034570 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.037458 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.000951 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. |