| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ten-fit (0) - 1 freq ten-foot (2) - 2 freq tentit (2) - 8 freq re-fit (2) - 1 freq benefit (2) - 73 freq twa-fit (2) - 1 freq then-bit (2) - 1 freq benifit (2) - 1 freq tendit (2) - 19 freq tentie (3) - 38 freq tengist (3) - 5 freq kensit (3) - 1 freq tintit (3) - 3 freq three-fit (3) - 2 freq sax-fit (3) - 1 freq stendit (3) - 2 freq benifits (3) - 1 freq pentit (3) - 44 freq tenent (3) - 2 freq tensin (3) - 1 freq pennit (3) - 1 freq denotit (3) - 1 freq trenchit (3) - 1 freq tnckit (3) - 1 freq stennit (3) - 1 freq |
ten-fit (0) - 1 freq ten-foot (2) - 2 freq twa-fit (3) - 1 freq benifit (4) - 1 freq tin-foil (4) - 1 freq then-bit (4) - 1 freq tendit (4) - 19 freq re-fit (4) - 1 freq benefit (4) - 73 freq tentit (4) - 8 freq ten-ton (5) - 1 freq 'f-fit (5) - 1 freq tentfu (5) - 1 freq six-fit (5) - 2 freq tennent (5) - 2 freq tenant (5) - 14 freq tea-pat (5) - 1 freq on-it (5) - 2 freq tent (5) - 460 freq infit (5) - 1 freq techno-fit (5) - 1 freq unfit (5) - 1 freq taen-in (5) - 1 freq taen-lik (5) - 1 freq tentfou (5) - 1 freq |
SoundEx code - T513 temptation - 22 freq tempt - 9 freq then-bit - 1 freq tempted - 23 freq thumped - 5 freq tounfuit - 2 freq temptit - 11 freq temptt - 1 freq temptin - 11 freq thumbit - 1 freq ten-foot - 2 freq tempit - 11 freq temptet - 1 freq tempter - 1 freq thumpeth - 1 freq timptations - 1 freq timptation's - 1 freq timptation - 1 freq temptan - 2 freq temptations - 2 freq tempts - 2 freq temptautioun - 1 freq thumpit - 2 freq ten-fit - 1 freq temptised - 1 freq tinpot - 3 freq tamped - 1 freq ten-foot-pole - 1 freq tempting - 3 freq temptress - 1 freq tenfeettallabdn - 1 freq |
MetaPhone code - TNFT tounfuit - 2 freq tonight - 60 freq ten-foot - 2 freq ten-fit - 1 freq donaghadee - 5 freq danight - 9 freq |
TEN-FIT |
| Time to execute Levenshtein function - 0.266091 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.380583 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.027669 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.039979 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.001234 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. |