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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
williemoir (0) - 2 freq
williejohn (3) - 23 freq
willpooer (4) - 1 freq
willies (4) - 6 freq
williams (4) - 32 freq
wulliesoot (4) - 1 freq
william (4) - 239 freq
yillmuir (4) - 8 freq
willreid (4) - 13 freq
willie's (4) - 22 freq
williams' (4) - 3 freq
kirriemuir (4) - 5 freq
willintlie (4) - 2 freq
dillier (4) - 1 freq
willie (4) - 197 freq
williame (4) - 1 freq
willem (4) - 1 freq
billiehood (4) - 1 freq
william' (4) - 4 freq
willie’s (4) - 1 freq
williamson (4) - 15 freq
william's (4) - 2 freq
williamhill (4) - 1 freq
williew (4) - 1 freq
williewaugh (5) - 1 freq
williemoir (0) - 2 freq
yillmuir (5) - 8 freq
williame (5) - 1 freq
william' (5) - 4 freq
william (5) - 239 freq
willem (5) - 1 freq
willpooer (5) - 1 freq
williams (5) - 32 freq
william's (6) - 2 freq
weilliam (6) - 1 freq
williamson (6) - 15 freq
wulliesoot (6) - 1 freq
williew (6) - 1 freq
waller (6) - 1 freq
wulliam (6) - 10 freq
willum' (6) - 1 freq
willamina (6) - 1 freq
williejohn (6) - 23 freq
wulliam' (6) - 1 freq
willreid (6) - 13 freq
williams' (6) - 3 freq
willie's (6) - 22 freq
dillier (6) - 1 freq
willum (6) - 5 freq
willie (6) - 197 freq
SoundEx code - W456
walmart - 1 freq
williemoir - 2 freq
MetaPhone code - WLMR
williemoir - 2 freq
WILLIEMOIR
Time to execute Levenshtein function - 0.208370 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.387480 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.028667 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.040868 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.001176 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.