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 sonsie

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

Similar words to packham in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
packham (0) - 1 freq
packam (1) - 1 freq
packa (2) - 1 freq
packman (2) - 3 freq
beckham (2) - 2 freq
tackar (3) - 1 freq
pack' (3) - 2 freq
pack'd (3) - 1 freq
pacean (3) - 1 freq
packin (3) - 20 freq
pac-man (3) - 1 freq
backhaan (3) - 1 freq
parka (3) - 2 freq
packing (3) - 6 freq
jackdaw (3) - 2 freq
larkhaa (3) - 1 freq
blackhaw (3) - 1 freq
akram (3) - 1 freq
cacklan (3) - 1 freq
packfou (3) - 1 freq
yakcam (3) - 35 freq
packers (3) - 1 freq
packet (3) - 62 freq
backchat (3) - 4 freq
backhaun (3) - 1 freq
packham (0) - 1 freq
packam (2) - 1 freq
beckham (3) - 2 freq
packman (4) - 3 freq
packa (4) - 1 freq
thickham (5) - 1 freq
packets (5) - 20 freq
packt (5) - 2 freq
pechan (5) - 2 freq
packmen (5) - 2 freq
packed (5) - 59 freq
pickan (5) - 4 freq
packit (5) - 17 freq
alcham (5) - 1 freq
packload (5) - 1 freq
backhaud (5) - 1 freq
packs (5) - 12 freq
pack (5) - 116 freq
packer (5) - 1 freq
achim (5) - 2 freq
parkhead (5) - 1 freq
packle (5) - 1 freq
package (5) - 28 freq
backhaun (5) - 1 freq
packfou (5) - 1 freq
SoundEx code - P250
pushin - 64 freq
passin - 156 freq
pickin - 111 freq
poison - 28 freq
passion - 76 freq
pechin - 86 freq
pishin - 32 freq
peckin - 16 freq
posin - 9 freq
pyson - 4 freq
pushion - 6 freq
pokin - 19 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 - 12 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' - 7 freq
pickin' - 1 freq
peakin - 1 freq
pausin - 5 freq
pussin - 1 freq
pigskin - 1 freq
pechan - 2 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 - PKHM
packham - 1 freq
PACKHAM
Time to execute Levenshtein function - 0.201956 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.358989 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.029590 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.037728 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.000905 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.