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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dredfu (0) - 1 freq
dreidfu (1) - 20 freq
dreadfu (1) - 7 freq
reefu (2) - 1 freq
needfu (2) - 12 freq
'dreidfu (2) - 1 freq
dredge (2) - 2 freq
dredd (2) - 6 freq
dreadful (2) - 5 freq
dreef (2) - 4 freq
heedfu (2) - 1 freq
edfu (2) - 1 freq
drench (3) - 1 freq
derf (3) - 2 freq
dream' (3) - 1 freq
dredger (3) - 1 freq
myndfu (3) - 1 freq
dreink (3) - 2 freq
drewn (3) - 2 freq
fred (3) - 26 freq
mindfu (3) - 6 freq
dress (3) - 98 freq
redin (3) - 2 freq
'redd (3) - 1 freq
refs (3) - 6 freq
dredfu (0) - 1 freq
dreadfu (1) - 7 freq
dreidfu (1) - 20 freq
dreef (3) - 4 freq
dreidfae (3) - 2 freq
dreadful (3) - 5 freq
dredd (3) - 6 freq
dredge (3) - 2 freq
'dreidfu (3) - 1 freq
dreid (4) - 51 freq
dried (4) - 74 freq
dryed (4) - 4 freq
dreidit (4) - 5 freq
dreided (4) - 4 freq
dread (4) - 34 freq
dreidour (4) - 1 freq
dreadin (4) - 9 freq
dreeded (4) - 2 freq
pridefu (4) - 6 freq
draed (4) - 1 freq
rdf (4) - 3 freq
dryden (4) - 2 freq
dreidin (4) - 4 freq
drf (4) - 1 freq
dreadit (4) - 1 freq
SoundEx code - D631
dreadfu - 7 freq
dreidfu - 20 freq
dartboord - 1 freq
dried-up - 2 freq
dirtyfair - 1 freq
'dreidfu - 1 freq
dartboard - 1 freq
dreidfae - 2 freq
dreadfully - 2 freq
dreadful - 5 freq
derthfu - 1 freq
dare-deevils - 1 freq
dirthope - 1 freq
dredfu - 1 freq
MetaPhone code - TRTF
dreadfu - 7 freq
dreidfu - 20 freq
'dreidfu - 1 freq
dreidfae - 2 freq
tartuffe - 15 freq
dredfu - 1 freq
DREDFU
Time to execute Levenshtein function - 0.226109 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.376424 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.030629 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.038464 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.000933 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.