| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| timehop (0) - 1 freq time's (3) - 27 freq timewarp (3) - 1 freq timeous (3) - 7 freq times' (3) - 4 freq somehou (3) - 20 freq 'im-how (3) - 1 freq timor (3) - 1 freq time (3) - 1 freq timed (3) - 4 freq time-in (3) - 1 freq time' (3) - 6 freq timely (3) - 4 freq timpo (3) - 1 freq bishop (3) - 15 freq times (3) - 911 freq timers (3) - 5 freq vimeo (3) - 2 freq time'll (3) - 3 freq timer (3) - 6 freq time-oot (3) - 2 freq timerous (3) - 2 freq somehow (3) - 71 freq time- (3) - 2 freq somehoo (3) - 31 freq |
timehop (0) - 1 freq toyshop (4) - 1 freq timpo (4) - 1 freq somehoo (5) - 31 freq time-oot (5) - 2 freq time- (5) - 2 freq somehow (5) - 71 freq time (5) - 5878 freq timerous (5) - 2 freq tie-up (5) - 1 freq hiphop (5) - 1 freq temp (5) - 734 freq imho (5) - 4 freq timex (5) - 5 freq time (5) - 1 freq timer (5) - 6 freq timeen (5) - 1 freq somehou (5) - 20 freq tempo (5) - 4 freq time (5) - 1 freq times' (5) - 4 freq timeous (5) - 7 freq time's (5) - 27 freq timewarp (5) - 1 freq timed (5) - 4 freq |
SoundEx code - T510 thump - 32 freq thumb - 24 freq tomb - 31 freq tomboy - 1 freq tempo - 4 freq temp - 734 freq twa-an-a-hauf - 2 freq thomp - 1 freq thoomb - 6 freq tumb - 1 freq timpo - 1 freq temp- - 7 freq tmv - 1 freq tnv - 1 freq tomb - 1 freq tmmf - 1 freq timehop - 1 freq tenv - 1 freq tywanb - 1 freq tonyip - 1 freq |
MetaPhone code - TMHP timehop - 1 freq |
TIMEHOP |
| Time to execute Levenshtein function - 0.197728 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.344827 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.027592 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.037251 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.000846 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. |