| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deid-sang (0) - 1 freq mid-sang (2) - 1 freq heidlang (3) - 4 freq mid-spang (3) - 1 freq deid-a (3) - 1 freq sea-sang (3) - 1 freq deid-end (3) - 1 freq deidpan (3) - 1 freq did-an (3) - 1 freq heid-stane (3) - 1 freq heidstane (4) - 14 freq heid-anes (4) - 1 freq heid-on (4) - 1 freq heidsman (4) - 2 freq heidman (4) - 1 freq endlang (4) - 4 freq day-lang (4) - 1 freq desing (4) - 2 freq deidis (4) - 1 freq reidshank (4) - 1 freq dreid-na (4) - 1 freq heidlans (4) - 1 freq yin-yang (4) - 1 freq lee-lang (4) - 4 freq jeidging (4) - 1 freq |
deid-sang (0) - 1 freq mid-sang (3) - 1 freq sea-sang (5) - 1 freq deid-end (5) - 1 freq mid-spang (5) - 1 freq did-an (5) - 1 freq yaird-lang (6) - 1 freq didsna (6) - 1 freq desing (6) - 2 freq deid-duin (6) - 1 freq dissing (6) - 1 freq life-sang (6) - 2 freq deid-saumon (6) - 1 freq day-lang (6) - 1 freq diansangu (6) - 1 freq defusing (6) - 1 freq deid-a (6) - 1 freq heidlang (6) - 4 freq deidpan (6) - 1 freq heid-stane (6) - 1 freq despising (6) - 1 freq declang (7) - 1 freq deid-box (7) - 1 freq dowdoswang (7) - 1 freq deodarant (7) - 1 freq |
SoundEx code - D325 dodgson - 9 freq dudgeon - 1 freq dootsumness - 1 freq detachment - 2 freq detachments - 1 freq dodging - 2 freq dodgin' - 1 freq dodjin - 1 freq dutchmen - 1 freq daith-sentence - 1 freq doutsum - 1 freq deid-saumon - 1 freq dootsome - 1 freq deid-centre - 1 freq dodgan - 1 freq dowdoswang - 1 freq deid-sang - 1 freq deith-knell - 1 freq deid-knowes - 1 freq doutsomelike - 1 freq doutsome-like - 1 freq doutsome - 1 freq dootsum - 4 freq dutchman - 2 freq dodgin - 4 freq detachin - 1 freq didsna - 1 freq deadkings - 1 freq datsun - 3 freq dodgingtherain - 1 freq |
MetaPhone code - TTSNK deid-sang - 1 freq |
DEID-SANG |
| Time to execute Levenshtein function - 0.202408 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.380934 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.027941 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.037204 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.000852 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. |