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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gowpin (0) - 30 freq
gopin (1) - 1 freq
gowlin (1) - 15 freq
dowpin (1) - 1 freq
gowpen (1) - 5 freq
lowpin (1) - 91 freq
gowpins (1) - 1 freq
gowkin (1) - 2 freq
gowfin (1) - 2 freq
jowpin (1) - 1 freq
cowpin (1) - 26 freq
gawpin (1) - 34 freq
goupin (1) - 1 freq
howpin (1) - 45 freq
gowpit (1) - 10 freq
lopin (2) - 1 freq
powkin (2) - 24 freq
gowan (2) - 16 freq
lowin (2) - 31 freq
poppin (2) - 22 freq
lownin (2) - 2 freq
goldin (2) - 1 freq
toppin (2) - 5 freq
gawpit (2) - 10 freq
ropin (2) - 1 freq
gowpin (0) - 30 freq
gawpin (1) - 34 freq
gowpen (1) - 5 freq
jowpin (2) - 1 freq
cowpin (2) - 26 freq
goupin (2) - 1 freq
gowpit (2) - 10 freq
gowfin (2) - 2 freq
howpin (2) - 45 freq
gopin (2) - 1 freq
gowkin (2) - 2 freq
dowpin (2) - 1 freq
gowlin (2) - 15 freq
lowpin (2) - 91 freq
gowpins (2) - 1 freq
goween (3) - 1 freq
gown (3) - 2 freq
gulpin (3) - 4 freq
lowpan (3) - 2 freq
gaapin (3) - 1 freq
gappin (3) - 2 freq
woopin (3) - 1 freq
gowden (3) - 235 freq
gowpens (3) - 1 freq
gapin (3) - 10 freq
SoundEx code - G150
gowpen - 5 freq
govin - 9 freq
goavyin - 1 freq
givin - 8 freq
gowpin - 30 freq
gapin - 10 freq
given - 69 freq
guffin - 1 freq
gabbin - 19 freq
gavin - 42 freq
gaupin - 8 freq
gawpin - 34 freq
gypin - 3 freq
gibbon - 10 freq
gappen - 2 freq
gappin - 2 freq
gabbana - 1 freq
'gaban' - 1 freq
govan - 10 freq
geffin - 1 freq
gif'n - 5 freq
giban - 1 freq
gvaain - 1 freq
gaffin - 5 freq
gappan - 1 freq
goavin - 1 freq
gubbin - 3 freq
gupan - 1 freq
giovanni - 3 freq
givan - 4 freq
gowfin - 2 freq
gvaan - 1 freq
ghobhainn - 1 freq
gobban - 1 freq
gevin - 1 freq
gopin - 1 freq
gaapin - 1 freq
€˜giovanni - 2 freq
guffan - 1 freq
govn - 2 freq
giovino - 1 freq
'given' - 1 freq
'goupin' - 1 freq
goupin - 1 freq
gbn - 1 freq
gfm - 1 freq
gcbinnie - 2 freq
MetaPhone code - KPN
gowpen - 5 freq
keepin - 218 freq
coupon - 57 freq
cuppin - 6 freq
gowpin - 30 freq
gapin - 10 freq
capone - 1 freq
gaupin - 8 freq
coupin - 7 freq
gawpin - 34 freq
cowpin - 26 freq
keppin - 10 freq
copin - 4 freq
keipin - 2 freq
keepin' - 8 freq
keepen - 1 freq
coupen - 1 freq
gappen - 2 freq
keep'n - 1 freq
gappin - 2 freq
kippin - 1 freq
keepan - 12 freq
copan - 1 freq
coupan - 1 freq
gappan - 1 freq
gupan - 1 freq
gopin - 1 freq
gaapin - 1 freq
cappin - 1 freq
coopin - 1 freq
capon - 1 freq
kpn - 1 freq
'goupin' - 1 freq
goupin - 1 freq
GOWPIN
Time to execute Levenshtein function - 0.175551 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.317201 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.027522 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.037264 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.000920 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.