| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scooren (0) - 2 freq scoorin (1) - 2 freq scoored (1) - 3 freq scoopen (1) - 1 freq soored (2) - 1 freq coorien (2) - 1 freq stoorin (2) - 2 freq scoolin (2) - 2 freq scorn (2) - 18 freq schore (2) - 1 freq stoored (2) - 4 freq coored (2) - 2 freq scores (2) - 15 freq scooter (2) - 9 freq cooken (2) - 1 freq scoor (2) - 12 freq score (2) - 94 freq scored (2) - 41 freq sooran (2) - 1 freq scootin (2) - 4 freq scoors (2) - 2 freq scoopin (2) - 7 freq scouran (2) - 1 freq coorin (2) - 3 freq smoored (2) - 32 freq |
scooren (0) - 2 freq scoorin (1) - 2 freq scorn (2) - 18 freq scorin (2) - 6 freq scourin (2) - 11 freq scoopen (2) - 1 freq scoored (2) - 3 freq scouran (2) - 1 freq scoorie (3) - 2 freq scorer (3) - 3 freq smoorin (3) - 10 freq shoorin (3) - 1 freq stooran (3) - 1 freq scoofin (3) - 3 freq screin (3) - 3 freq scarn (3) - 2 freq scaurin (3) - 1 freq scarin (3) - 2 freq screen (3) - 140 freq scran (3) - 83 freq scoured (3) - 5 freq score' (3) - 1 freq scorem (3) - 1 freq scoort (3) - 2 freq score (3) - 94 freq |
SoundEx code - S650 sharin - 44 freq shore-win - 1 freq scran - 83 freq soarin - 9 freq srowin - 1 freq scream - 64 freq soor-an - 4 freq siren - 10 freq screen - 140 freq scorn - 18 freq scaurin - 1 freq squirm - 5 freq scorin - 6 freq sharon - 10 freq serrin - 5 freq screwin - 7 freq scarn - 2 freq scrawny - 11 freq shorn - 7 freq scourin - 11 freq sour-an - 1 freq sweerin - 12 freq sharn - 29 freq shairn - 17 freq sweirin - 16 freq scarrin - 1 freq scrum - 2 freq swarm - 2 freq swearin - 16 freq sorn - 28 freq searin - 4 freq shrine - 12 freq swairm - 3 freq shooerin - 2 freq scryin - 1 freq sweeren - 1 freq scooren - 2 freq shirin - 2 freq shoorin - 1 freq squarin - 1 freq sharny - 7 freq scarin - 2 freq showroom - 2 freq sworn - 13 freq shairny - 2 freq swirin - 1 freq 'sron - 1 freq scurryin - 6 freq skewerin - 1 freq score-in - 2 freq sware-in - 1 freq sarne - 1 freq scorem - 1 freq sairin - 3 freq syrian - 2 freq skrime - 1 freq scream' - 1 freq sooran - 1 freq sharan - 4 freq scoorin - 2 freq sorun - 1 freq shorin - 1 freq skrene - 1 freq skyran - 3 freq swaeran - 1 freq sheeriin - 1 freq scurrian - 1 freq shairin - 2 freq sharin' - 1 freq skirrin - 2 freq scram - 1 freq 'sharon - 1 freq scouran - 1 freq serene - 2 freq sharnie - 1 freq sharn- - 1 freq souerane - 1 freq swurn - 1 freq scrime - 3 freq screin - 3 freq skyrin - 1 freq scraun - 1 freq sirin - 1 freq shiran - 3 freq serum - 4 freq shrne - 1 freq skairin - 1 freq skorne - 1 freq shearin - 2 freq scrim - 1 freq sarnie - 3 freq €˜scorin - 2 freq €™s-erran - 2 freq sorny - 2 freq saurin - 1 freq sauron - 1 freq skorn - 1 freq sherrene - 1 freq sweirn - 1 freq ‘shornÂ’ - 1 freq srmn - 1 freq sharron - 3 freq sharein - 1 freq |
MetaPhone code - SKRN scran - 83 freq screen - 140 freq scorn - 18 freq scaurin - 1 freq scorin - 6 freq scarn - 2 freq scrawny - 11 freq scourin - 11 freq scarrin - 1 freq scooren - 2 freq squarin - 1 freq scarin - 2 freq score-in - 2 freq scoorin - 2 freq skrene - 1 freq skyran - 3 freq scurrian - 1 freq skirrin - 2 freq scouran - 1 freq screin - 3 freq skyrin - 1 freq securin - 1 freq scraun - 1 freq skairin - 1 freq skorne - 1 freq €˜scorin - 2 freq sea-green - 1 freq skorn - 1 freq |
SCOOREN |
| Time to execute Levenshtein function - 0.203393 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.359342 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.027676 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.037491 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.000859 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. |