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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
graham (0) - 38 freq
grahams (1) - 2 freq
graat (2) - 5 freq
rahab (2) - 2 freq
abraham (2) - 53 freq
groam (2) - 1 freq
gra-an (2) - 1 freq
gravat (2) - 6 freq
gresham (2) - 1 freq
gram (2) - 10 freq
grantham (2) - 1 freq
grayan (2) - 1 freq
graaf (2) - 1 freq
brahan (2) - 3 freq
graan (2) - 14 freq
graham's (2) - 1 freq
gaem (3) - 1 freq
gramsan (3) - 2 freq
grab (3) - 114 freq
amabam (3) - 2 freq
nahum (3) - 3 freq
grapes (3) - 23 freq
glaum (3) - 4 freq
'ahm (3) - 10 freq
rah (3) - 5 freq
graham (0) - 38 freq
grahams (2) - 2 freq
gresham (3) - 1 freq
groam (3) - 1 freq
abraham (3) - 53 freq
gram (3) - 10 freq
garm (4) - 1 freq
goram (4) - 1 freq
durham (4) - 11 freq
rehame (4) - 1 freq
grame (4) - 3 freq
grim (4) - 53 freq
grtm (4) - 1 freq
greh (4) - 1 freq
gruim (4) - 2 freq
gethim (4) - 1 freq
groom (4) - 17 freq
granme (4) - 1 freq
gairm (4) - 4 freq
ogham (4) - 2 freq
krehm (4) - 1 freq
grapheme (4) - 5 freq
granma (4) - 2 freq
grantham (4) - 1 freq
grayan (4) - 1 freq
SoundEx code - G650
green - 644 freq
grimy - 2 freq
grun - 422 freq
growin - 240 freq
gran - 232 freq
graan - 14 freq
grin - 137 freq
grown - 138 freq
granny - 383 freq
gowerin - 1 freq
grimm - 4 freq
gurrin - 1 freq
groom - 17 freq
grim - 53 freq
grime - 5 freq
growen - 19 freq
gaarin - 1 freq
grunn - 16 freq
garm - 1 freq
growein - 42 freq
graham - 38 freq
'gran - 3 freq
gren - 1 freq
girn - 60 freq
grain - 78 freq
'granny' - 2 freq
graun - 9 freq
grunny - 92 freq
groun - 7 freq
groan - 19 freq
grunnie - 13 freq
girmny - 1 freq
growne - 10 freq
garrin - 35 freq
girmy - 1 freq
grannie - 328 freq
growin' - 6 freq
gruim - 2 freq
grouwen - 1 freq
gran' - 1 freq
green' - 1 freq
greene - 2 freq
grouin - 10 freq
grin- - 1 freq
gern - 1 freq
gram - 10 freq
gra-an - 1 freq
gurn - 6 freq
grawin - 13 freq
groun' - 1 freq
'grannie - 5 freq
granme - 1 freq
greeny - 3 freq
girny - 4 freq
germ - 3 freq
giowerin - 1 freq
girnywye - 1 freq
grawn - 4 freq
growan - 24 freq
'green' - 2 freq
grün - 1 freq
greein - 3 freq
grene - 15 freq
grayan - 1 freq
geyran - 1 freq
girnie - 3 freq
gearin - 2 freq
'granny - 3 freq
gyran - 1 freq
graen - 1 freq
'greein - 2 freq
grane - 4 freq
grewn - 3 freq
grouwin - 1 freq
grien - 3 freq
grein - 4 freq
grame - 3 freq
geryon - 9 freq
grann - 1 freq
groon - 7 freq
grainy - 1 freq
gairm - 4 freq
gairn - 1 freq
giorno - 2 freq
graeme - 19 freq
gorm - 1 freq
gruwin - 3 freq
greyin - 2 freq
garron - 6 freq
groam - 1 freq
granma - 2 freq
groon' - 1 freq
germy - 1 freq
germá - 1 freq
greenie - 3 freq
gerrin' - 2 freq
€˜gorm - 1 freq
groin - 3 freq
'girn' - 1 freq
€˜grown - 1 freq
goram - 1 freq
graunie - 1 freq
granÂ’ - 1 freq
growinÂ’ - 1 freq
growÂ’n - 1 freq
'girny - 1 freq
MetaPhone code - KRHM
graham - 38 freq
GRAHAM
Time to execute Levenshtein function - 0.437542 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.719953 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.031423 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.082531 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.000866 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.