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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
haudin-in (0) - 1 freq
haudin-on (1) - 1 freq
haunnin (3) - 1 freq
haunlin (3) - 5 freq
haudins (3) - 4 freq
hainin (3) - 20 freq
haudagain (3) - 1 freq
houdini (3) - 4 freq
hauding (3) - 1 freq
haudin' (3) - 1 freq
haunin (3) - 7 freq
haudin (3) - 380 freq
hauntin (3) - 4 freq
haundin (3) - 18 freq
haunnlin (3) - 1 freq
hardenin (3) - 2 freq
hauddin (3) - 2 freq
a'winnin (4) - 1 freq
wayfindin (4) - 1 freq
huirdin (4) - 1 freq
hunkin (4) - 1 freq
haunnit (4) - 2 freq
hintin (4) - 4 freq
hudin' (4) - 2 freq
gauins-on (4) - 1 freq
haudin-in (0) - 1 freq
haudin-on (1) - 1 freq
hardenin (5) - 2 freq
hauddin (5) - 2 freq
haunnlin (5) - 1 freq
haudendoon (5) - 1 freq
hauden-awa (5) - 1 freq
dun-in (5) - 1 freq
hidenin (5) - 1 freq
hauntin (5) - 4 freq
hauden-doon (5) - 1 freq
haundin (5) - 18 freq
haudin (5) - 380 freq
haudagain (5) - 1 freq
hainin (5) - 20 freq
haudins (5) - 4 freq
haunlin (5) - 5 freq
houdini (5) - 4 freq
haunnin (5) - 1 freq
haunin (5) - 7 freq
haudin' (5) - 1 freq
hauding (5) - 1 freq
houndin (6) - 2 freq
taen-in (6) - 1 freq
dauncin (6) - 28 freq
SoundEx code - H355
hatman - 1 freq
hodman - 1 freq
haudin-in - 1 freq
heidmen - 1 freq
hitmimer - 1 freq
haudin-on - 1 freq
huttonian - 1 freq
heidman - 1 freq
hidenin - 1 freq
hootenanny - 1 freq
MetaPhone code - HTNN
haudin-in - 1 freq
haudin-on - 1 freq
huttonian - 1 freq
heightenin - 1 freq
hidenin - 1 freq
hootenanny - 1 freq
HAUDIN-IN
Time to execute Levenshtein function - 0.230109 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.445318 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.029380 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.041132 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.001149 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.