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 ahint

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to fuspert in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
fuspert (0) - 7 freq
fuspers (1) - 1 freq
fusper (1) - 18 freq
fusper't (1) - 1 freq
frustert (2) - 2 freq
funnert (2) - 2 freq
despert (2) - 4 freq
fostert (2) - 1 freq
rupert (2) - 17 freq
suspect (2) - 22 freq
fuskers (2) - 21 freq
ushert (2) - 3 freq
fushers (2) - 1 freq
fasert (2) - 1 freq
fusker (2) - 1 freq
dispert (2) - 2 freq
fuspered (2) - 22 freq
whuspert (2) - 57 freq
mustert (2) - 1 freq
fusperin (2) - 1 freq
flustert (2) - 4 freq
asseert (3) - 1 freq
impert (3) - 1 freq
fuddelt (3) - 1 freq
gusset (3) - 1 freq
fuspert (0) - 7 freq
fusper (2) - 18 freq
fusper't (2) - 1 freq
fuspers (2) - 1 freq
fusperin (3) - 1 freq
dispert (3) - 2 freq
fostert (3) - 1 freq
fuspered (3) - 22 freq
despert (3) - 4 freq
fasert (3) - 1 freq
flustert (4) - 4 freq
pasport (4) - 5 freq
spurt (4) - 5 freq
spiert (4) - 28 freq
sport (4) - 155 freq
speirt (4) - 346 freq
fosterit (4) - 1 freq
speert (4) - 27 freq
despirt (4) - 1 freq
funnert (4) - 2 freq
rupert (4) - 17 freq
ushert (4) - 3 freq
mustert (4) - 1 freq
fuskers (4) - 21 freq
suspect (4) - 22 freq
SoundEx code - F216
fusper - 18 freq
fuspered - 22 freq
fochabers - 11 freq
fuspert - 7 freq
face-first - 1 freq
fag-brak - 1 freq
fusper't - 1 freq
fusperin - 1 freq
fuspers - 1 freq
fu-spread - 1 freq
fish-ferms - 1 freq
fcfraser - 8 freq
fvvqprf - 1 freq
fcbarcelona - 1 freq
MetaPhone code - FSPRT
fuspered - 22 freq
fuspert - 7 freq
fusper't - 1 freq
fu-spread - 1 freq
FUSPERT
Time to execute Levenshtein function - 0.203788 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.348821 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.027731 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.038312 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.000896 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.