| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| on-steid (0) - 11 freq onsteid (1) - 11 freq on-said (2) - 1 freq insteid (2) - 309 freq ostid (3) - 1 freq insted (3) - 5 freq instead (3) - 171 freq oneste (3) - 9 freq insteed (3) - 60 freq waw-steid (3) - 1 freq msteid (3) - 1 freq isteid (3) - 2 freq nested (3) - 1 freq wabsteid (3) - 76 freq oresteia (3) - 1 freq steid (3) - 64 freq on-gaein (3) - 1 freq wab-steid (3) - 7 freq ensteyd (3) - 2 freq insteidy (3) - 1 freq bedsteid (3) - 1 freq unsteik (3) - 1 freq onsein (3) - 2 freq instid (3) - 2 freq boasted (4) - 1 freq |
on-steid (0) - 11 freq onsteid (2) - 11 freq insteid (3) - 309 freq on-said (3) - 1 freq nested (4) - 1 freq ensteyd (4) - 2 freq insteidy (4) - 1 freq insteed (4) - 60 freq instid (4) - 2 freq instead (4) - 171 freq insted (4) - 5 freq waw-steid (5) - 1 freq infested (5) - 1 freq unsteady (5) - 3 freq na-said (5) - 1 freq ingested (5) - 2 freq insisted (5) - 24 freq instaed (5) - 4 freq enlisted (5) - 1 freq insteada (5) - 1 freq unsteik (5) - 1 freq ostid (5) - 1 freq oneste (5) - 9 freq wabsteid (5) - 76 freq bedsteid (5) - 1 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 |
ON-STEID |
| Time to execute Levenshtein function - 0.365448 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.596115 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.028268 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.072152 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.000857 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. |