| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revision (0) - 9 freq revisin (1) - 5 freq derision (2) - 8 freq reveisioun (2) - 1 freq devisin (2) - 7 freq revulsion (2) - 3 freq division (2) - 17 freq revisit (2) - 3 freq decision (2) - 87 freq provision (2) - 37 freq elision (2) - 2 freq religion (2) - 56 freq veision (2) - 2 freq vision (2) - 61 freq precision (2) - 5 freq misision (3) - 1 freq sesssion (3) - 1 freq reversin (3) - 4 freq meesion (3) - 1 freq decision' (3) - 1 freq desisien (3) - 1 freq reesin (3) - 1 freq sedition (3) - 7 freq desysion (3) - 1 freq erosion (3) - 6 freq |
revision (0) - 9 freq revisin (1) - 5 freq reveisioun (2) - 1 freq provision (3) - 37 freq veision (3) - 2 freq vision (3) - 61 freq eurovision (3) - 4 freq revisit (3) - 3 freq devisin (3) - 7 freq division (3) - 17 freq revulsion (3) - 3 freq reason (4) - 324 freq reasin (4) - 2 freq resin (4) - 6 freq roisin (4) - 2 freq proveision (4) - 6 freq diveision (4) - 1 freq veisioun (4) - 2 freq raisin (4) - 33 freq advisin (4) - 3 freq reveesions (4) - 1 freq realisin (4) - 14 freq revvin (4) - 1 freq revise (4) - 6 freq davison (4) - 1 freq |
SoundEx code - R125 revisin - 5 freq refusin - 16 freq rubicon - 3 freq revision - 9 freq robson - 14 freq rebiggin - 4 freq revisionist - 1 freq reveisioun - 1 freq robeson - 1 freq refusing - 5 freq ravishment - 1 freq €˜ravishin - 1 freq reveesions - 1 freq robson's - 1 freq robbycameron - 3 freq robgmacfarlane - 6 freq rufusmufasa - 1 freq rovcmuaxfs - 1 freq |
MetaPhone code - RFXN revision - 9 freq reveisioun - 1 freq €˜ravishin - 1 freq |
REVISION |
| Time to execute Levenshtein function - 0.195085 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.346938 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.028081 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.036993 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.000914 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. |