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 ablow

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

Similar words to pleasant in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
pleasant (0) - 18 freq
pleasan (1) - 1 freq
pleisant (1) - 2 freq
pheasant (1) - 6 freq
peasant (1) - 12 freq
plesant (1) - 2 freq
pleesant (1) - 2 freq
peasants (2) - 11 freq
pleasanter (2) - 1 freq
pleasance (2) - 3 freq
pleasit (2) - 5 freq
plaisant (2) - 5 freq
'peasant (2) - 1 freq
plaesant (2) - 3 freq
pheasants (2) - 2 freq
pleast (2) - 6 freq
unpleasant (2) - 4 freq
pleasing (2) - 6 freq
pleisand (2) - 1 freq
pleasantly (2) - 1 freq
pleasin (2) - 11 freq
pleadet (3) - 2 freq
peasantry (3) - 2 freq
pennant (3) - 1 freq
pleadin (3) - 12 freq
pleasant (0) - 18 freq
pleesant (1) - 2 freq
plesant (1) - 2 freq
pleisant (1) - 2 freq
plaesant (2) - 3 freq
peasant (2) - 12 freq
pleasan (2) - 1 freq
plaisant (2) - 5 freq
pheasant (2) - 6 freq
pleisand (3) - 1 freq
pleasing (3) - 6 freq
unpleasant (3) - 4 freq
plaisent (3) - 1 freq
pleasin (3) - 11 freq
pleasantly (3) - 1 freq
pleast (3) - 6 freq
pleasanter (3) - 1 freq
pleasit (3) - 5 freq
pleasance (3) - 3 freq
plant (4) - 82 freq
praisant (4) - 2 freq
pliament (4) - 1 freq
prasent (4) - 1 freq
present (4) - 211 freq
plusnet (4) - 1 freq
SoundEx code - P425
plashin - 3 freq
pleasin - 11 freq
pleisance - 1 freq
placename - 1 freq
placin - 17 freq
pluggin - 3 freq
plasma - 5 freq
pleisantly - 1 freq
pluckin - 4 freq
pleisant - 2 freq
pleughman - 2 freq
pleesant - 2 freq
plaisant - 5 freq
polisman's - 1 freq
polisman - 22 freq
place-mats - 1 freq
pilgim - 1 freq
polishin' - 2 freq
pluckin' - 1 freq
polyshen - 1 freq
pleughing - 1 freq
pleughman's - 1 freq
pleasant - 18 freq
polishin - 10 freq
pulsin - 8 freq
ploughman - 9 freq
poliswummin - 1 freq
pleasanter - 1 freq
pollisman - 2 freq
pelicans - 2 freq
pulsing - 3 freq
plaisin - 1 freq
polkemmet - 2 freq
polisnut - 2 freq
place-names - 10 freq
placenames - 4 freq
place-name - 2 freq
ploughin - 2 freq
polismen - 2 freq
polygamists - 3 freq
polygamist - 1 freq
placement - 6 freq
policeman - 3 freq
pleasing - 6 freq
pluckan - 1 freq
placements - 5 freq
placenaimes - 2 freq
policyan' - 1 freq
placenaime - 1 freq
placin' - 1 freq
pillagin - 3 freq
pleasan - 1 freq
plaessment - 1 freq
'placement' - 1 freq
plaessments - 2 freq
plesaunce - 1 freq
pleasance - 3 freq
polishing - 3 freq
pleesantries - 1 freq
play-sangs - 1 freq
policy-makkars - 1 freq
pliss-nem - 1 freq
plaesant - 3 freq
polissman - 2 freq
pleisand - 1 freq
policymakkin - 1 freq
pleasantries - 1 freq
pilsner - 1 freq
placing - 2 freq
pillaging - 1 freq
plaisent - 1 freq
pleasantly - 1 freq
€œpolishin - 1 freq
plesant - 2 freq
place-nemmes - 2 freq
policeman's - 1 freq
plaguin - 1 freq
pljmxstz - 1 freq
plusnethelp - 1 freq
plusnet - 1 freq
pleasence - 1 freq
paulajmossie - 1 freq
polygonbooks - 1 freq
placenamesni - 4 freq
policing - 1 freq
MetaPhone code - PLSNT
pleisant - 2 freq
pleesant - 2 freq
plaisant - 5 freq
pleasant - 18 freq
polisnut - 2 freq
plaesant - 3 freq
pleisand - 1 freq
plaisent - 1 freq
plesant - 2 freq
plusnet - 1 freq
PLEASANT
Time to execute Levenshtein function - 0.217879 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.548223 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.034183 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.085056 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.003361 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.