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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
maple (0) - 6 freq
mable (1) - 2 freq
aple (1) - 2 freq
maples (1) - 1 freq
marple (1) - 2 freq
male (1) - 59 freq
saule (2) - 2 freq
mailed (2) - 2 freq
manse (2) - 19 freq
gape (2) - 4 freq
marled (2) - 2 freq
marlex (2) - 1 freq
lapse (2) - 2 freq
maave (2) - 4 freq
dapple (2) - 2 freq
yable (2) - 7 freq
maalie (2) - 7 freq
madge (2) - 9 freq
staple (2) - 6 freq
make (2) - 649 freq
aiple (2) - 5 freq
marl (2) - 1 freq
mle (2) - 1 freq
papple (2) - 1 freq
mxpie (2) - 1 freq
maple (0) - 6 freq
ample (2) - 9 freq
mable (2) - 2 freq
marple (2) - 2 freq
male (2) - 59 freq
maples (2) - 1 freq
aple (2) - 2 freq
mappey (3) - 2 freq
maipil (3) - 1 freq
meyle (3) - 1 freq
apple (3) - 30 freq
mail (3) - 54 freq
mille (3) - 1 freq
pale (3) - 88 freq
mael (3) - 2 freq
mal (3) - 2 freq
mall (3) - 4 freq
mile (3) - 278 freq
mule (3) - 4 freq
maol (3) - 1 freq
sample (3) - 20 freq
merle (3) - 5 freq
mallae (3) - 4 freq
mappa (3) - 1 freq
mailie (3) - 3 freq
SoundEx code - M140
mabel - 91 freq
mobile - 57 freq
maple - 6 freq
maybole - 1 freq
muffle - 4 freq
movilla - 3 freq
mayfly - 1 freq
mobil - 1 freq
maipil - 1 freq
mbl - 1 freq
mable - 2 freq
MetaPhone code - MPL
maple - 6 freq
maipil - 1 freq
MAPLE
Time to execute Levenshtein function - 0.177788 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.340548 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.027998 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.041396 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.000927 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.