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 pxim in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
pxim (0) - 1 freq
pxm (1) - 1 freq
prim (1) - 2 freq
peig (2) - 1 freq
slim (2) - 16 freq
exxm (2) - 1 freq
prom (2) - 8 freq
sxm (2) - 1 freq
xxii (2) - 1 freq
wxi (2) - 1 freq
pia (2) - 3 freq
pram (2) - 18 freq
xiu (2) - 1 freq
aim (2) - 50 freq
pi (2) - 7 freq
xi (2) - 13 freq
xxm (2) - 1 freq
pie (2) - 117 freq
brim (2) - 17 freq
clim (2) - 33 freq
dim (2) - 50 freq
akim (2) - 2 freq
pil (2) - 5 freq
nim (2) - 9 freq
tuim (2) - 102 freq
pxim (0) - 1 freq
pxm (1) - 1 freq
prim (2) - 2 freq
pum (3) - 3 freq
axiom (3) - 1 freq
pom (3) - 20 freq
poem (3) - 357 freq
poyim (3) - 3 freq
pima (3) - 1 freq
paix (3) - 2 freq
penim (3) - 1 freq
phem (3) - 1 freq
pixie (3) - 4 freq
px (3) - 1 freq
pcm (3) - 1 freq
prima (3) - 7 freq
pm (3) - 124 freq
prum (3) - 1 freq
plum (3) - 15 freq
palm (3) - 33 freq
purim (3) - 1 freq
pix (3) - 1 freq
pxxy (3) - 1 freq
perm (3) - 3 freq
pram (3) - 18 freq
SoundEx code - P250
pushin - 60 freq
passin - 152 freq
pickin - 108 freq
poison - 28 freq
passion - 75 freq
pechin - 85 freq
pishin - 29 freq
peckin - 16 freq
posin - 9 freq
pyson - 4 freq
pushion - 6 freq
pokin - 18 freq
'poison - 1 freq
pizzen - 2 freq
possum - 1 freq
'pushion' - 1 freq
piece-an - 1 freq
pusshin - 1 freq
pigeon - 37 freq
packin - 20 freq
pisen - 1 freq
pacin - 11 freq
pookin - 1 freq
powkin - 24 freq
pickan - 4 freq
passan - 7 freq
pyjama - 1 freq
pagan - 17 freq
pissin - 17 freq
pikkin - 1 freq
passen - 2 freq
picsien - 1 freq
pikken - 6 freq
pouken - 1 freq
peikken - 1 freq
paaken - 1 freq
pakken - 1 freq
pooshen - 1 freq
passin' - 6 freq
pickin' - 1 freq
pussin - 1 freq
pigskin - 1 freq
pechan - 2 freq
pausin - 4 freq
puzhin - 3 freq
poosan - 1 freq
'poison' - 2 freq
puzziin - 1 freq
pig-weeyin - 1 freq
passioun - 1 freq
poachin - 5 freq
püshin - 3 freq
poochin' - 1 freq
'pokin' - 1 freq
pussion - 1 freq
peggan - 1 freq
'pooshin' - 1 freq
pooshin - 2 freq
pickeen - 1 freq
pikan - 2 freq
pushan - 3 freq
'pigeon - 1 freq
passeen - 3 freq
posiuon - 1 freq
puskan - 1 freq
pizen - 3 freq
puckin - 10 freq
pacean - 1 freq
pooshan - 1 freq
paikin - 3 freq
puzzian - 1 freq
poukin - 2 freq
pykin - 2 freq
poushion - 1 freq
puzhion - 1 freq
peekin - 3 freq
pooshion - 1 freq
poussin - 1 freq
pushioun - 1 freq
€˜pygmy - 1 freq
packham - 1 freq
peejin - 1 freq
piecin - 1 freq
pogoin - 1 freq
peghin - 1 freq
€œpiggin - 1 freq
piggin - 10 freq
pysin - 1 freq
pxm - 1 freq
peckin' - 3 freq
pishinÂ’ - 1 freq
pjsnoo - 1 freq
pvjzn - 1 freq
pzno - 1 freq
pqmoy - 1 freq
pishin' - 1 freq
packam - 1 freq
pxim - 1 freq
pasna - 1 freq
pzywn - 1 freq
pcm - 1 freq
pooskin - 1 freq
phkan - 1 freq
MetaPhone code - PKSM
pxm - 1 freq
pxim - 1 freq
PXIM
Time to execute Levenshtein function - 0.339368 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.692539 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.084951 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.102457 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.001076 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.