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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ourdufc (0) - 1 freq
murdur (3) - 1 freq
urdu (3) - 17 freq
oerdue (3) - 1 freq
turriff (4) - 3 freq
dirdums (4) - 2 freq
mournfu (4) - 1 freq
nurdles (4) - 1 freq
wurds'r (4) - 1 freq
gourd (4) - 5 freq
curd (4) - 5 freq
oursel (4) - 2 freq
buddum (4) - 3 freq
usduyl (4) - 1 freq
ruft (4) - 1 freq
furrum (4) - 1 freq
lufc (4) - 2 freq
furdest (4) - 2 freq
sruc (4) - 1 freq
murders (4) - 8 freq
warddec (4) - 1 freq
owreum (4) - 1 freq
lourdes (4) - 2 freq
curlurs (4) - 1 freq
ouldir (4) - 1 freq
ourdufc (0) - 1 freq
dfc (5) - 2 freq
rfc (5) - 1 freq
ordance (5) - 1 freq
urdu (5) - 17 freq
oerdue (5) - 1 freq
rdf (5) - 3 freq
dunc (6) - 4 freq
rxruc (6) - 1 freq
ruff (6) - 12 freq
order (6) - 277 freq
nordic (6) - 9 freq
rufs (6) - 1 freq
dufv (6) - 1 freq
oardert (6) - 3 freq
ordnir (6) - 1 freq
exufc (6) - 1 freq
duff (6) - 24 freq
oardird (6) - 1 freq
gdsfc (6) - 1 freq
eidduc (6) - 1 freq
ogfc (6) - 1 freq
ordour (6) - 2 freq
orf (6) - 20 freq
cardiac (6) - 2 freq
SoundEx code - O631
orte-verlag - 2 freq
ower-dependent - 1 freq
owertappin - 1 freq
ourdufc - 1 freq
MetaPhone code - ORTFK
ourdufc - 1 freq
OURDUFC
Time to execute Levenshtein function - 0.218274 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.403847 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.028167 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.039303 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.000867 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.