| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| talent (0) - 65 freq talents (1) - 15 freq ladent (2) - 1 freq silent (2) - 144 freq tranent (2) - 28 freq tale's (2) - 7 freq talkt (2) - 1 freq taeen (2) - 1 freq patent (2) - 39 freq talkit (2) - 2 freq tailen (2) - 1 freq talbot (2) - 4 freq talons (2) - 5 freq talent's (2) - 1 freq tae't (2) - 7 freq glent (2) - 30 freq lent (2) - 38 freq lament (2) - 22 freq taken (2) - 122 freq alen (2) - 1 freq ta'en (2) - 36 freq tant (2) - 1 freq relent (2) - 5 freq tent (2) - 460 freq tallest (2) - 6 freq |
talent (0) - 65 freq talents (2) - 15 freq blent (3) - 6 freq talentid (3) - 1 freq tailend (3) - 1 freq tyle't (3) - 1 freq relent (3) - 5 freq taunt (3) - 2 freq tenent (3) - 2 freq alunt (3) - 1 freq taint (3) - 2 freq talented (3) - 8 freq salient (3) - 2 freq atalanta (3) - 41 freq tant (3) - 1 freq talentit (3) - 6 freq tent (3) - 460 freq silent (3) - 144 freq talkit (3) - 2 freq talbot (3) - 4 freq talons (3) - 5 freq tailen (3) - 1 freq glent (3) - 30 freq talkt (3) - 1 freq lent (3) - 38 freq |
SoundEx code - T453 tholemoody - 1 freq talent - 65 freq talents - 15 freq talent's - 1 freq talentit - 6 freq taloned - 1 freq thailand - 7 freq talented - 8 freq tholemuidie-lik - 1 freq tland - 3 freq tailend - 1 freq tallentit - 1 freq tholemoodie - 1 freq talentid - 1 freq |
MetaPhone code - TLNT talent - 65 freq taloned - 1 freq tland - 3 freq tailend - 1 freq dalnoid - 6 freq |
TALENT |
| Time to execute Levenshtein function - 0.187815 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.342644 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.038166 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.038240 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.001002 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. |