| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onsteid (0) - 11 freq on-steid (1) - 11 freq insteid (1) - 318 freq isteid (2) - 2 freq insteidy (2) - 1 freq instead (2) - 174 freq steid (2) - 65 freq ensteyd (2) - 2 freq ostid (2) - 1 freq unsteik (2) - 1 freq insteed (2) - 60 freq instid (2) - 2 freq insted (2) - 5 freq msteid (2) - 1 freq onsein (2) - 2 freq bested (3) - 2 freq monsters (3) - 15 freq misted (3) - 2 freq wasted (3) - 24 freq ontied (3) - 1 freq on-said (3) - 1 freq ansed (3) - 1 freq oxsters (3) - 8 freq hysted (3) - 3 freq noted (3) - 23 freq |
onsteid (0) - 11 freq insteid (1) - 318 freq insteed (2) - 60 freq instid (2) - 2 freq ensteyd (2) - 2 freq insted (2) - 5 freq insteidy (2) - 1 freq instead (2) - 174 freq on-steid (2) - 11 freq steid (3) - 65 freq noosted (3) - 1 freq insteada (3) - 1 freq unsteady (3) - 3 freq nested (3) - 1 freq instaed (3) - 4 freq unsteik (3) - 1 freq ostid (3) - 1 freq msteid (3) - 1 freq isteid (3) - 2 freq rousted (4) - 2 freq hoasted (4) - 7 freq disted (4) - 1 freq tested (4) - 21 freq fisted (4) - 1 freq tasted (4) - 20 freq |
SoundEx code - O523 onygates - 4 freq onset - 7 freq oanside - 1 freq oncywuty - 1 freq onsite - 1 freq onside - 2 freq onicthin - 1 freq onstage - 7 freq 'onest - 1 freq oneste - 9 freq oniegates - 15 freq ongaed - 2 freq oniegait - 2 freq onygaits - 7 freq on-stapp't - 1 freq onsatisfactorie- - 1 freq onsatisfactorie - 1 freq on-said - 1 freq omnigaddrum - 2 freq 'omnigaddrum' - 1 freq omnigadderum - 1 freq onsetters - 1 freq onuised - 1 freq onstaundin - 2 freq onigate - 1 freq on-steid - 11 freq onsteid - 11 freq onygate - 1 freq onsets - 2 freq omucket - 1 freq onestepbayond - 2 freq oneagt - 1 freq |
MetaPhone code - ONSTT on-steid - 11 freq onsteid - 11 freq |
ONSTEID |
| Time to execute Levenshtein function - 0.204712 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.386119 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.029892 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.041094 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.001215 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. |