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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
leeves (0) - 19 freq
laeves (1) - 16 freq
leives (1) - 3 freq
leevels (1) - 1 freq
meeves (1) - 1 freq
leaves (1) - 208 freq
deeves (1) - 1 freq
leeve (1) - 81 freq
leeven (1) - 2 freq
jeeves (1) - 3 freq
sleeves (1) - 27 freq
leeved (1) - 55 freq
reeves (1) - 5 freq
cleeves (1) - 1 freq
heevens (2) - 16 freq
fleeces (2) - 8 freq
heezes (2) - 5 freq
eves (2) - 1 freq
peever (2) - 1 freq
leive (2) - 25 freq
leeted (2) - 1 freq
sleaves (2) - 1 freq
lemes (2) - 2 freq
lieges (2) - 1 freq
reives (2) - 2 freq
leeves (0) - 19 freq
leives (1) - 3 freq
leaves (1) - 208 freq
laeves (1) - 16 freq
levies (2) - 1 freq
elves (2) - 10 freq
lyves (2) - 1 freq
laves (2) - 3 freq
lives (2) - 241 freq
luves (2) - 16 freq
loaves (2) - 5 freq
loves (2) - 68 freq
cleeves (2) - 1 freq
leeve (2) - 81 freq
deeves (2) - 1 freq
meeves (2) - 1 freq
leevels (2) - 1 freq
jeeves (2) - 3 freq
leeven (2) - 2 freq
reeves (2) - 5 freq
leeved (2) - 55 freq
sleeves (2) - 27 freq
leevit (3) - 4 freq
leefs (3) - 1 freq
lieve (3) - 1 freq
SoundEx code - L120
lives - 241 freq
leafs - 43 freq
lips - 198 freq
leaves - 208 freq
loofs - 6 freq
life's - 64 freq
laifs - 2 freq
luves - 16 freq
leeves - 19 freq
love's - 12 freq
loves - 68 freq
loups - 6 freq
laps - 7 freq
lifes - 48 freq
lowps - 29 freq
laves - 3 freq
leaps - 7 freq
luve's - 5 freq
lavvies - 10 freq
loabbies - 5 freq
lobby's - 1 freq
lyfe's - 4 freq
lyfis - 1 freq
levies - 1 freq
lobbies - 3 freq
luve''s - 1 freq
lapis - 1 freq
lobs - 2 freq
lyves - 1 freq
lavish - 2 freq
leps - 1 freq
luvs - 11 freq
loops - 4 freq
lippies - 1 freq
lawvies - 1 freq
loafs - 9 freq
'life's - 1 freq
loofache - 1 freq
lyf's - 1 freq
laeves - 16 freq
labs - 3 freq
laefs - 2 freq
leave's - 1 freq
löfs - 1 freq
lups - 1 freq
lawfowk - 1 freq
libs - 1 freq
lævs - 1 freq
luifs - 5 freq
lifcs - 1 freq
leefs - 1 freq
leifs - 3 freq
loufs - 1 freq
luipkie - 1 freq
leives - 3 freq
lovies - 1 freq
€˜lips - 2 freq
livvy's - 3 freq
liv's - 1 freq
lavvy's - 1 freq
lubeck - 2 freq
loaves - 5 freq
lapse - 2 freq
lives' - 1 freq
lhfic - 1 freq
llfox - 1 freq
lepps - 1 freq
lifeÂ’s - 2 freq
labs' - 1 freq
lbc - 1 freq
lbk - 1 freq
lvsz - 1 freq
lepucy - 1 freq
leaves' - 1 freq
lvg - 1 freq
lfc - 4 freq
lufc - 2 freq
livvys - 1 freq
lbx - 1 freq
lvfeze - 1 freq
MetaPhone code - LFS
lives - 241 freq
leafs - 43 freq
leaves - 208 freq
loofs - 6 freq
life's - 64 freq
laifs - 2 freq
luves - 16 freq
leeves - 19 freq
love's - 12 freq
loves - 68 freq
laughs - 60 freq
lifes - 48 freq
laves - 3 freq
luve's - 5 freq
lavvies - 10 freq
lyfe's - 4 freq
lyfis - 1 freq
levies - 1 freq
luve''s - 1 freq
lyves - 1 freq
luvs - 11 freq
lawvies - 1 freq
loafs - 9 freq
'life's - 1 freq
lyf's - 1 freq
laeves - 16 freq
laaghs - 3 freq
laefs - 2 freq
leave's - 1 freq
löfs - 1 freq
loghs - 1 freq
lævs - 1 freq
luifs - 5 freq
leefs - 1 freq
leifs - 3 freq
loufs - 1 freq
leives - 3 freq
lovies - 1 freq
livvy's - 3 freq
liv's - 1 freq
lavvy's - 1 freq
loaves - 5 freq
lives' - 1 freq
lifeÂ’s - 2 freq
leaves' - 1 freq
livvys - 1 freq
LEEVES
Time to execute Levenshtein function - 0.178094 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.323820 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.027799 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.037069 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.