| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| usetae (0) - 1 freq ustae (1) - 2 freq setee (2) - 1 freq stae (2) - 1 freq haetae (2) - 7 freq untae (2) - 13 freq usta (2) - 1 freq uptae (2) - 22 freq usefal (2) - 1 freq mustae (2) - 6 freq satan (3) - 24 freq seti (3) - 9 freq useful (3) - 24 freq setts (3) - 2 freq heedtae (3) - 1 freq photae (3) - 24 freq husnae (3) - 32 freq weetie (3) - 1 freq stave (3) - 1 freq metre (3) - 13 freq stale (3) - 15 freq unite (3) - 11 freq upsets (3) - 2 freq stue (3) - 11 freq nseva (3) - 1 freq |
usetae (0) - 1 freq ustae (1) - 2 freq stae (2) - 1 freq usta (2) - 1 freq setee (2) - 1 freq staa (3) - 6 freq usty (3) - 1 freq stee (3) - 1 freq stie (3) - 6 freq aste (3) - 1 freq sta (3) - 4 freq sute (3) - 1 freq seat (3) - 277 freq yset (3) - 2 freq eestae (3) - 3 freq site (3) - 100 freq seto (3) - 1 freq stay (3) - 159 freq stue (3) - 11 freq usit (3) - 4 freq sate (3) - 64 freq stye (3) - 11 freq ste (3) - 41 freq seti (3) - 9 freq untae (3) - 13 freq |
SoundEx code - U230 used - 682 freq uised - 281 freq uist - 15 freq use't - 13 freq ucht - 1 freq uissed - 4 freq usit - 4 freq usta - 1 freq ustae - 2 freq uized - 21 freq uisst - 1 freq usty - 1 freq uggit - 1 freq ushed - 1 freq uisit - 7 freq usetae - 1 freq uk-wide - 1 freq used - 1 freq usd - 1 freq uzid - 1 freq uujde - 1 freq |
MetaPhone code - UST used - 682 freq uised - 281 freq uist - 15 freq use't - 13 freq uissed - 4 freq usit - 4 freq usta - 1 freq ustae - 2 freq uized - 21 freq uisst - 1 freq usty - 1 freq uisit - 7 freq usetae - 1 freq used - 1 freq usd - 1 freq uzid - 1 freq |
USETAE |
| Time to execute Levenshtein function - 0.354897 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.595611 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.027525 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.037037 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.000903 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. |