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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gbell (0) - 1 freq
gell (1) - 5 freq
abell (1) - 1 freq
bell (1) - 215 freq
abel (2) - 7 freq
bull (2) - 92 freq
gill (2) - 3 freq
beld (2) - 1 freq
fell (2) - 719 freq
-well (2) - 2 freq
gall (2) - 4 freq
bill (2) - 551 freq
gbl (2) - 1 freq
geelt (2) - 2 freq
'well (2) - 57 freq
pjbell (2) - 1 freq
geel (2) - 2 freq
dell (2) - 8 freq
ab'll (2) - 2 freq
zabell (2) - 1 freq
gelh (2) - 1 freq
gyely (2) - 52 freq
belle (2) - 17 freq
bellt (2) - 1 freq
stell (2) - 31 freq
gbell (0) - 1 freq
abell (2) - 1 freq
bell (2) - 215 freq
gell (2) - 5 freq
zabell (3) - 1 freq
gull (3) - 7 freq
belly (3) - 163 freq
ball (3) - 62 freq
grill (3) - 5 freq
bella (3) - 96 freq
kbll (3) - 1 freq
belle (3) - 17 freq
boll (3) - 1 freq
gyill (3) - 1 freq
gill (3) - 3 freq
bull (3) - 92 freq
gall (3) - 4 freq
gbl (3) - 1 freq
bill (3) - 551 freq
rebelle (4) - 1 freq
gelt (4) - 1 freq
grylle (4) - 1 freq
guzull (4) - 1 freq
grille (4) - 1 freq
bille (4) - 2 freq
SoundEx code - G140
gabble - 1 freq
gobble - 3 freq
gable - 8 freq
gavel - 6 freq
gabloo - 1 freq
gbell - 1 freq
gabala - 1 freq
gibble - 1 freq
gvl - 1 freq
gbl - 1 freq
gablo - 1 freq
MetaPhone code - KBL
coble - 5 freq
gabble - 1 freq
gobble - 3 freq
gable - 8 freq
caybul - 1 freq
cable - 12 freq
kabul - 1 freq
cobble - 5 freq
gabloo - 1 freq
gbell - 1 freq
gabala - 1 freq
cabal - 2 freq
kibbil - 1 freq
qbal - 1 freq
kibble - 1 freq
gbl - 1 freq
kbll - 1 freq
gablo - 1 freq
GBELL
Time to execute Levenshtein function - 0.190850 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.348415 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.027460 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.037129 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.000886 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.