| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isteid (0) - 2 freq steid (1) - 64 freq insteid (1) - 309 freq msteid (1) - 1 freq speid (2) - 5 freq steyd (2) - 9 freq insted (2) - 5 freq asleid (2) - 1 freq steir (2) - 22 freq sheid (2) - 1 freq insteidy (2) - 1 freq insteed (2) - 60 freq onsteid (2) - 11 freq steed (2) - 100 freq iste (2) - 1 freq steids (2) - 30 freq steud (2) - 6 freq misted (2) - 2 freq stead (2) - 3 freq intend (2) - 10 freq kisted (2) - 1 freq steil (2) - 28 freq inleid (2) - 1 freq instead (2) - 171 freq esteim (2) - 1 freq |
isteid (0) - 2 freq steid (1) - 64 freq steed (2) - 100 freq stid (2) - 11 freq steud (2) - 6 freq stead (2) - 3 freq staid (2) - 1 freq ostid (2) - 1 freq steidy (2) - 11 freq msteid (2) - 1 freq insteid (2) - 309 freq stuid (2) - 187 freq steyd (2) - 9 freq astrid (3) - 82 freq instid (3) - 2 freq disted (3) - 1 freq seid (3) - 11 freq stein (3) - 22 freq steis (3) - 1 freq stud (3) - 38 freq steady (3) - 57 freq std (3) - 1 freq steyed (3) - 86 freq stood (3) - 425 freq stied (3) - 2 freq |
SoundEx code - I233 i'station - 2 freq isteid - 2 freq |
MetaPhone code - ISTT isteid - 2 freq |
ISTEID |
| Time to execute Levenshtein function - 0.481537 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.708352 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.027383 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.091782 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.000776 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. |