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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gravestones (0) - 6 freq
gravestanes (1) - 11 freq
gravestone (1) - 2 freq
gravestane (2) - 7 freq
gravesteen (3) - 1 freq
gravesteens (3) - 4 freq
grandsons (4) - 6 freq
drystones (4) - 1 freq
raesons (4) - 6 freq
harestanes (4) - 1 freq
hailstones (4) - 1 freq
rune-stones (4) - 1 freq
brigstones (4) - 1 freq
gladstone (4) - 2 freq
grandson's (4) - 1 freq
grunstanes (4) - 2 freq
govanstones (4) - 11 freq
graveslabs (4) - 1 freq
¬‚agstones (4) - 1 freq
flagstones (4) - 2 freq
graveside (4) - 1 freq
gravesend (4) - 1 freq
restores (4) - 1 freq
waterstones (4) - 4 freq
intestines (5) - 1 freq
gravestones (0) - 6 freq
gravestanes (1) - 11 freq
gravestone (2) - 2 freq
gravesteens (3) - 4 freq
gravestane (3) - 7 freq
gravesteen (4) - 1 freq
grunstanes (5) - 2 freq
govanstones (6) - 11 freq
graveslabs (6) - 1 freq
brigstones (6) - 1 freq
gravesend (6) - 1 freq
harestanes (6) - 1 freq
drystones (6) - 1 freq
gradations (7) - 1 freq
gemstanes (7) - 1 freq
proveisions (7) - 2 freq
gravitas (7) - 2 freq
brigstanes (7) - 1 freq
greetins (7) - 6 freq
gravits (7) - 1 freq
gravity's (7) - 1 freq
proveisons (7) - 1 freq
lairstanes (7) - 1 freq
reveesions (7) - 1 freq
proveesions (7) - 9 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 - KRFSTNS
gravesteens - 4 freq
gravestanes - 11 freq
gravestones - 6 freq
GRAVESTONES
Time to execute Levenshtein function - 0.253948 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.387938 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.035721 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.037685 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.000838 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.