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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
calflie (0) - 1 freq
calfie (1) - 8 freq
callie (1) - 1 freq
calorie (2) - 1 freq
alfie (2) - 28 freq
sauflie (2) - 1 freq
hauflie (2) - 1 freq
halflin (2) - 14 freq
dallie (2) - 13 freq
coallie (2) - 4 freq
lallie (2) - 1 freq
galilie (2) - 2 freq
collie (2) - 27 freq
callin (2) - 30 freq
halplie (2) - 1 freq
hallie (2) - 1 freq
calle (2) - 2 freq
calfies (2) - 4 freq
allie (2) - 9 freq
wallie (2) - 25 freq
callit (2) - 3 freq
carlie (2) - 2 freq
cattlie (2) - 2 freq
callier (2) - 1 freq
cairnie (3) - 2 freq
calflie (0) - 1 freq
callie (2) - 1 freq
calfie (2) - 8 freq
calle (3) - 2 freq
calfies (3) - 4 freq
collie (3) - 27 freq
coallie (3) - 4 freq
calfes (4) - 1 freq
clairlie (4) - 4 freq
calf (4) - 12 freq
callier (4) - 1 freq
cattlie (4) - 2 freq
calfan (4) - 1 freq
calmly (4) - 16 freq
carlie (4) - 2 freq
claerlie (4) - 3 freq
calerlee (4) - 1 freq
calloo (4) - 2 freq
culfin (4) - 1 freq
call (4) - 220 freq
clelia (4) - 5 freq
halflin (4) - 14 freq
sauflie (4) - 1 freq
dallie (4) - 13 freq
hauflie (4) - 1 freq
SoundEx code - C414
chilblains - 6 freq
caulfield - 1 freq
caaliflooer - 1 freq
caauliflooer - 1 freq
clpl - 9 freq
coal-black - 1 freq
cauliflooer - 2 freq
caulifloor - 8 freq
cleveland - 1 freq
calflie - 1 freq
coll-black - 1 freq
cauliflouer - 1 freq
calpol - 1 freq
colbaltsouljournal - 1 freq
MetaPhone code - KLFL
gleefully - 6 freq
gleeful - 2 freq
kalevala - 1 freq
calflie - 1 freq
CALFLIE
Time to execute Levenshtein function - 0.274714 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.414974 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.027621 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.037049 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.000899 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.