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 doon-haunnelt in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
doon-haunnelt (0) - 8 freq
doon-haundelt (1) - 7 freq
door-haundle (4) - 1 freq
man-hannel (5) - 1 freq
doun-hauddit (5) - 1 freq
'doon-hauden' (5) - 1 freq
doon-haulin (5) - 1 freq
doonhauder (5) - 1 freq
foo-scunnert (5) - 1 freq
hook-haundit (5) - 17 freq
doonhauden (5) - 5 freq
haunnelt (5) - 1 freq
non-hamelt (5) - 2 freq
doon-unnér (5) - 1 freq
doun-hauden (5) - 2 freq
doon-here (6) - 1 freq
doonhamers (6) - 1 freq
doonhaudin (6) - 2 freq
doonhauds (6) - 6 freq
doo-manes (6) - 1 freq
nyow-fangelt (6) - 1 freq
open-haundit (6) - 1 freq
dounhauden (6) - 2 freq
hook-haunds (6) - 3 freq
doomfuntert (6) - 1 freq
doon-haunnelt (0) - 8 freq
doon-haundelt (2) - 7 freq
man-hannel (7) - 1 freq
door-haundle (7) - 1 freq
haunnelt (8) - 1 freq
non-hamelt (8) - 2 freq
doon-haulin (8) - 1 freq
doun-hauden (8) - 2 freq
doun-hauddit (8) - 1 freq
doon-hertit (9) - 3 freq
haunnilt (9) - 1 freq
doun-whummilt (9) - 1 freq
open-haundit (9) - 1 freq
doon-unnér (9) - 1 freq
'doon-hauden' (9) - 1 freq
doonhauden (9) - 5 freq
hook-haundit (9) - 17 freq
daunnert (10) - 5 freq
doonhairtit (10) - 3 freq
doonhertet (10) - 1 freq
onfankelt (10) - 1 freq
dwinnelt (10) - 1 freq
longannet (10) - 1 freq
ooncannily (10) - 1 freq
doun-hauddin (10) - 1 freq
SoundEx code - D554
domiunie'll - 1 freq
dòmhnullach - 1 freq
dòmhnall - 1 freq
doon-haunnelt - 8 freq
doun-whummilt - 1 freq
daemonologies - 1 freq
MetaPhone code - TNHNLT
doon-haunnelt - 8 freq
DOON-HAUNNELT
Time to execute Levenshtein function - 0.213811 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.386878 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.027567 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.037524 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.000803 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.