| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revsitied (0) - 1 freq resigned (3) - 14 freq veesited (3) - 7 freq revisitit (3) - 1 freq veisited (3) - 3 freq densitie (3) - 1 freq resiled (3) - 2 freq revived (3) - 6 freq reviewed (3) - 7 freq reverted (3) - 1 freq realities (3) - 9 freq recited (3) - 2 freq versities (3) - 4 freq reestled (3) - 1 freq reviled (3) - 2 freq densities (3) - 1 freq resisted (3) - 2 freq reunited (3) - 1 freq revised (3) - 2 freq realitie (3) - 2 freq rested (3) - 12 freq reisted (3) - 1 freq desisien (4) - 1 freq roustie (4) - 4 freq resile (4) - 1 freq |
revsitied (0) - 1 freq revised (4) - 2 freq resisted (4) - 2 freq reverted (4) - 1 freq rested (4) - 12 freq veisited (4) - 3 freq veesited (4) - 7 freq revisitit (4) - 1 freq reisted (4) - 1 freq roasted (5) - 5 freq rowsted (5) - 6 freq riveted (5) - 1 freq revstu (5) - 1 freq rousted (5) - 2 freq visited (5) - 23 freq revisit (5) - 3 freq rusted (5) - 5 freq reveisitit (5) - 1 freq reveesitin (5) - 1 freq roosted (5) - 2 freq reveisit (5) - 1 freq vested (5) - 2 freq reviewed (5) - 7 freq resiled (5) - 2 freq reunited (5) - 1 freq |
SoundEx code - R123 repositorie - 1 freq refused - 41 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 - RFSTT revisitit - 1 freq reveisitit - 1 freq revsitied - 1 freq |
REVSITIED |
| Time to execute Levenshtein function - 0.422597 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 - 1.004894 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.085379 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.104262 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.000909 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. |