| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scriever (0) - 60 freq scrieve (1) - 166 freq scrieven (1) - 2 freq scrieved (1) - 46 freq screever (1) - 1 freq scrievers (1) - 25 freq scrieves (1) - 14 freq screeve (2) - 1 freq screiver (2) - 8 freq scriever's (2) - 2 freq serieve (2) - 3 freq scrievan (2) - 1 freq screeved (2) - 2 freq riever (2) - 2 freq skrievar (2) - 3 freq scrievars (2) - 1 freq skrieve (2) - 5 freq skrieves (2) - 3 freq scrievin (2) - 161 freq scrievit (2) - 102 freq siever (2) - 2 freq scrieverly (2) - 3 freq scrievein (2) - 2 freq scrievt (2) - 1 freq stiever (2) - 1 freq |
scriever (0) - 60 freq screever (1) - 1 freq scrieves (2) - 14 freq screiver (2) - 8 freq scrievers (2) - 25 freq scrieven (2) - 2 freq scrieved (2) - 46 freq scrieve (2) - 166 freq scrieverly (3) - 3 freq scrievit (3) - 102 freq scrievein (3) - 2 freq skreever (3) - 4 freq scrievin (3) - 161 freq scrived (3) - 2 freq scrievt (3) - 1 freq screeved (3) - 2 freq screivar (3) - 27 freq scrievan (3) - 1 freq skrievar (3) - 3 freq scrievars (3) - 1 freq screeve (3) - 1 freq scriven (3) - 2 freq scraper (4) - 2 freq ascrived (4) - 1 freq screive (4) - 69 freq |
SoundEx code - S616 surprise - 207 freq scrapyaird - 2 freq surprised - 152 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 serperate - 1 freq screivers' - 1 freq sirprise - 5 freq sirprises - 1 freq screivers - 33 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 shairper - 2 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 |
SCRIEVER scrieve - 166 freq scrieves - 14 freq scriever - 60 freq skrieve - 5 freq skrieved - freq scrieven - 2 freq scrieved - 46 freq scrievin - 161 freq scrievan - 1 freq scrived - 2 freq scrivin - 1 freq screive - 69 freq subscreivins - 34 freq screivars - 43 freq screivar - 27 freq screived - 39 freq screivings - 24 freq e-screive - 13 freq screivers - 33 freq screivins - 12 freq screiver - 8 freq screives - 6 freq descreived - 4 freq screiving - 3 freq descreivit - 5 freq |
| Time to execute Levenshtein function - 0.193385 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.338684 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.027534 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.037764 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.001135 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. |