| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adgmbfhvox (0) - 1 freq edimbro (6) - 2 freq bfhio (6) - 1 freq dumbarton (6) - 2 freq dumbo (6) - 2 freq akimbo (6) - 1 freq ambros (6) - 1 freq rdgfoj (6) - 1 freq ambition (6) - 16 freq amfmon (6) - 1 freq davbhoy (6) - 1 freq aimfor (6) - 2 freq egmbdnfo (6) - 1 freq kfgbvo (6) - 1 freq adamrmcvey (6) - 1 freq dumbfuck (6) - 1 freq awmox (6) - 1 freq adamson (6) - 1 freq boombox (6) - 1 freq bdhyfhve (6) - 1 freq egg-box (6) - 1 freq adulthood (6) - 5 freq adambienkov (6) - 1 freq decmbfjco (6) - 1 freq admission (6) - 4 freq |
adgmbfhvox (0) - 1 freq dumbfuck (10) - 1 freq decmbfjco (10) - 1 freq adambienkov (10) - 1 freq egmbdnfo (11) - 1 freq adamrmcvey (11) - 1 freq boombox (11) - 1 freq egg-box (11) - 1 freq davbhoy (11) - 1 freq defmqgvx (11) - 1 freq dumbarton (11) - 2 freq bfhio (11) - 1 freq edimbro (11) - 2 freq bdhyfhve (11) - 1 freq dumbo (11) - 2 freq dumbfounds (11) - 1 freq sgmbyfe (11) - 1 freq odqfeuhv (11) - 1 freq mbwx (12) - 1 freq mhvq (12) - 1 freq rogjnfx (12) - 1 freq dumbbells (12) - 1 freq mgmjbsv (12) - 1 freq vbfax (12) - 1 freq adamchuggy (12) - 2 freq |
SoundEx code - A325 addison - 31 freq addison's - 12 freq attackin' - 1 freq attachment - 3 freq aidgin - 1 freq attackin - 8 freq aitken - 32 freq adjoinin - 2 freq ati'sunbems - 1 freq aitken's - 4 freq addisence - 1 freq audiscense - 1 freq autism - 3 freq aitkin - 1 freq atakan - 1 freq attacking - 4 freq aitkens - 1 freq aodsmegh - 1 freq aitkins - 1 freq aitkens - 1 freq adgmbfhvox - 1 freq addishanel - 1 freq atkinson - 1 freq |
MetaPhone code - ATKMFFKS adgmbfhvox - 1 freq |
ADGMBFHVOX |
| Time to execute Levenshtein function - 0.191618 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.383696 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.027368 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.039733 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.000908 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. |