| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| screivar (0) - 27 freq screiver (1) - 8 freq skreivar (1) - 18 freq screivars (1) - 43 freq screever (2) - 1 freq screive (2) - 70 freq screivit (2) - 83 freq screives (2) - 7 freq skreivars (2) - 16 freq screivar's (2) - 1 freq skreiver (2) - 3 freq screived (2) - 39 freq screivers (2) - 35 freq screivin (2) - 67 freq screev (3) - 1 freq screigh (3) - 2 freq screid (3) - 8 freq scriba (3) - 1 freq reiver (3) - 22 freq scrived (3) - 3 freq scrive (3) - 1 freq screich (3) - 18 freq steiver (3) - 1 freq screiving (3) - 3 freq scriever (3) - 60 freq |
screivar (0) - 27 freq screiver (1) - 8 freq screivars (2) - 43 freq screever (2) - 1 freq skreivar (2) - 18 freq scriever (3) - 60 freq screivers (3) - 35 freq screivin (3) - 67 freq skreiver (3) - 3 freq screived (3) - 39 freq screive (3) - 70 freq screives (3) - 7 freq screivit (3) - 83 freq screeved (4) - 2 freq scrievan (4) - 1 freq screeve (4) - 1 freq scriven (4) - 2 freq secretar (4) - 29 freq screevit (4) - 3 freq skreever (4) - 4 freq screevin (4) - 7 freq skrievar (4) - 3 freq scrievars (4) - 1 freq scrivin (4) - 3 freq scrived (4) - 3 freq |
SoundEx code - S616 surprise - 210 freq scrapyaird - 2 freq surprised - 153 freq surpreese - 11 freq skreivar - 18 freq skreivars - 16 freq surprisingly - 8 freq surpreise - 6 freq surpreesed - 7 freq scriever - 60 freq scarpered - 3 freq surpreeze - 1 freq scrievers - 25 freq surprisinly - 4 freq scarper - 2 freq surprises - 11 freq scraper - 2 freq surprisin - 17 freq skreever - 4 freq screever - 1 freq screivers - 35 freq shairper - 3 freq serperate - 1 freq screivers' - 1 freq sirprise - 5 freq sirprises - 1 freq surprisan - 1 freq scriever's - 2 freq surprisinlie - 4 freq screiver - 8 freq scarborough - 1 freq surfer - 1 freq sirprisin - 2 freq sirprised - 5 freq sirprisinly - 1 freq screivars - 43 freq screivar - 27 freq screivar's - 1 freq surpreisin - 1 freq surpreised - 5 freq skreivar's - 1 freq sairvers - 1 freq surprising - 7 freq sair-braithed - 1 freq sharp-hertit - 1 freq sair-affrontit - 1 freq sherper - 2 freq surprenant - 1 freq servers - 1 freq skreiver - 3 freq srebrenisa - 1 freq skrievar - 3 freq scrievars - 1 freq sure-fire - 1 freq sharper - 1 freq sherbert - 1 freq server - 2 freq surveyar - 1 freq surpreises - 1 freq surprized - 1 freq surprísed - 1 freq surefire - 1 freq squarebreeks - 1 freq surprehz - 1 freq scriever-musicians - 1 freq scrievership - 10 freq scrieverly - 3 freq skerryvore - 3 freq sreporter - 1 freq |
MetaPhone code - SKRFR skreivar - 18 freq scriever - 60 freq skreever - 4 freq screever - 1 freq screiver - 8 freq screivar - 27 freq skreiver - 3 freq skrievar - 3 freq skerryvore - 3 freq |
SCREIVAR scrieve - 168 freq scrieves - 14 freq scriever - 60 freq skrieve - 5 freq skrieved - freq scrieven - 2 freq scrieved - 47 freq scrievin - 163 freq scrievan - 1 freq scrived - 3 freq scrivin - 3 freq screive - 70 freq subscreivins - 34 freq screivars - 43 freq screivar - 27 freq screived - 39 freq screivings - 24 freq e-screive - 13 freq screivers - 35 freq screivins - 15 freq screiver - 8 freq screives - 7 freq descreived - 4 freq screiving - 3 freq descreivit - 5 freq |
| Time to execute Levenshtein function - 0.313038 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.575245 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.029121 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.068949 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.001195 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. |