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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gravestanes (0) - 11 freq
gravestane (1) - 7 freq
gravestones (1) - 6 freq
gravestone (2) - 2 freq
graveslabs (3) - 1 freq
grunstanes (3) - 2 freq
gravesteen (3) - 1 freq
harestanes (3) - 1 freq
gravesteens (3) - 4 freq
hailstanes (4) - 2 freq
pradestant (4) - 1 freq
grandstand (4) - 1 freq
gravitas (4) - 2 freq
bravepages (4) - 1 freq
plainstanes (4) - 10 freq
brigstanes (4) - 1 freq
tradesman's (4) - 1 freq
flagstanes (4) - 2 freq
lairstanes (4) - 1 freq
graveyards (4) - 3 freq
grindstane (4) - 1 freq
gravitate (4) - 3 freq
rattlestanes (4) - 1 freq
snakestane (4) - 1 freq
graveside (4) - 1 freq
gravestanes (0) - 11 freq
gravestones (1) - 6 freq
gravestane (2) - 7 freq
gravesteens (3) - 4 freq
gravestone (3) - 2 freq
gravesteen (4) - 1 freq
grunstanes (4) - 2 freq
graveslabs (5) - 1 freq
harestanes (5) - 1 freq
brigstanes (6) - 1 freq
lairstanes (6) - 1 freq
grunstane (6) - 19 freq
gemstanes (6) - 1 freq
gravesend (6) - 1 freq
gravitas (6) - 2 freq
dray-stane (7) - 2 freq
gratins (7) - 1 freq
brigstones (7) - 1 freq
greetins (7) - 7 freq
protestants (7) - 3 freq
gravits (7) - 1 freq
govanstones (7) - 11 freq
gravity's (7) - 1 freq
milestanes (7) - 6 freq
drystones (7) - 1 freq
SoundEx code - G612
graves - 31 freq
gravesteen - 1 freq
gravesteens - 4 freq
gorbs - 1 freq
giraffes - 3 freq
grabs - 21 freq
grubbiest - 1 freq
greves - 1 freq
groups - 152 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
GRAVESTANES
Time to execute Levenshtein function - 0.221179 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.373093 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.028158 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.038116 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.000917 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.