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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
matches (0) - 41 freq
watches (1) - 29 freq
patches (1) - 20 freq
catches (1) - 31 freq
ratches (1) - 1 freq
matched (1) - 8 freq
hatches (1) - 4 freq
latches (1) - 2 freq
marches (1) - 16 freq
pitches (2) - 14 freq
lauches (2) - 1 freq
matther (2) - 2 freq
ditches (2) - 8 freq
catchers (2) - 1 freq
mauchts (2) - 1 freq
mauchs (2) - 1 freq
mathews (2) - 1 freq
hatched (2) - 9 freq
catcher (2) - 2 freq
latched (2) - 2 freq
bathes (2) - 1 freq
taiches (2) - 1 freq
merches (2) - 2 freq
mitchel (2) - 1 freq
maths (2) - 32 freq
matches (0) - 41 freq
hatches (2) - 4 freq
marches (2) - 16 freq
watches (2) - 29 freq
matched (2) - 8 freq
latches (2) - 2 freq
patches (2) - 20 freq
ratches (2) - 1 freq
catches (2) - 31 freq
waatches (3) - 7 freq
matchin (3) - 16 freq
hutches (3) - 1 freq
maths (3) - 32 freq
paitches (3) - 1 freq
mitchel (3) - 1 freq
notches (3) - 1 freq
merches (3) - 2 freq
eitches (3) - 1 freq
matchit (3) - 1 freq
witches (3) - 35 freq
hitches (3) - 2 freq
metched (3) - 3 freq
match (3) - 174 freq
bitches (3) - 6 freq
ditches (3) - 8 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 - MXS
matches - 41 freq
mochs - 4 freq
mauchs - 1 freq
maeshies - 1 freq
mesha's - 1 freq
muchas - 1 freq
MATCHES
Time to execute Levenshtein function - 0.191078 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.359526 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.027443 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.036549 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.000804 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.