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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
uisfu (0) - 2 freq
uisefu (1) - 7 freq
yisfu (1) - 7 freq
uissfu (1) - 18 freq
uiss (2) - 130 freq
usefu (2) - 10 freq
minfu (2) - 1 freq
wishfu (2) - 1 freq
yaisfu (2) - 1 freq
uisin (2) - 105 freq
sinfu (2) - 3 freq
uises (2) - 36 freq
liefu (2) - 1 freq
uis (2) - 17 freq
yissfu (2) - 2 freq
wilfu (2) - 1 freq
uiser (2) - 5 freq
fistfu (2) - 1 freq
uisge (2) - 5 freq
yisfi (2) - 2 freq
ussf (2) - 2 freq
uised (2) - 277 freq
yuissfu (2) - 3 freq
uise (2) - 281 freq
uisit (2) - 7 freq
uisfu (0) - 2 freq
yisfu (1) - 7 freq
uisefu (1) - 7 freq
yisfi (2) - 2 freq
usefu (2) - 10 freq
yaisfu (2) - 1 freq
uissfu (2) - 18 freq
uise (3) - 281 freq
yuissfu (3) - 3 freq
uised (3) - 277 freq
uisit (3) - 7 freq
ussf (3) - 2 freq
yaisefu (3) - 2 freq
usefy (3) - 1 freq
eesefu (3) - 3 freq
sif (3) - 4 freq
sfa (3) - 28 freq
uist (3) - 9 freq
sf (3) - 6 freq
liefu (3) - 1 freq
uiss (3) - 130 freq
uisin (3) - 105 freq
sinfu (3) - 3 freq
uis (3) - 17 freq
uisge (3) - 5 freq
SoundEx code - U210
uissfu - 18 freq
usefu - 10 freq
usefy - 1 freq
uisefu - 7 freq
'usquebae' - 1 freq
usp - 1 freq
usquebae - 1 freq
ukip - 13 freq
uissfae - 16 freq
ussf - 2 freq
usb - 2 freq
usbf - 14 freq
uisfu - 2 freq
uzp - 1 freq
ugb - 1 freq
uujp - 1 freq
ukszf - 1 freq
uggf - 1 freq
uqwve - 1 freq
usvbwi - 1 freq
MetaPhone code - USF
uissfu - 18 freq
usefu - 10 freq
usefy - 1 freq
uisefu - 7 freq
uissfae - 16 freq
ussf - 2 freq
uisfu - 2 freq
UISFU
Time to execute Levenshtein function - 0.184924 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.360137 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.027756 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.037131 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.