| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oncywuty (0) - 1 freq oneywuty (1) - 8 freq onywuty (1) - 1 freq oneywutiy (2) - 1 freq onywuy (2) - 1 freq onywuiy (2) - 2 freq oneywuly (2) - 12 freq oneywury (2) - 1 freq oneywuiy (2) - 23 freq oneywulty (2) - 2 freq onywety (2) - 1 freq onybudy (3) - 6 freq oneywey (3) - 1 freq oneywaiy (3) - 1 freq onywaly (3) - 1 freq onywiy (3) - 2 freq oneybudy (3) - 1 freq onywaiy (3) - 1 freq naywuly (3) - 1 freq onyweiy (3) - 8 freq onywy (3) - 5 freq onyway (3) - 22 freq onywely (3) - 4 freq onywey (3) - 166 freq oneywuliy (3) - 1 freq |
oncywuty (0) - 1 freq onywuty (2) - 1 freq oneywuty (2) - 8 freq onywety (3) - 1 freq oneywutiy (3) - 1 freq oneywulty (4) - 2 freq oneywury (4) - 1 freq oneywuiy (4) - 23 freq onywuy (4) - 1 freq onywuiy (4) - 2 freq oneywuly (4) - 12 freq onywely (5) - 4 freq onyway (5) - 22 freq onywey (5) - 166 freq uncut (5) - 1 freq oncost (5) - 1 freq onywy (5) - 5 freq oneywuliy (5) - 1 freq onyweiy (5) - 8 freq onywaly (5) - 1 freq oneywaiy (5) - 1 freq onywiy (5) - 2 freq oneywey (5) - 1 freq naywuly (5) - 1 freq onywaiy (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 - ONSWT oncywuty - 1 freq |
ONCYWUTY |
| Time to execute Levenshtein function - 0.224913 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.362799 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.029840 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.043522 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.000835 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. |