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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
imf (0) - 2 freq
ime (1) - 1 freq
imp (1) - 3 freq
mf (1) - 1 freq
imn (1) - 2 freq
rmf (1) - 1 freq
zmf (1) - 1 freq
if (1) - 5844 freq
imo (1) - 44 freq
igf (1) - 1 freq
im' (1) - 1 freq
iof (1) - 1 freq
ima (1) - 1 freq
im (1) - 370 freq
kmf (1) - 1 freq
jm (2) - 57 freq
iel (2) - 1 freq
ml (2) - 12 freq
waf (2) - 1 freq
hms (2) - 8 freq
sim (2) - 43 freq
sime (2) - 1 freq
f (2) - 187 freq
rdf (2) - 3 freq
ik (2) - 8 freq
imf (0) - 2 freq
mf (1) - 1 freq
ima (2) - 1 freq
iof (2) - 1 freq
kmf (2) - 1 freq
mef (2) - 2 freq
mfi (2) - 1 freq
emyf (2) - 1 freq
im' (2) - 1 freq
im (2) - 370 freq
imn (2) - 2 freq
igf (2) - 1 freq
ime (2) - 1 freq
rmf (2) - 1 freq
imp (2) - 3 freq
imo (2) - 44 freq
if (2) - 5844 freq
zmf (2) - 1 freq
amd (3) - 2 freq
emz (3) - 4 freq
imna (3) - 1 freq
ifo (3) - 1 freq
laf (3) - 1 freq
odf (3) - 1 freq
bf (3) - 6 freq
SoundEx code - I510
inby - 69 freq
inbye - 66 freq
info - 35 freq
imp - 3 freq
inaby - 2 freq
invy - 2 freq
invie - 1 freq
in-bye - 1 freq
imph - 1 freq
imbue - 1 freq
inbi - 1 freq
imf - 2 freq
inuff - 1 freq
infy - 1 freq
inov - 1 freq
MetaPhone code - IMF
imph - 1 freq
imf - 2 freq
IMF
Time to execute Levenshtein function - 0.597386 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.897743 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.031379 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.094940 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.000817 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.