Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onuised (0) - 1 freq bruised (2) - 15 freq uised (2) - 277 freq yuised (2) - 4 freq snuived (2) - 3 freq unused (2) - 2 freq abuised (2) - 1 freq confuised (2) - 1 freq ruised (2) - 5 freq cruised (2) - 1 freq ontied (2) - 1 freq fluised (2) - 1 freq nursed (2) - 5 freq coursed (3) - 1 freq confided (3) - 3 freq 'uise (3) - 1 freq buises (3) - 1 freq tised (3) - 1 freq obliged (3) - 17 freq used (3) - 663 freq invited (3) - 38 freq haused (3) - 3 freq unwise (3) - 1 freq snuved (3) - 3 freq nurses (3) - 35 freq |
onuised (0) - 1 freq unused (2) - 2 freq nursed (3) - 5 freq ontied (3) - 1 freq nosed (3) - 6 freq ansed (3) - 1 freq ruised (3) - 5 freq aniseed (3) - 3 freq onside (3) - 2 freq abuised (3) - 1 freq uised (3) - 277 freq yuised (3) - 4 freq invied (4) - 1 freq nuisle (4) - 1 freq leised (4) - 9 freq doused (4) - 2 freq inside (4) - 563 freq envied (4) - 3 freq enjosed (4) - 5 freq caused (4) - 78 freq amused (4) - 16 freq untied (4) - 7 freq fused (4) - 5 freq paised (4) - 4 freq onset (4) - 7 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 |
ONUISED |
Time to execute Levenshtein function - 0.238497 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.424948 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.037973 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.050571 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.001151 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. |