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 ever-lastin in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ever-lastin (0) - 1 freq
everlastin (1) - 3 freq
everlestin (2) - 1 freq
everlasting (2) - 1 freq
iverlastin (2) - 4 freq
iverlaistin (3) - 1 freq
iver-hantin (3) - 1 freq
iver-lovin (4) - 1 freq
aye-lestin (4) - 1 freq
ever-changin (4) - 1 freq
lang-lastin (4) - 1 freq
iver-risin (4) - 1 freq
ivverlestin (4) - 3 freq
overlappin (4) - 2 freq
ivverlaistin (4) - 1 freq
exerceesin (5) - 1 freq
exertin (5) - 1 freq
revertin (5) - 2 freq
operatin (5) - 9 freq
mercatin (5) - 4 freq
everhin (5) - 1 freq
dlastin (5) - 1 freq
feastin (5) - 17 freq
owerlappin (5) - 3 freq
hervestin (5) - 1 freq
ever-lastin (0) - 1 freq
everlastin (2) - 3 freq
iverlastin (3) - 4 freq
everlestin (3) - 1 freq
iverlaistin (4) - 1 freq
everlasting (4) - 1 freq
iver-hantin (5) - 1 freq
iver-risin (6) - 1 freq
ivverlaistin (6) - 1 freq
iver-lovin (6) - 1 freq
aye-lestin (6) - 1 freq
ivverlestin (6) - 3 freq
overlappin (7) - 2 freq
lang-lastin (7) - 1 freq
over-rated (8) - 1 freq
terestin (8) - 1 freq
ower-suin (8) - 1 freq
hert-liftin (8) - 1 freq
tree-plantin (8) - 1 freq
tart-tastin (8) - 1 freq
enlistin (8) - 1 freq
revelation (8) - 27 freq
lang-lestin (8) - 1 freq
blastin (8) - 11 freq
avertin (8) - 1 freq
SoundEx code - E164
ever-lastin - 1 freq
everlastin - 3 freq
epril - 1 freq
everlestin - 1 freq
everilk - 1 freq
everly - 1 freq
everlasting - 1 freq
MetaPhone code - EFRLSTN
ever-lastin - 1 freq
everlastin - 3 freq
everlestin - 1 freq
EVER-LASTIN
Time to execute Levenshtein function - 0.228096 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.378446 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.027455 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.037231 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.000852 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.