| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oanside (0) - 1 freq onside (1) - 2 freq downside (2) - 2 freq bakside (2) - 2 freq outside (2) - 87 freq roadside (2) - 14 freq onsite (2) - 1 freq daneside (2) - 1 freq doonside (2) - 4 freq ïnside (2) - 2 freq langside (2) - 15 freq benside (2) - 1 freq sandside (2) - 1 freq tayside (2) - 2 freq mansie (2) - 22 freq oantie (2) - 1 freq ootside (2) - 617 freq gansie (2) - 3 freq offside (2) - 3 freq launside (2) - 1 freq faside (2) - 1 freq donside (2) - 4 freq oanline (2) - 36 freq baeside (2) - 1 freq aside (2) - 471 freq |
oanside (0) - 1 freq onside (1) - 2 freq inside (2) - 563 freq donside (3) - 4 freq ootside (3) - 617 freq faside (3) - 1 freq aside (3) - 471 freq insyde (3) - 1 freq ensyde (3) - 4 freq tayside (3) - 2 freq baeside (3) - 1 freq launside (3) - 1 freq onsite (3) - 1 freq daneside (3) - 1 freq doonside (3) - 4 freq ansed (3) - 1 freq outside (3) - 87 freq benside (3) - 1 freq episide (4) - 1 freq iside (4) - 1 freq ansir (4) - 1 freq seaside (4) - 10 freq eeside (4) - 1 freq upside (4) - 37 freq outsyde (4) - 2 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 - ONST onset - 7 freq oanside - 1 freq onsite - 1 freq onside - 2 freq 'onest - 1 freq oneste - 9 freq on-said - 1 freq onuised - 1 freq |
OANSIDE |
| Time to execute Levenshtein function - 0.259418 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.441097 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.035587 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.043763 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.000819 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. |