Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
teaspoon (0) - 6 freq teaspoons (1) - 1 freq teaspuin (2) - 1 freq tayspoon (2) - 2 freq earspoon (2) - 1 freq teaspeen (2) - 1 freq teason (2) - 2 freq sassoon (3) - 1 freq tension (3) - 32 freq teamleon (3) - 1 freq tampson (3) - 1 freq tea-room (3) - 4 freq respon (3) - 1 freq tearoom (3) - 3 freq teapot (3) - 10 freq harpoon (3) - 8 freq teasin (3) - 9 freq treason (3) - 14 freq season (3) - 118 freq reason (3) - 315 freq teapin (3) - 1 freq weapon (3) - 18 freq earspoons (3) - 1 freq tapdoon (3) - 1 freq easton (3) - 3 freq |
teaspoon (0) - 6 freq teaspoons (2) - 1 freq tayspoon (2) - 2 freq teaspeen (2) - 1 freq teaspuin (2) - 1 freq teason (3) - 2 freq earspoon (3) - 1 freq spoon (4) - 55 freq teapin (4) - 1 freq teasin (4) - 9 freq respon (4) - 1 freq toastin (5) - 2 freq thespian (5) - 1 freq gaspan (5) - 1 freq taison (5) - 1 freq traepin (5) - 2 freq tea-spune (5) - 1 freq aspen (5) - 9 freq gespan (5) - 1 freq tappin (5) - 20 freq respin (5) - 1 freq respone (5) - 1 freq spon (5) - 1 freq tampan (5) - 1 freq raspin (5) - 5 freq |
SoundEx code - T215 teaspoon - 6 freq tea-spune - 1 freq tax-fundit - 1 freq tesponsible - 1 freq teaspoons - 1 freq tax-haven - 1 freq tayspoon - 2 freq taespön - 1 freq tcyaavin - 1 freq tcyauvin - 1 freq teaspuin - 1 freq teaspuinfus - 1 freq teaspeen - 1 freq tcqpmidikc - 1 freq thespian - 1 freq |
MetaPhone code - TSPN teaspoon - 6 freq tea-spune - 1 freq dispone - 2 freq tayspoon - 2 freq taespön - 1 freq teaspuin - 1 freq €œdispone - 1 freq teaspeen - 1 freq |
TEASPOON |
Time to execute Levenshtein function - 0.209348 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.394389 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.027338 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.039235 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.000815 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. |