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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
grampus (0) - 1 freq
grampa's (2) - 2 freq
ramps (2) - 2 freq
grampa (2) - 8 freq
campus (2) - 5 freq
tramps (2) - 7 freq
rumpus (2) - 1 freq
cramps (2) - 3 freq
gapus (2) - 1 freq
tramp's (2) - 1 freq
graphs (2) - 6 freq
graupius (2) - 4 freq
grams (2) - 2 freq
grapes (2) - 23 freq
rampur (2) - 1 freq
graips (2) - 3 freq
gappus (2) - 3 freq
grains (3) - 11 freq
grampians (3) - 2 freq
crampit (3) - 2 freq
grapple (3) - 2 freq
orams (3) - 1 freq
graspit (3) - 3 freq
granut (3) - 1 freq
gropes (3) - 1 freq
grampus (0) - 1 freq
graupius (3) - 4 freq
grams (3) - 2 freq
grapes (3) - 23 freq
graips (3) - 3 freq
rumpus (3) - 1 freq
cramps (3) - 3 freq
tramps (3) - 7 freq
grampa (3) - 8 freq
grampa's (3) - 2 freq
ramps (3) - 2 freq
gromits (4) - 4 freq
gropes (4) - 1 freq
grumpyo (4) - 1 freq
grump (4) - 3 freq
grumpy (4) - 10 freq
grumph (4) - 15 freq
grypes (4) - 1 freq
grampian (4) - 11 freq
trumps (4) - 8 freq
gimps (4) - 4 freq
grips (4) - 18 freq
grampians (4) - 2 freq
graphs (4) - 6 freq
rampur (4) - 1 freq
SoundEx code - G651
granfaithers - 1 freq
granfaither - 38 freq
grumphie - 367 freq
grown-up - 9 freq
granbairns - 11 freq
growen-up - 7 freq
growen-ups - 22 freq
'growen-ups - 1 freq
grumble - 9 freq
growin-up - 1 freq
grumph - 15 freq
ggrumphie - 1 freq
'grumphie' - 1 freq
grumphies - 15 freq
grumphie-bairn - 2 freq
graunparent's - 1 freq
grumfies - 2 freq
grumfie - 1 freq
grewn-up - 1 freq
grampian - 11 freq
grumblit - 1 freq
graunbairn - 4 freq
graunfaither - 6 freq
granflaith - 2 freq
grumpy - 10 freq
grumphie's - 20 freq
girnie-faced - 1 freq
grumphed - 8 freq
grimfaced - 1 freq
grumbelt - 1 freq
grampa - 8 freq
grumblin - 1 freq
grown-ups - 12 freq
grim-faced - 2 freq
grampus - 1 freq
grumpily - 1 freq
grumbles - 2 freq
grumphiel' - 1 freq
grumphie' - 2 freq
grumpbhie - 1 freq
grumphie''s - 1 freq
grumpie - 1 freq
grumbled - 2 freq
grienie-bloo - 1 freq
groun-up - 1 freq
grump - 3 freq
gruein-blate - 1 freq
green-bay - 1 freq
greenflees - 3 freq
greenwife - 1 freq
grumphin - 2 freq
grumphieman - 11 freq
grumphiehoose - 3 freq
greeny-broun - 1 freq
granfather - 1 freq
grampians - 2 freq
granfaither's - 3 freq
granfither - 1 freq
greenfield's - 2 freq
green-faced - 1 freq
grampa's - 2 freq
grumphie-sty - 1 freq
granny-wifey - 1 freq
granpa - 1 freq
grönivoe - 1 freq
greenpeace - 1 freq
greenfly - 2 freq
greenflees' - 1 freq
greenfield - 2 freq
granpaurent - 5 freq
growne-ups - 1 freq
€˜grumpy - 1 freq
greenbank - 1 freq
greenbanks - 10 freq
grenbanks - 1 freq
grumfy - 1 freq
grownups - 1 freq
grampianpolice - 1 freq
granpaw - 1 freq
gerryinaberdeen - 28 freq
greenfinch - 1 freq
grumpyo - 1 freq
grumpian - 4 freq
graemepercy - 2 freq
grumpyhatlady - 2 freq
grumpygoth - 1 freq
MetaPhone code - KRMPS
cramps - 3 freq
grampus - 1 freq
grampa's - 2 freq
GRAMPUS
Time to execute Levenshtein function - 0.268269 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.443657 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.028249 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.042562 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.000878 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.