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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
heavily (0) - 9 freq
heavie (2) - 1 freq
wearily (2) - 1 freq
hazily (2) - 1 freq
heavin (2) - 18 freq
heevinly (2) - 2 freq
heavier (2) - 10 freq
healy (2) - 4 freq
readily (2) - 7 freq
heavit (2) - 2 freq
easily (2) - 60 freq
hertily (2) - 2 freq
heavenly (2) - 8 freq
haily (2) - 27 freq
heavies (2) - 5 freq
heavey (2) - 1 freq
heaving (2) - 1 freq
hevinly (2) - 1 freq
heavy (2) - 196 freq
peavly (2) - 4 freq
eardly (3) - 1 freq
heivenly (3) - 6 freq
dervil (3) - 1 freq
heving (3) - 1 freq
yearly (3) - 10 freq
heavily (0) - 9 freq
heavey (3) - 1 freq
haily (3) - 27 freq
heavenly (3) - 8 freq
hevinly (3) - 1 freq
heavy (3) - 196 freq
heavie (3) - 1 freq
peavly (3) - 4 freq
heavit (3) - 2 freq
heavies (3) - 5 freq
heevinly (3) - 2 freq
hazily (3) - 1 freq
heavier (3) - 10 freq
heavin (3) - 18 freq
healy (3) - 4 freq
hamil (4) - 2 freq
kevil (4) - 1 freq
helly (4) - 16 freq
heaves (4) - 2 freq
hayvul (4) - 1 freq
evil (4) - 90 freq
hevin (4) - 20 freq
he'il (4) - 5 freq
heal (4) - 27 freq
revile (4) - 3 freq
SoundEx code - H140
huffily - 3 freq
happily - 40 freq
hauflie - 1 freq
'hevylie - 1 freq
hayvul - 1 freq
heavily - 9 freq
howpfully - 6 freq
hoopful - 3 freq
habile - 6 freq
hovel - 4 freq
'hovel' - 1 freq
habble - 2 freq
happilie - 1 freq
howpfullie - 1 freq
hubble - 3 freq
habbil - 1 freq
hoopfully - 2 freq
hvl - 2 freq
MetaPhone code - HFL
huffily - 3 freq
highly - 17 freq
hauflie - 1 freq
'hevylie - 1 freq
hayvul - 1 freq
heavily - 9 freq
hovel - 4 freq
'hovel' - 1 freq
€˜highly - 1 freq
HEAVILY
Time to execute Levenshtein function - 0.197874 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.376564 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.027600 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.036867 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.000888 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.