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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
butif (0) - 1 freq
butch (2) - 4 freq
bultit (2) - 1 freq
bulin (2) - 1 freq
bitin (2) - 27 freq
bukin (2) - 1 freq
luif (2) - 34 freq
buit (2) - 32 freq
buttin (2) - 6 freq
bustit (2) - 2 freq
mutit (2) - 1 freq
huif (2) - 12 freq
buir (2) - 10 freq
buttir (2) - 2 freq
motif (2) - 1 freq
buff (2) - 15 freq
tif (2) - 1 freq
butes (2) - 2 freq
buid (2) - 6 freq
buty (2) - 3 freq
putit (2) - 2 freq
cutie (2) - 4 freq
itif (2) - 1 freq
batin (2) - 4 freq
but-in (2) - 1 freq
butif (0) - 1 freq
btf (2) - 8 freq
rutf (3) - 1 freq
beif (3) - 2 freq
buts (3) - 2 freq
batin (3) - 4 freq
beautifu (3) - 16 freq
itif (3) - 1 freq
baif (3) - 4 freq
but- (3) - 2 freq
but (3) - 13379 freq
buttie (3) - 2 freq
beautify (3) - 4 freq
but' (3) - 1 freq
butty (3) - 2 freq
buty (3) - 3 freq
bute (3) - 13 freq
butt (3) - 20 freq
butk (3) - 1 freq
motif (3) - 1 freq
buit (3) - 32 freq
buff (3) - 15 freq
bitin (3) - 27 freq
butes (3) - 2 freq
tif (3) - 1 freq
SoundEx code - B310
by-the-by - 1 freq
beautify - 4 freq
beautifu - 16 freq
bidef - 1 freq
'beautify' - 1 freq
beau-ootifu - 4 freq
beauti-fu - 1 freq
butif - 1 freq
beautyfu - 1 freq
bdp - 1 freq
bootbhoy - 2 freq
btv - 1 freq
baadp - 1 freq
btp - 1 freq
btf - 8 freq
MetaPhone code - BTF
beautify - 4 freq
beautifu - 16 freq
bidef - 1 freq
'beautify' - 1 freq
beau-ootifu - 4 freq
beauti-fu - 1 freq
butif - 1 freq
beautyfu - 1 freq
btv - 1 freq
btf - 8 freq
BUTIF
Time to execute Levenshtein function - 0.216633 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.394848 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.027767 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.040024 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.000912 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.