Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ten-foot-pole (0) - 1 freq ten-foot (5) - 2 freq tenpole (6) - 1 freq scoot-hole (6) - 3 freq tin-foil (7) - 1 freq ten-tae-nine (7) - 1 freq tootle (7) - 1 freq hen-hoose (7) - 13 freq twa-foot (7) - 1 freq bolt-hole (7) - 1 freq benefit-of (7) - 1 freq tea-hoose (7) - 1 freq troot-loch (7) - 1 freq ten-in-a-row (7) - 3 freq pent-pot (7) - 1 freq flag-pole (7) - 1 freq tentfoul (7) - 1 freq foothold (7) - 2 freq teviotdale (7) - 1 freq testosterone (7) - 4 freq oot-come (7) - 1 freq tea-table (7) - 1 freq techno-phobe (7) - 1 freq poot-poot (7) - 2 freq tee-tottal (7) - 1 freq |
ten-foot-pole (0) - 1 freq ten-foot (8) - 2 freq ten-tae-nine (10) - 1 freq tin-foil (10) - 1 freq ten-fit (10) - 1 freq tenpole (10) - 1 freq pent-pot (11) - 1 freq ten-in-a-row (11) - 3 freq tentfoul (11) - 1 freq tee-tottal (11) - 1 freq scoot-hole (11) - 3 freq tinfoyle (11) - 1 freq ten-ton (11) - 1 freq tent-like (11) - 1 freq ten-year-auld (11) - 4 freq twa-foot (11) - 1 freq tea-table (11) - 1 freq benefit-of (11) - 1 freq tentie-like (12) - 1 freq tenstripe (12) - 1 freq tint-pegs (12) - 1 freq tentatively (12) - 4 freq tel-tail (12) - 1 freq tentillie (12) - 2 freq lift-pod (12) - 2 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 - TNFTPL ten-foot-pole - 1 freq |
TEN-FOOT-POLE |
Time to execute Levenshtein function - 0.418797 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.859286 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.082836 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.037840 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.000906 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. |