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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
grauf (0) - 3 freq
graaf (1) - 1 freq
graff (1) - 4 freq
graf (1) - 1 freq
graufs (1) - 1 freq
graun (1) - 9 freq
graif (1) - 3 freq
giaur (2) - 1 freq
grand (2) - 363 freq
gau (2) - 2 freq
grcu (2) - 1 freq
grun (2) - 422 freq
fraud (2) - 5 freq
gruff (2) - 16 freq
gras (2) - 5 freq
graet (2) - 39 freq
groof (2) - 1 freq
graze (2) - 9 freq
grape (2) - 8 freq
graat (2) - 5 freq
frau (2) - 1 freq
grif (2) - 1 freq
grals (2) - 1 freq
grou (2) - 11 freq
grats (2) - 1 freq
grauf (0) - 3 freq
graif (1) - 3 freq
graaf (1) - 1 freq
graf (1) - 1 freq
groof (2) - 1 freq
agrouf (2) - 2 freq
grif (2) - 1 freq
grief (2) - 113 freq
graufs (2) - 1 freq
graff (2) - 4 freq
graun (2) - 9 freq
greef (2) - 1 freq
grut (3) - 1 freq
gaff (3) - 34 freq
grait (3) - 1 freq
graen (3) - 1 freq
grace (3) - 155 freq
graan (3) - 14 freq
grail (3) - 4 freq
grado (3) - 1 freq
groun (3) - 7 freq
group (3) - 346 freq
grup (3) - 52 freq
grave (3) - 130 freq
gaur (3) - 8 freq
SoundEx code - G610
grip - 125 freq
grave - 130 freq
grab - 114 freq
grief - 113 freq
gravy - 28 freq
graff - 4 freq
grove - 21 freq
grup - 52 freq
group - 346 freq
gripe - 5 freq
grippy - 9 freq
grippie - 7 freq
grauf - 3 freq
graip - 5 freq
grieve - 53 freq
groove - 1 freq
gruff - 16 freq
grape - 8 freq
grub - 39 freq
greef - 1 freq
groof - 1 freq
garvey - 1 freq
giraffe - 12 freq
graf - 1 freq
grubby - 2 freq
gruppie - 2 freq
greba - 8 freq
'grip - 1 freq
grevy - 1 freq
garvie - 1 freq
grippy' - 1 freq
grabbie - 3 freq
greff - 6 freq
'group - 1 freq
graph - 4 freq
grappa - 3 freq
garb - 4 freq
groovy - 2 freq
groop - 1 freq
grav - 2 freq
greep - 1 freq
groupie - 3 freq
gruip - 1 freq
greve - 2 freq
graif - 3 freq
grefe - 2 freq
gruppy - 1 freq
geraff - 1 freq
greyabbey - 2 freq
grupp - 2 freq
gerrup - 1 freq
garybhoy - 3 freq
grif - 1 freq
“grab - 1 freq
greeba - 1 freq
'greba' - 1 freq
garyb - 2 freq
graaf - 1 freq
grv - 1 freq
grabby - 1 freq
gorb - 1 freq
MetaPhone code - KRF
grave - 130 freq
criv - 2 freq
grief - 113 freq
gravy - 28 freq
graff - 4 freq
grove - 21 freq
crave - 13 freq
curve - 24 freq
kirov' - 1 freq
grauf - 3 freq
crieff - 7 freq
grieve - 53 freq
groove - 1 freq
gruff - 16 freq
greef - 1 freq
groof - 1 freq
garvey - 1 freq
graf - 1 freq
curvy - 3 freq
curfew - 2 freq
carefu - 23 freq
grevy - 1 freq
garvie - 1 freq
corragh - 1 freq
greff - 6 freq
kerve - 5 freq
graph - 4 freq
carve - 5 freq
groovy - 2 freq
grav - 2 freq
carefou - 1 freq
carefu' - 1 freq
greve - 2 freq
graif - 3 freq
grefe - 2 freq
cruive - 1 freq
curragh - 1 freq
grif - 1 freq
corfu - 3 freq
cairve - 1 freq
cuervo - 1 freq
crieffy - 1 freq
graaf - 1 freq
grv - 1 freq
kerav - 1 freq
craufy - 1 freq
GRAUF
Time to execute Levenshtein function - 0.225816 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.394892 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.037791 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.050919 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.001051 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.