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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gerkin (0) - 1 freq
gerdin (1) - 2 freq
geckin (1) - 3 freq
girkin (1) - 1 freq
merkin (1) - 6 freq
gertin (1) - 1 freq
gerkins (1) - 1 freq
yerkin (1) - 4 freq
gherkin (1) - 1 freq
berkin (1) - 1 freq
jerkin (1) - 2 freq
werkin (1) - 2 freq
herkin (1) - 3 freq
yeukin (2) - 1 freq
deekin (2) - 2 freq
eekin (2) - 1 freq
herin (2) - 2 freq
peekin (2) - 3 freq
aekin (2) - 1 freq
lurkin (2) - 13 freq
errin (2) - 1 freq
gettin (2) - 1172 freq
harkin (2) - 5 freq
geffin (2) - 1 freq
mirkin (2) - 1 freq
gerkin (0) - 1 freq
girkin (1) - 1 freq
grekin (2) - 1 freq
jerkin (2) - 2 freq
werkin (2) - 2 freq
gherkin (2) - 1 freq
herkin (2) - 3 freq
berkin (2) - 1 freq
yerkin (2) - 4 freq
gerdin (2) - 2 freq
geckin (2) - 3 freq
merkin (2) - 6 freq
gerkins (2) - 1 freq
gertin (2) - 1 freq
gearin (3) - 2 freq
yarkin (3) - 4 freq
jerkan (3) - 1 freq
grin (3) - 137 freq
parkin (3) - 16 freq
reikin (3) - 2 freq
girdin (3) - 2 freq
larkin (3) - 3 freq
reukin (3) - 1 freq
barkin (3) - 27 freq
gowkin (3) - 2 freq
SoundEx code - G625
growesna - 1 freq
grassin - 2 freq
grassing - 1 freq
gruching - 1 freq
grazin - 11 freq
gruesome - 17 freq
garrison - 9 freq
gressmairket - 3 freq
grassmairket - 1 freq
grazins - 1 freq
garson - 2 freq
grassmarket's - 1 freq
gargantuan - 2 freq
gorgon - 3 freq
georgian - 4 freq
gressmercat - 3 freq
grecian - 1 freq
gorgin - 1 freq
growzn - 1 freq
gargonius - 1 freq
gherkin - 1 freq
garganta - 1 freq
grice-infant - 1 freq
gruesum - 4 freq
gorgonzola - 2 freq
gruesomely - 1 freq
grazings - 1 freq
greesan - 1 freq
grassmercat - 1 freq
grekin - 1 freq
grosjean - 1 freq
grushin - 1 freq
grassmarket - 4 freq
gorgons - 1 freq
girkin - 1 freq
gargunnock - 1 freq
gresham - 1 freq
gerkin - 1 freq
gerkins - 1 freq
georgina - 2 freq
girsin - 1 freq
grazing - 3 freq
grice-ingans - 1 freq
grassmerkit - 4 freq
grgn - 1 freq
greigmidd - 8 freq
greghunter - 1 freq
greachan - 5 freq
griezman - 1 freq
gerryhassan - 7 freq
garyjmoyes - 1 freq
georgemichael - 1 freq
greghemphill - 1 freq
gregjames - 1 freq
gracemaryk - 1 freq
gregmoodie - 1 freq
georgemwme - 1 freq
garrisoned - 1 freq
georgehunter - 1 freq
garyknox - 1 freq
garysma - 3 freq
gregjmchugh - 1 freq
MetaPhone code - JRKN
jargon - 3 freq
jerkan - 1 freq
jerkin - 2 freq
girkin - 1 freq
€˜jargon - 1 freq
gerkin - 1 freq
GERKIN
Time to execute Levenshtein function - 0.222019 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.406902 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.035200 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.048203 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.001186 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.