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 hauf-happit in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
hauf-happit (0) - 2 freq
hauf-hertit (3) - 1 freq
half-shapit (3) - 1 freq
hauf-hopin (3) - 2 freq
hauf-hingit (3) - 1 freq
hauf-chackit (3) - 1 freq
hauf-naukit (3) - 2 freq
hauf-howped (4) - 1 freq
hauf-mast (4) - 3 freq
half-hoidit (4) - 1 freq
hauf-daft (4) - 1 freq
hauf-likit (4) - 1 freq
snaw-happit (4) - 2 freq
hauf-nyaakit (4) - 1 freq
hauf-myndit (4) - 1 freq
hauf-apen (4) - 2 freq
shawl-wappit (4) - 1 freq
weel-happit (4) - 3 freq
stiff-happit (4) - 1 freq
hauf-pint (4) - 1 freq
half-hoopin (4) - 2 freq
hauf-lit (4) - 4 freq
hauf-past (4) - 7 freq
hauf-spent (4) - 1 freq
hauf-biggit (4) - 2 freq
hauf-happit (0) - 2 freq
hauf-hingit (5) - 1 freq
hauf-hopin (5) - 2 freq
hauf-hertit (5) - 1 freq
hauf-spent (6) - 1 freq
hauf-past (6) - 7 freq
hauf-pint (6) - 1 freq
hauf-howped (6) - 1 freq
half-shapit (6) - 1 freq
hauf-chackit (6) - 1 freq
hauf-naukit (6) - 2 freq
weel-happit (6) - 3 freq
stiff-happit (7) - 1 freq
half-hoopin (7) - 2 freq
hauf-biggit (7) - 2 freq
hauf-empty (7) - 1 freq
hauf-lit (7) - 4 freq
hauf-likit (7) - 1 freq
hauf-daft (7) - 1 freq
half-hoidit (7) - 1 freq
snaw-happit (7) - 2 freq
hauf-mast (7) - 3 freq
hauf-myndit (7) - 1 freq
hauf-apen (7) - 2 freq
hauf-nyaakit (7) - 1 freq
SoundEx code - H113
hauf-happit - 2 freq
hippopotamus - 4 freq
heavy-fittit - 1 freq
hauf-howped - 1 freq
hbovftataj - 1 freq
MetaPhone code - HFHPT
hauf-happit - 2 freq
hauf-howped - 1 freq
HAUF-HAPPIT
Time to execute Levenshtein function - 0.349152 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.761591 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.039475 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.093257 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.001186 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.