| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| preservin (0) - 8 freq reservin (1) - 1 freq priservin (1) - 1 freq preservin' (1) - 3 freq preservit (1) - 2 freq reservit (2) - 5 freq presentin (2) - 5 freq preferrin (2) - 5 freq deservin (2) - 4 freq reserrin (2) - 1 freq preserve (2) - 20 freq preserved (2) - 7 freq €˜preservin (2) - 1 freq reservist (3) - 3 freq proseedin (3) - 1 freq reserves (3) - 4 freq pervin (3) - 1 freq undeservin (3) - 1 freq presentit (3) - 24 freq receivin (3) - 7 freq pretendin (3) - 21 freq preferit (3) - 1 freq preser (3) - 1 freq referin (3) - 1 freq resettin (3) - 1 freq |
preservin (0) - 8 freq priservin (1) - 1 freq reservin (2) - 1 freq preservit (2) - 2 freq preservin' (2) - 3 freq preserved (3) - 7 freq preserve (3) - 20 freq preservation (4) - 12 freq preferrin (4) - 5 freq presarve (4) - 1 freq €˜preservin (4) - 1 freq presentin (4) - 5 freq deservin (4) - 4 freq reserrin (4) - 1 freq reservit (4) - 5 freq reservoir (5) - 10 freq conservin (5) - 1 freq presumin (5) - 1 freq preparin (5) - 7 freq preserve's (5) - 1 freq preferran (5) - 1 freq presidin (5) - 2 freq servin (5) - 35 freq presagin (5) - 2 freq 'servin (5) - 1 freq |
SoundEx code - P626 programme - 102 freq preacher - 20 freq pre-crust - 2 freq parker - 19 freq pressure - 64 freq 'programme' - 1 freq preachers - 6 freq preservin - 8 freq preserve's - 1 freq pressurised - 1 freq progress - 95 freq preserved - 7 freq programmes - 54 freq porkers - 2 freq progressive - 24 freq paragraph - 19 freq proscribed - 1 freq procure - 1 freq preserve - 20 freq prescribed - 3 freq preshure - 1 freq preesher - 5 freq priservin - 1 freq preservation - 12 freq progresses - 1 freq programmed - 3 freq pressures - 8 freq programmin - 2 freq prescription - 8 freq precarious - 3 freq 'progress' - 2 freq pursuers - 1 freq progression - 10 freq pre-christian - 1 freq program - 24 freq programs - 13 freq pruchry - 1 freq preacher's - 1 freq paragraphs - 6 freq progremmes - 1 freq parrygraph - 2 freq presairve - 4 freq precariously - 3 freq procrastination - 3 freq preservin' - 3 freq programmin' - 3 freq progressin - 2 freq progressin' - 1 freq progressed - 4 freq proker - 1 freq procuratour - 1 freq pursuer - 2 freq prescriptive - 4 freq prescriptions - 4 freq presairver - 1 freq perqueerest - 1 freq pressured - 2 freq prizery - 1 freq peregrine - 1 freq preservit - 2 freq progres - 1 freq progressit - 1 freq €˜prescriptive - 1 freq precursor - 1 freq proscribin - 1 freq proscribit - 1 freq presarve - 1 freq powercaird - 1 freq €˜preservin - 1 freq prescribe - 1 freq precairious - 1 freq preser - 1 freq perqueir - 1 freq progressing - 1 freq perjurors - 1 freq procuire - 1 freq perscription - 2 freq presirvaeshin - 2 freq pressjournal - 21 freq perscriptions - 1 freq procrastinate - 1 freq pbrcrzj - 1 freq perserverence - 1 freq 'progressive' - 1 freq procrastinatin - 1 freq parsreview - 2 freq “prasher” - 1 freq progressscots - 1 freq progressives - 1 freq programme' - 1 freq progressscot - 1 freq |
MetaPhone code - PRSRFN preservin - 8 freq priservin - 1 freq preservin' - 3 freq €˜preservin - 1 freq |
PRESERVIN |
| Time to execute Levenshtein function - 0.187995 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.355400 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.027794 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.037024 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.000801 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. |