A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example ahint

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to preserved in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
preserved (0) - 7 freq
reserved (1) - 11 freq
preserve (1) - 20 freq
preservit (2) - 2 freq
preeved (2) - 2 freq
preferred (2) - 23 freq
presarve (2) - 1 freq
preserve's (2) - 1 freq
reserve (2) - 8 freq
presented (2) - 17 freq
unreserved (2) - 1 freq
reserves (2) - 4 freq
deserved (2) - 58 freq
preservin (2) - 8 freq
revered (3) - 3 freq
refereed (3) - 1 freq
reverted (3) - 1 freq
resaived (3) - 2 freq
presenter (3) - 9 freq
'served (3) - 1 freq
priservin (3) - 1 freq
petered (3) - 3 freq
reservin (3) - 1 freq
preeve (3) - 6 freq
reeved (3) - 2 freq
preserved (0) - 7 freq
preserve (2) - 20 freq
reserved (2) - 11 freq
presarve (3) - 1 freq
preservin (3) - 8 freq
preservit (3) - 2 freq
unreserved (3) - 1 freq
priservin (4) - 1 freq
presairve (4) - 4 freq
deserved (4) - 58 freq
presairver (4) - 1 freq
reserves (4) - 4 freq
preserve's (4) - 1 freq
preeved (4) - 2 freq
preferred (4) - 23 freq
reserve (4) - 8 freq
presented (4) - 17 freq
preesed (5) - 1 freq
prescribed (5) - 3 freq
presided (5) - 3 freq
pressured (5) - 2 freq
reservt (5) - 1 freq
premiered (5) - 1 freq
presumed (5) - 1 freq
observed (5) - 11 freq
SoundEx code - P626
programme - 101 freq
preacher - 21 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 - 96 freq
preserved - 7 freq
programmes - 55 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
progression - 11 freq
program - 25 freq
prescribe - 2 freq
preissure - 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
pre-christian - 1 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
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 - PRSRFT
preserved - 7 freq
preservit - 2 freq
PRESERVED
Time to execute Levenshtein function - 0.206491 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.355462 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.030256 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.038383 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.000901 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.