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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
greghemphill (0) - 1 freq
grumpily (6) - 1 freq
treadmill (6) - 2 freq
whauphill (6) - 1 freq
pre-emptive (6) - 1 freq
sempill (6) - 3 freq
foresterhill (6) - 1 freq
grumphiel' (6) - 1 freq
creepily (6) - 1 freq
rosehill (6) - 3 freq
nethermill (6) - 1 freq
gregcapital (6) - 1 freq
grumphies (6) - 14 freq
treidmill (6) - 1 freq
greenwell (6) - 1 freq
sighthill (6) - 2 freq
redemption (6) - 4 freq
pre-emptit (6) - 1 freq
gregjmchugh (6) - 1 freq
meethill (6) - 1 freq
greenshield (6) - 1 freq
priesthill (6) - 35 freq
ggrumphie (6) - 1 freq
grumphin (6) - 2 freq
grumphie' (6) - 2 freq
greghemphill (0) - 1 freq
grumphiel' (9) - 1 freq
gregcapital (10) - 1 freq
ggrumphie (10) - 1 freq
grumphies (10) - 14 freq
sighthill (10) - 2 freq
grumphie (10) - 367 freq
gregjmchugh (10) - 1 freq
grumphin (10) - 2 freq
grumpily (10) - 1 freq
grumphie' (10) - 2 freq
whauphill (10) - 1 freq
rogmull (11) - 1 freq
craigmill (11) - 1 freq
grogipher (11) - 1 freq
eggshell (11) - 1 freq
granthumphries (11) - 2 freq
grumphed (11) - 8 freq
grumphie's (11) - 20 freq
saughtonhall (11) - 2 freq
gilmorehill (11) - 1 freq
graphical (11) - 4 freq
geographical (11) - 14 freq
grasp'll (11) - 1 freq
broomhall (11) - 1 freq
SoundEx code - G625
growesna - 1 freq
grassin - 2 freq
grassing - 1 freq
gruching - 1 freq
grazin - 11 freq
gruesome - 17 freq
garrison - 9 freq
gressmairket - 3 freq
grassmairket - 1 freq
grazins - 1 freq
garson - 2 freq
grassmarket's - 1 freq
gorgon - 3 freq
georgian - 4 freq
gressmercat - 3 freq
grecian - 1 freq
gorgin - 1 freq
growzn - 1 freq
gargonius - 1 freq
gherkin - 1 freq
garganta - 1 freq
grice-infant - 1 freq
gruesum - 4 freq
gorgonzola - 2 freq
gruesomely - 1 freq
grazings - 1 freq
greesan - 1 freq
grassmercat - 1 freq
grekin - 1 freq
grosjean - 1 freq
grushin - 1 freq
grassmarket - 4 freq
gorgons - 1 freq
girkin - 1 freq
gargunnock - 1 freq
gresham - 1 freq
gerkin - 1 freq
gerkins - 1 freq
georgina - 2 freq
girsin - 1 freq
grazing - 3 freq
grice-ingans - 1 freq
grassmerkit - 4 freq
grgn - 1 freq
greigmidd - 8 freq
greghunter - 1 freq
greachan - 5 freq
griezman - 1 freq
gerryhassan - 7 freq
garyjmoyes - 1 freq
georgemichael - 1 freq
greghemphill - 1 freq
gregjames - 1 freq
gracemaryk - 1 freq
gregmoodie - 1 freq
georgemwme - 1 freq
garrisoned - 1 freq
georgehunter - 1 freq
garyknox - 1 freq
garysma - 3 freq
gregjmchugh - 1 freq
MetaPhone code - KRFMFL
greghemphill - 1 freq
GREGHEMPHILL
Time to execute Levenshtein function - 0.209668 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.415402 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.028012 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.042920 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.000858 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.