| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doricaubergine (0) - 1 freq doricquine (5) - 1 freq donkey-engine (7) - 1 freq domineerin (7) - 1 freq gaberdine (7) - 1 freq formartine (7) - 1 freq boarderline (7) - 2 freq doricbanter (7) - 1 freq touberin (7) - 1 freq catterline (7) - 3 freq borderline (7) - 4 freq doricana (7) - 2 freq libertine (7) - 2 freq drawer-in (7) - 1 freq moliganterin (7) - 2 freq trickerie (7) - 1 freq daunerin (7) - 30 freq divergin (7) - 1 freq danielfergie (7) - 1 freq porcupine (7) - 1 freq orienteering (7) - 1 freq cautrine (7) - 3 freq scotcatherine (7) - 1 freq orienteerin (7) - 3 freq forgiatherin (7) - 1 freq |
doricaubergine (0) - 1 freq doricquine (8) - 1 freq doricana (10) - 2 freq drawbrig (10) - 1 freq doricbanter (10) - 1 freq divergin (10) - 1 freq drawer-in (10) - 1 freq doctrine (10) - 3 freq deecernin (11) - 1 freq dribblin (11) - 5 freq disbarrin (11) - 1 freq draabore (11) - 1 freq dargin (11) - 7 freq doactorin (11) - 2 freq drochdhuine (11) - 1 freq druggin (11) - 1 freq doricmakaton (11) - 1 freq iceberg (11) - 6 freq draggin (11) - 29 freq deliberatin (11) - 1 freq icebergs (11) - 5 freq doricbananaman (11) - 1 freq discernin (11) - 2 freq recharging (11) - 2 freq drauchtin (11) - 1 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 - TRKBRJN doricaubergine - 1 freq |
DORICAUBERGINE |
| Time to execute Levenshtein function - 0.240277 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.416753 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.029093 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.041483 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.001198 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. |