| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tentily (0) - 22 freq gentily (1) - 4 freq 'tentily (1) - 1 freq dentily (1) - 1 freq tentilie (2) - 8 freq tensely (2) - 2 freq lentils (2) - 2 freq tentive (2) - 1 freq dently (2) - 1 freq nestily (2) - 1 freq entity (2) - 17 freq tenting (2) - 1 freq tentin (2) - 10 freq teitil (2) - 6 freq ently (2) - 2 freq testify (2) - 3 freq centile (2) - 1 freq tentie (2) - 38 freq tentit (2) - 8 freq gentile (2) - 3 freq teitils (2) - 2 freq tenty (2) - 6 freq fently (2) - 1 freq lentil (2) - 5 freq hertily (2) - 2 freq |
tentily (0) - 22 freq gentily (2) - 4 freq dentily (2) - 1 freq tentilie (2) - 8 freq 'tentily (2) - 1 freq centile (3) - 1 freq textile (3) - 2 freq tentie (3) - 38 freq ently (3) - 2 freq teitil (3) - 6 freq gently (3) - 83 freq gentile (3) - 3 freq tentit (3) - 8 freq fently (3) - 1 freq tentive (3) - 1 freq tensely (3) - 2 freq dently (3) - 1 freq lentil (3) - 5 freq cantily (3) - 12 freq tenty (3) - 6 freq tentin (3) - 10 freq ontil (4) - 53 freq turtil (4) - 1 freq tented (4) - 1 freq daintily (4) - 2 freq |
SoundEx code - T534 tentless - 7 freq tantalisingly - 3 freq timidly - 16 freq tentlessly - 6 freq tentily - 22 freq tantalisin - 4 freq tantalisin-like - 1 freq 'tentily - 1 freq tantalus - 1 freq tentles - 2 freq tantalizin - 2 freq tentilie - 8 freq tindel-box - 14 freq tentlesslie - 3 freq tentless-like - 1 freq tentie-like - 1 freq tentillie - 2 freq tent-like - 1 freq tentie-lik - 2 freq tantallon - 2 freq tantalise - 1 freq tentilie-craftit - 1 freq tindal - 4 freq twinatlantic - 1 freq |
MetaPhone code - TNTL tentily - 22 freq 'tentily - 1 freq daintily - 2 freq tentilie - 8 freq dental - 7 freq 'dental - 1 freq tentillie - 2 freq tindal - 4 freq dently - 1 freq dentily - 1 freq |
TENTILY |
| Time to execute Levenshtein function - 0.176710 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.345352 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.027548 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.037041 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.000900 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. |