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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gemmer (0) - 1 freq
memmer (1) - 35 freq
hemmer (1) - 21 freq
gemmes (1) - 74 freq
gimmer (1) - 2 freq
gemmel (1) - 1 freq
gemme (1) - 105 freq
immer (2) - 2 freq
gemmely (2) - 1 freq
memmers (2) - 41 freq
nemmes (2) - 10 freq
femme (2) - 2 freq
gemms (2) - 14 freq
gemiler (2) - 3 freq
nemme (2) - 9 freq
hemmert (2) - 4 freq
emmers (2) - 4 freq
limmer (2) - 19 freq
cummer (2) - 6 freq
demmet (2) - 1 freq
commer (2) - 1 freq
jimmer (2) - 5 freq
dammer (2) - 1 freq
gemmies (2) - 1 freq
femmes (2) - 1 freq
gemmer (0) - 1 freq
gimmer (1) - 2 freq
gemme (2) - 105 freq
gemmel (2) - 1 freq
gemmes (2) - 74 freq
hemmer (2) - 21 freq
memmer (2) - 35 freq
gemm (3) - 53 freq
bummer (3) - 21 freq
lammer (3) - 2 freq
vimmer (3) - 3 freq
gremmar (3) - 52 freq
zimmer (3) - 3 freq
glimmer (3) - 17 freq
simmer (3) - 314 freq
gemmin (3) - 1 freq
wummer (3) - 1 freq
hummer (3) - 2 freq
nummer (3) - 336 freq
summer (3) - 202 freq
timmer (3) - 80 freq
gomper (3) - 3 freq
kimmer (3) - 6 freq
gimme (3) - 4 freq
hammer (3) - 44 freq
SoundEx code - G560
gonorrhoea - 1 freq
gemmer - 1 freq
gomorrah - 2 freq
gimmer - 2 freq
gunnar - 6 freq
goner - 4 freq
genre - 9 freq
ganner - 1 freq
gener - 1 freq
gonner - 1 freq
geynear - 2 freq
gunner - 2 freq
gamrie - 5 freq
gey-near - 1 freq
gnar - 1 freq
gonhorrea - 1 freq
gwenmairi - 1 freq
MetaPhone code - JMR
gemmer - 1 freq
gimmer - 2 freq
jimmer - 5 freq
jimmoray - 1 freq
joemurray - 1 freq
GEMMER
Time to execute Levenshtein function - 0.229574 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.396902 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.028051 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.037187 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.000891 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.