| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revised (0) - 2 freq reised (1) - 1 freq revived (1) - 6 freq revise (1) - 6 freq reviled (1) - 2 freq devised (1) - 1 freq reisted (2) - 1 freq devise (2) - 2 freq revisin (2) - 5 freq revisit (2) - 3 freq retired (2) - 40 freq leised (2) - 9 freq rekksed (2) - 1 freq remixed (2) - 1 freq levied (2) - 1 freq ruised (2) - 5 freq reeined (2) - 1 freq refined (2) - 7 freq reversed (2) - 4 freq reviewed (2) - 7 freq revive (2) - 7 freq refuised (2) - 1 freq recited (2) - 2 freq refused (2) - 40 freq reined (2) - 2 freq |
revised (0) - 2 freq reviled (2) - 2 freq revise (2) - 6 freq devised (2) - 1 freq revived (2) - 6 freq reised (2) - 1 freq raised (3) - 160 freq refaised (3) - 1 freq refused (3) - 40 freq revered (3) - 3 freq reviewed (3) - 7 freq realised (3) - 165 freq raelised (3) - 3 freq advised (3) - 16 freq reversed (3) - 4 freq reesed (3) - 12 freq reived (3) - 5 freq refuised (3) - 1 freq revisit (3) - 3 freq ruised (3) - 5 freq revisin (3) - 5 freq rovies (4) - 1 freq ravaged (4) - 2 freq ryved (4) - 3 freq reives (4) - 2 freq |
SoundEx code - R123 repositorie - 1 freq refused - 40 freq repost - 1 freq robust - 10 freq ravaged - 2 freq refusit - 6 freq revokit - 1 freq rhapsody - 1 freq refuised - 1 freq reveesitin - 1 freq repast - 1 freq rebukit - 3 freq reveesit - 1 freq rebiggit - 2 freq revisitit - 1 freq refected - 1 freq reveisitit - 1 freq reveisit - 1 freq refaised - 1 freq ripest - 1 freq re-biggit - 2 freq refectory - 1 freq revised - 2 freq re-passed - 1 freq reposeetion - 1 freq revisit - 3 freq revsitied - 1 freq revstu - 1 freq rfjtdh - 1 freq refyoozed - 1 freq raiphsadventcalandur - 1 freq rpxjzttv - 2 freq |
MetaPhone code - RFST refused - 40 freq refusit - 6 freq refuised - 1 freq roughest - 3 freq reveesit - 1 freq reveisit - 1 freq refaised - 1 freq revised - 2 freq revisit - 3 freq revstu - 1 freq |
REVISED |
| Time to execute Levenshtein function - 0.586539 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.831714 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.071335 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.038416 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.000784 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. |