| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tywanb (0) - 1 freq tywan (1) - 1 freq twang (2) - 13 freq tyran (2) - 1 freq tyan (2) - 2 freq tyrant (2) - 7 freq t'ane (3) - 1 freq want (3) - 1648 freq tland (3) - 3 freq thran (3) - 22 freq twene (3) - 3 freq twink (3) - 1 freq bygang (3) - 1 freq yaan (3) - 9 freq tang (3) - 50 freq kyoab (3) - 1 freq twa's (3) - 6 freq tab (3) - 7 freq twalt (3) - 2 freq wank (3) - 8 freq thans (3) - 3 freq lyan (3) - 29 freq tyoon (3) - 4 freq rowan (3) - 18 freq tyrian (3) - 1 freq |
tywanb (0) - 1 freq tywan (2) - 1 freq twang (3) - 13 freq twine (4) - 21 freq towin (4) - 1 freq twain (4) - 1 freq town (4) - 51 freq twins (4) - 57 freq towen (4) - 2 freq tyowns (4) - 1 freq twanty (4) - 3 freq twink (4) - 1 freq tyrant (4) - 7 freq tyan (4) - 2 freq tyran (4) - 1 freq twun (4) - 1 freq tawny (4) - 3 freq twene (4) - 3 freq tewin (4) - 1 freq twin (4) - 44 freq tean (5) - 1 freq akwant (5) - 2 freq wang (5) - 6 freq gowan (5) - 16 freq tyeen (5) - 2 freq |
SoundEx code - T510 thump - 33 freq thumb - 25 freq tomb - 31 freq tomboy - 1 freq tump - 1 freq tempo - 4 freq temp - 734 freq twa-an-a-hauf - 2 freq thomp - 1 freq thoomb - 6 freq tumb - 1 freq timpo - 1 freq temp- - 7 freq tmv - 1 freq tnv - 1 freq tomb - 1 freq tmmf - 1 freq timehop - 1 freq tenv - 1 freq tywanb - 1 freq tonyip - 1 freq |
MetaPhone code - TWNB tywanb - 1 freq |
TYWANB |
| Time to execute Levenshtein function - 0.238773 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.404514 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.028902 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.038430 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.000914 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. |