| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tentless (0) - 7 freq tentles (1) - 2 freq stentless (1) - 2 freq enless (2) - 12 freq cenless (2) - 1 freq meatless (2) - 1 freq pyntless (2) - 8 freq gentles (2) - 1 freq fendless (2) - 1 freq tentlessly (2) - 6 freq endless (2) - 51 freq hertless (2) - 11 freq tentiness (2) - 1 freq thenkless (2) - 1 freq tuneless (2) - 2 freq teenless (2) - 1 freq restless (2) - 15 freq teetles (2) - 1 freq heatless (2) - 1 freq doutless (3) - 4 freq wanless (3) - 3 freq feckless (3) - 14 freq tents (3) - 22 freq wyndless (3) - 1 freq songless (3) - 1 freq |
tentless (0) - 7 freq tentles (2) - 2 freq stentless (2) - 2 freq pyntless (3) - 8 freq tentiness (3) - 1 freq tuneless (3) - 2 freq teenless (3) - 1 freq tentlessly (3) - 6 freq heatless (4) - 1 freq tentlesslie (4) - 3 freq knotless (4) - 3 freq pointless (4) - 10 freq tasteless (4) - 4 freq countless (4) - 11 freq restless (4) - 15 freq coontless (4) - 23 freq teetles (4) - 1 freq gentles (4) - 1 freq cenless (4) - 1 freq enless (4) - 12 freq fendless (4) - 1 freq meatless (4) - 1 freq thenkless (4) - 1 freq hertless (4) - 11 freq endless (4) - 51 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 - TNTLS tentless - 7 freq tantalus - 1 freq tentles - 2 freq dentals - 1 freq tantalise - 1 freq |
TENTLESS |
| Time to execute Levenshtein function - 0.205716 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.575971 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.028865 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.076576 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.001164 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. |