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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ebc (0) - 1 freq
elc (1) - 5 freq
abc (1) - 2 freq
ec (1) - 18 freq
ebb (1) - 26 freq
ebg (1) - 1 freq
bbc (1) - 174 freq
enc (1) - 1 freq
ebv (1) - 1 freq
tbc (1) - 4 freq
bc (1) - 21 freq
eec (1) - 2 freq
ebr (1) - 1 freq
sbc (1) - 1 freq
ecc (1) - 1 freq
efc (1) - 1 freq
etc (1) - 189 freq
lbc (1) - 1 freq
eb (1) - 6 freq
oqc (2) - 1 freq
egf (2) - 1 freq
gic (2) - 2 freq
wb (2) - 4 freq
tac (2) - 18 freq
eric (2) - 63 freq
ebc (0) - 1 freq
bc (1) - 21 freq
abc (1) - 2 freq
etc (2) - 189 freq
ecc (2) - 1 freq
eb (2) - 6 freq
efc (2) - 1 freq
bic (2) - 2 freq
bac (2) - 11 freq
bce (2) - 3 freq
bca (2) - 1 freq
sbc (2) - 1 freq
byc (2) - 1 freq
lbc (2) - 1 freq
ebg (2) - 1 freq
ebr (2) - 1 freq
ebb (2) - 26 freq
ec (2) - 18 freq
elc (2) - 5 freq
enc (2) - 1 freq
bbc (2) - 174 freq
tbc (2) - 4 freq
ebv (2) - 1 freq
eec (2) - 2 freq
jc (3) - 10 freq
SoundEx code - E120
eves - 1 freq
effeck - 36 freq
epic - 20 freq
evoke - 3 freq
eevees - 1 freq
effecks - 21 freq
ebc - 1 freq
ee-baws - 1 freq
effie's - 1 freq
ebbs - 5 freq
effek - 4 freq
eyebas - 1 freq
effeks - 1 freq
eaves - 2 freq
evacuee - 1 freq
ep's - 2 freq
efuc - 1 freq
evfejh - 1 freq
ebbe’s - 1 freq
evoc - 1 freq
eifgw - 1 freq
efj - 1 freq
evz - 1 freq
ebka - 1 freq
eeweeehvoq - 1 freq
ebswe - 1 freq
epusgw - 1 freq
eiwahhwyfx - 1 freq
efc - 1 freq
effies - 1 freq
ebg - 1 freq
evoygu - 1 freq
MetaPhone code - EBK
ebc - 1 freq
ebka - 1 freq
ebg - 1 freq
EBC
Time to execute Levenshtein function - 0.260344 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.440076 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.028645 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.039927 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.000823 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.