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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
mudgos (0) - 1 freq
mudges (1) - 1 freq
mungo's (2) - 1 freq
murgis (2) - 1 freq
smudges (2) - 2 freq
midges (2) - 26 freq
mungo (2) - 7 freq
mudgit (2) - 1 freq
mudge (2) - 2 freq
mangos (2) - 1 freq
nudges (2) - 4 freq
judges (2) - 19 freq
mug's (2) - 1 freq
fudges (2) - 2 freq
munros (2) - 1 freq
mutos (2) - 1 freq
mudged (2) - 1 freq
mugs (2) - 17 freq
murdos (2) - 1 freq
ludges (2) - 2 freq
mudgies (2) - 1 freq
kudos (2) - 2 freq
sudgers (3) - 5 freq
mungin (3) - 2 freq
ougo (3) - 1 freq
mudgos (0) - 1 freq
mudges (1) - 1 freq
midges (2) - 26 freq
mudgies (2) - 1 freq
fudges (3) - 2 freq
judges (3) - 19 freq
mudged (3) - 1 freq
ludges (3) - 2 freq
midgies (3) - 20 freq
nudges (3) - 4 freq
mugs (3) - 17 freq
mudgit (3) - 1 freq
smudges (3) - 2 freq
murgis (3) - 1 freq
mangos (3) - 1 freq
mudge (3) - 2 freq
midge (4) - 10 freq
gadges (4) - 1 freq
madras (4) - 1 freq
juidges (4) - 1 freq
megs (4) - 2 freq
mingus (4) - 1 freq
midget (4) - 6 freq
ledges (4) - 3 freq
modals (4) - 4 freq
SoundEx code - M322
matches - 41 freq
midges - 26 freq
mudchucks - 2 freq
motoguzzi - 1 freq
midges' - 1 freq
midgies - 20 freq
match-stick - 1 freq
mudgos - 1 freq
matchstick - 1 freq
mudgies - 1 freq
médicis - 1 freq
mitchison - 4 freq
mutchkin - 1 freq
mudges - 1 freq
mmtkyjr - 1 freq
mdzyjyvtrl - 1 freq
mwydzuk - 1 freq
meatsack - 1 freq
mdtyewcukz - 1 freq
MetaPhone code - MTKS
motoguzzi - 1 freq
mudgos - 1 freq
medics - 4 freq
MUDGOS
Time to execute Levenshtein function - 0.273341 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.484030 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.035981 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.049488 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.001018 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.