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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
graves (0) - 31 freq
graces (1) - 16 freq
grapes (1) - 23 freq
craves (1) - 3 freq
gravel (1) - 6 freq
grates (1) - 5 freq
raves (1) - 5 freq
greves (1) - 1 freq
braves (1) - 3 freq
graved (1) - 1 freq
graven (1) - 1 freq
grave (1) - 130 freq
granes (1) - 1 freq
grades (1) - 9 freq
groves (1) - 2 freq
graver (1) - 1 freq
bravest (2) - 5 freq
brave (2) - 134 freq
grove (2) - 21 freq
draver (2) - 2 freq
travels (2) - 9 freq
granet (2) - 1 freq
gravy's (2) - 6 freq
grats (2) - 1 freq
roves (2) - 1 freq
graves (0) - 31 freq
greves (1) - 1 freq
groves (1) - 2 freq
grooves (2) - 1 freq
grave (2) - 130 freq
granes (2) - 1 freq
grades (2) - 9 freq
graven (2) - 1 freq
grieves (2) - 2 freq
graver (2) - 1 freq
graved (2) - 1 freq
grapes (2) - 23 freq
graces (2) - 16 freq
gravel (2) - 6 freq
craves (2) - 3 freq
grates (2) - 5 freq
raves (2) - 5 freq
braves (2) - 3 freq
guavas (3) - 1 freq
grans (3) - 2 freq
grains (3) - 11 freq
graufs (3) - 1 freq
gives (3) - 19 freq
graived (3) - 1 freq
gloves (3) - 48 freq
SoundEx code - G612
graves - 31 freq
gravesteen - 1 freq
gravesteens - 4 freq
gorbs - 1 freq
giraffes - 3 freq
grabs - 19 freq
grubbiest - 1 freq
greves - 1 freq
groups - 145 freq
grapes - 23 freq
grieveyous - 1 freq
grups - 12 freq
grievously - 1 freq
grief-stricken - 1 freq
grebes - 2 freq
grievous - 7 freq
gravesend - 1 freq
grieves - 2 freq
gravestone - 2 freq
griefs - 2 freq
gearbox - 5 freq
greev's - 1 freq
geerbox - 1 freq
graips - 3 freq
gravestanes - 11 freq
gear-boxes - 2 freq
groves - 2 freq
grief's - 2 freq
graveside - 1 freq
grips - 18 freq
graphics' - 1 freq
graphic - 23 freq
graphical - 4 freq
graphs - 6 freq
graupius - 4 freq
gravestones - 6 freq
gravestane - 7 freq
graveslabs - 1 freq
garravashin - 3 freq
garravashed - 2 freq
grievious - 1 freq
grab's - 1 freq
grapeshot - 2 freq
greebs - 1 freq
graphics - 3 freq
grrrr-oppp-pischschschz - 1 freq
graabs - 1 freq
gravy's - 6 freq
graffs - 2 freq
grew-back - 1 freq
graff-stane - 1 freq
garvyauch - 1 freq
grooves - 1 freq
graufs - 1 freq
group's - 3 freq
garbage - 9 freq
grypes - 1 freq
grubs - 2 freq
garbeg - 2 freq
€˜garbage - 1 freq
gropes - 1 freq
gearboxes - 1 freq
graphocentrism - 1 freq
garbhcnoc - 2 freq
gervaise - 1 freq
MetaPhone code - KRFS
graves - 31 freq
curves - 10 freq
cairves - 2 freq
greves - 1 freq
grievous - 7 freq
grieves - 2 freq
griefs - 2 freq
crevice - 2 freq
greev's - 1 freq
craves - 3 freq
groves - 2 freq
grief's - 2 freq
graphs - 6 freq
grievious - 1 freq
gravy's - 6 freq
graffs - 2 freq
grooves - 1 freq
graufs - 1 freq
curfews - 2 freq
crevasse - 1 freq
craighouse - 1 freq
cruives - 1 freq
krvzi - 1 freq
cuervos - 1 freq
crieffys - 1 freq
GRAVES
Time to execute Levenshtein function - 0.206750 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.338127 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.028227 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.039406 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.001071 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.