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 ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to lumpit in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
lumpit (0) - 1 freq
slumpit (1) - 2 freq
dumpit (1) - 6 freq
pumpit (1) - 3 freq
jumpit (1) - 25 freq
lempit (1) - 2 freq
mumpit (1) - 2 freq
lampit (1) - 2 freq
bumpit (1) - 4 freq
humpit (1) - 1 freq
clumpit (1) - 1 freq
lumpin (1) - 1 freq
limpit (1) - 1 freq
luckit (2) - 1 freq
limpin (2) - 3 freq
bumpin (2) - 9 freq
ludgit (2) - 5 freq
lufit (2) - 1 freq
summit (2) - 54 freq
lampin (2) - 6 freq
mumpt (2) - 2 freq
pulpit (2) - 9 freq
lippit (2) - 2 freq
pupit (2) - 1 freq
pumpt (2) - 1 freq
lumpit (0) - 1 freq
lampit (1) - 2 freq
limpit (1) - 1 freq
lempit (1) - 2 freq
humpit (2) - 1 freq
lumpin (2) - 1 freq
bumpit (2) - 4 freq
clumpit (2) - 1 freq
limpet (2) - 5 freq
mumpit (2) - 2 freq
dumpit (2) - 6 freq
slumpit (2) - 2 freq
jumpit (2) - 25 freq
pumpit (2) - 3 freq
plumpt (3) - 1 freq
loppit (3) - 1 freq
dampit (3) - 1 freq
tempit (3) - 11 freq
laupit (3) - 1 freq
jimpit (3) - 5 freq
leipit (3) - 1 freq
jumpt (3) - 8 freq
lamplit (3) - 1 freq
jumpet (3) - 1 freq
lumpen (3) - 1 freq
SoundEx code - L513
limbed - 1 freq
lamb-pot - 1 freq
lambed - 2 freq
lempets - 2 freq
limpet - 5 freq
lampit - 2 freq
lamped - 2 freq
limpets - 2 freq
limpits - 1 freq
lumped - 2 freq
lumpots - 1 freq
lempit - 2 freq
lumpit - 1 freq
limped - 1 freq
lo-an-behaud - 1 freq
limpit - 1 freq
MetaPhone code - LMPT
lamb-pot - 1 freq
limpet - 5 freq
lampit - 2 freq
lamped - 2 freq
lumped - 2 freq
lempit - 2 freq
lumpit - 1 freq
limped - 1 freq
limpit - 1 freq
LUMPIT
Time to execute Levenshtein function - 0.273919 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.384360 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.029389 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.039738 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.001258 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.