| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| totiest (0) - 1 freq tottiest (1) - 6 freq holiest (2) - 2 freq tories' (2) - 1 freq pokiest (2) - 1 freq totes (2) - 1 freq noties (2) - 2 freq howtiest (2) - 1 freq totties (2) - 8 freq totier (2) - 1 freq hottest (2) - 4 freq dowiest (2) - 1 freq foties (2) - 6 freq totie (2) - 18 freq tories (2) - 117 freq ootmest (2) - 1 freq tastiest (2) - 2 freq notes (3) - 117 freq patient (3) - 60 freq foaties (3) - 1 freq boies (3) - 1 freq hottert (3) - 1 freq govies (3) - 1 freq tittert (3) - 1 freq polist (3) - 4 freq |
totiest (0) - 1 freq tottiest (2) - 6 freq attest (3) - 2 freq totes (3) - 1 freq ootmest (3) - 1 freq tastiest (3) - 2 freq hottest (3) - 4 freq artist (4) - 27 freq notyst (4) - 2 freq fitest (4) - 1 freq tottie (4) - 107 freq jatest (4) - 1 freq totsy (4) - 1 freq taest (4) - 1 freq titlet (4) - 1 freq tost (4) - 2 freq noteyst (4) - 2 freq test (4) - 146 freq ttish (4) - 1 freq totety (4) - 1 freq detest (4) - 2 freq traist (4) - 12 freq wettest (4) - 1 freq taist (4) - 2 freq toast (4) - 90 freq |
SoundEx code - T323 thatched - 4 freq tottiest - 6 freq twitched - 7 freq thatch't - 1 freq tidesedge - 1 freq titch't - 1 freq titched - 2 freq th'ootside - 1 freq twa-edged - 1 freq totiest - 1 freq titcht - 1 freq tweetiesheed - 1 freq too-tight - 1 freq toadstool - 1 freq tweetstreetocc - 8 freq |
MetaPhone code - TTST tottiest - 6 freq deduced - 1 freq totiest - 1 freq detest - 2 freq |
TOTIEST |
| Time to execute Levenshtein function - 0.335606 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.574505 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.066867 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.053002 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.001171 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. |