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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gammon (0) - 5 freq
mammon (1) - 6 freq
gameon (1) - 1 freq
wamman (2) - 1 freq
lemmon (2) - 1 freq
jammen (2) - 1 freq
gambol (2) - 1 freq
damson (2) - 1 freq
samson (2) - 8 freq
common (2) - 301 freq
tamson (2) - 32 freq
saumon (2) - 19 freq
gawdon (2) - 1 freq
glammin (2) - 3 freq
gallon (2) - 13 freq
gammlin (2) - 5 freq
rammin (2) - 3 freq
bammin (2) - 3 freq
gamin (2) - 3 freq
hammin (2) - 1 freq
salmon (2) - 46 freq
jammin (2) - 4 freq
amfmon (2) - 1 freq
garron (2) - 6 freq
gamyn (2) - 1 freq
gammon (0) - 5 freq
gemmin (2) - 1 freq
gummin (2) - 1 freq
mammon (2) - 6 freq
gameon (2) - 1 freq
gamyn (3) - 1 freq
jammin (3) - 4 freq
hammin (3) - 1 freq
gamin (3) - 3 freq
summon (3) - 10 freq
lammin (3) - 2 freq
gampin (3) - 1 freq
gammy (3) - 8 freq
bammin (3) - 3 freq
gamma (3) - 9 freq
gammie (3) - 4 freq
gazman (3) - 1 freq
jammen (3) - 1 freq
rammin (3) - 3 freq
wamman (3) - 1 freq
common (3) - 301 freq
lemmon (3) - 1 freq
glammin (3) - 3 freq
gammlin (3) - 5 freq
grimin (4) - 1 freq
SoundEx code - G550
ginin - 1 freq
gainin - 11 freq
gnome - 2 freq
genuine - 32 freq
gamyn - 1 freq
gnawin - 2 freq
gammon - 5 freq
gimin - 2 freq
gemini - 2 freq
gaanin - 3 freq
gannan - 1 freq
gummin - 1 freq
gainan - 1 freq
gomin - 21 freq
genome - 2 freq
gamin - 3 freq
gymin - 1 freq
gameon - 1 freq
gnom - 2 freq
gemmin - 1 freq
‘genuine - 1 freq
‘genuine’ - 1 freq
MetaPhone code - KMN
comin - 1066 freq
common - 301 freq
'c'moan - 20 freq
c'mon - 87 freq
c'moan - 34 freq
cowmon - 1 freq
'c'mon - 7 freq
combine - 21 freq
comena - 2 freq
commin - 8 freq
caumin - 2 freq
cumin - 70 freq
'commen' - 1 freq
'commen - 1 freq
comin' - 19 freq
kemnay - 4 freq
coman - 41 freq
cumman - 11 freq
comyn - 3 freq
gamyn - 1 freq
cumen - 1 freq
cummen - 26 freq
c''mon - 1 freq
cummin' - 1 freq
combin - 1 freq
kiemon - 1 freq
cmoan - 1 freq
gammon - 5 freq
'comin - 3 freq
cmon - 18 freq
comman - 4 freq
camin - 4 freq
comeen - 1 freq
cummin - 30 freq
gummin - 1 freq
cuman - 2 freq
coemmaan - 1 freq
'coman - 1 freq
gomin - 21 freq
commone - 2 freq
comunn - 1 freq
comon - 1 freq
caimbin - 1 freq
commoun - 3 freq
€œcaman - 1 freq
commune - 3 freq
coamon - 1 freq
coman' - 1 freq
gamin - 3 freq
commaun - 1 freq
komin - 1 freq
cÂ’mon - 6 freq
cumoan - 2 freq
gameon - 1 freq
‘c’mon - 1 freq
kemonn - 1 freq
coomannie - 1 freq
caiman - 1 freq
cayman - 1 freq
GAMMON
Time to execute Levenshtein function - 0.189550 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.334864 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.028415 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.037465 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.000991 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.