| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dorisvulva (0) - 7 freq drivel (5) - 4 freq jorisvoorn (5) - 1 freq dissolve (5) - 4 freq dorsal (5) - 1 freq doris's (5) - 3 freq vulva (5) - 1 freq doris (5) - 58 freq risult (5) - 1 freq tarnshula (5) - 1 freq disolve (5) - 1 freq doricquine (5) - 1 freq doricana (5) - 2 freq primula (5) - 2 freq formula (5) - 8 freq dracula (5) - 4 freq gorilla (5) - 7 freq divulge (5) - 1 freq eorisdale (5) - 1 freq derisively (5) - 1 freq briskly (6) - 3 freq derive (6) - 2 freq dowilie (6) - 1 freq brissills (6) - 1 freq joshua (6) - 13 freq |
dorisvulva (0) - 7 freq derisively (6) - 1 freq disolve (7) - 1 freq dorsal (7) - 1 freq dissolve (7) - 4 freq drivel (7) - 4 freq derval (8) - 17 freq eorisdale (8) - 1 freq divulge (8) - 1 freq resolve (8) - 11 freq revolve (8) - 2 freq resslova (8) - 2 freq dursley (8) - 48 freq dervel (8) - 1 freq dracula (8) - 4 freq doris (8) - 58 freq doris's (8) - 3 freq jorisvoorn (8) - 1 freq risult (8) - 1 freq vulva (8) - 1 freq dervil (8) - 1 freq decisively (8) - 1 freq derivative (8) - 3 freq arrivals (9) - 3 freq rivalry (9) - 2 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRSFLF dorisvulva - 7 freq |
DORISVULVA |
| Time to execute Levenshtein function - 0.206069 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.359456 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.029618 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.039392 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.001032 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. |