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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
chrisgpackham (0) - 1 freq
chrismochan (5) - 2 freq
chrismcstay (6) - 1 freq
thickham (6) - 1 freq
packham (6) - 1 freq
christsake (6) - 1 freq
christtocs (7) - 8 freq
chap-chap (7) - 1 freq
chrisscfc (7) - 2 freq
chainchan (7) - 1 freq
christian (7) - 99 freq
christina (7) - 13 freq
chrisitna (7) - 1 freq
corpach (7) - 1 freq
christopher (7) - 174 freq
crackan (7) - 3 freq
christmassy (7) - 2 freq
christmas' (7) - 2 freq
chrissiem (7) - 28 freq
christmastime (7) - 2 freq
christan (7) - 1 freq
cressingham (7) - 2 freq
chacha (7) - 1 freq
chrissmas (7) - 3 freq
chrismoffat (7) - 1 freq
chrisgpackham (0) - 1 freq
chrismochan (9) - 2 freq
christopher (11) - 174 freq
christsake (11) - 1 freq
packham (11) - 1 freq
chrismcstay (11) - 1 freq
thickham (11) - 1 freq
chrysantheum (11) - 1 freq
chrisma (12) - 1 freq
chrisdarroch (12) - 1 freq
christopherharv (12) - 7 freq
christinah (12) - 2 freq
christinehoy (12) - 2 freq
chrisstirk (12) - 1 freq
carsackie (12) - 1 freq
crispbake (12) - 1 freq
chrysanths (12) - 6 freq
chrissmith (12) - 1 freq
chrisgordon (12) - 12 freq
christ-sake (12) - 2 freq
chreach (12) - 1 freq
cherrypickin' (12) - 1 freq
chrissiem (12) - 28 freq
chrisscfc (12) - 2 freq
christtocs (12) - 8 freq
SoundEx code - C621
crisp - 43 freq
crisps - 34 freq
chargeable - 1 freq
crispy - 10 freq
crosbie - 5 freq
crosbie's - 3 freq
crucifixion - 4 freq
crosflats - 1 freq
crossflats - 1 freq
crispies - 2 freq
curraghabellintlea - 1 freq
crucify - 1 freq
crisp-cut - 1 freq
crag-face - 1 freq
correspondit - 1 freq
chairs've - 1 freq
crucyfie - 2 freq
crucyfied - 3 freq
crucyfïxion - 1 freq
carrickfergus - 6 freq
crispinus - 2 freq
chrysippus - 1 freq
crucifee - 2 freq
crucifiet - 4 freq
correspondence - 9 freq
correspondince - 1 freq
cork-filled - 2 freq
crispbake - 1 freq
croass-border - 1 freq
crucifehd - 2 freq
crucifeht - 1 freq
course-'if - 1 freq
cairriage-fu - 1 freq
craze-paitrens - 1 freq
cross-pairty - 6 freq
correspondent' - 1 freq
craigyburn - 1 freq
crucifix - 1 freq
crosby - 1 freq
cross-party - 3 freq
correspondent - 5 freq
correspondents - 2 freq
correspond - 1 freq
corresponds - 2 freq
cross-fertilisation - 1 freq
corresponded - 1 freq
cursive - 2 freq
corrosive - 1 freq
crossover - 1 freq
crossbones - 1 freq
crossbow - 6 freq
crucified - 1 freq
carysfort - 1 freq
chrisfoote - 1 freq
craigfitzsimon - 1 freq
carysabel - 1 freq
craigpettigrew - 1 freq
craigspain - 3 freq
craigbeautyboy - 1 freq
craigcavyleader - 1 freq
craigblackphoto - 4 freq
crossfitgames - 1 freq
crusepat - 3 freq
crooksuprmarket - 1 freq
crossfolds - 1 freq
crispmermaid - 1 freq
chrisgpackham - 1 freq
craigferchef - 1 freq
chrissieburgess - 1 freq
chrisfinnie - 2 freq
chrisscfc - 2 freq
crsbrql - 1 freq
crossfella - 1 freq
MetaPhone code - XRSKPKHM
chrisgpackham - 1 freq
CHRISGPACKHAM
Time to execute Levenshtein function - 0.215670 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.425803 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.028539 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.037636 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.000989 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.