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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
udny (0) - 9 freq
hudny (1) - 2 freq
urny (1) - 4 freq
cudna (2) - 165 freq
runny (2) - 2 freq
adna (2) - 1 freq
sony (2) - 3 freq
diy (2) - 9 freq
uno (2) - 1 freq
bunny (2) - 4 freq
wudni (2) - 4 freq
addy (2) - 6 freq
uqay (2) - 1 freq
cany (2) - 5 freq
duy (2) - 3 freq
usty (2) - 1 freq
iny (2) - 6 freq
-day (2) - 2 freq
ndna (2) - 8 freq
uy (2) - 4 freq
uni (2) - 53 freq
wurny (2) - 2 freq
adn (2) - 1 freq
bony (2) - 6 freq
didny (2) - 16 freq
udny (0) - 9 freq
adn (2) - 1 freq
dna (2) - 16 freq
deny (2) - 53 freq
adna (2) - 1 freq
dno (2) - 1 freq
hudny (2) - 2 freq
urny (2) - 4 freq
dunny (3) - 1 freq
dina (3) - 43 freq
dine (3) - 26 freq
miny (3) - 1 freq
upn (3) - 1 freq
lny (3) - 1 freq
unyo (3) - 1 freq
odin (3) - 43 freq
mony (3) - 1180 freq
dfy (3) - 1 freq
dana (3) - 1 freq
day (3) - 6020 freq
dun (3) - 36 freq
puny (3) - 1 freq
isny (3) - 6 freq
edin (3) - 4 freq
onny (3) - 3 freq
SoundEx code - U350
udny - 9 freq
MetaPhone code - UTN
udny - 9 freq
UDNY
Time to execute Levenshtein function - 0.308071 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.565469 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.027742 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.037315 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.000949 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.