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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
webbiner (0) - 1 freq
webinar (2) - 4 freq
webbie (2) - 2 freq
nebbin (3) - 2 freq
webbit (3) - 1 freq
wabbin (3) - 1 freq
werner (3) - 1 freq
einer (3) - 1 freq
gebbies (3) - 1 freq
bebbin (3) - 1 freq
weber (3) - 1 freq
widbines (3) - 2 freq
mebbie (3) - 6 freq
wearier (3) - 1 freq
website (3) - 54 freq
legbiter (3) - 2 freq
ebner (3) - 5 freq
widbine (3) - 1 freq
nebbie (3) - 9 freq
terminer (3) - 2 freq
exminer (3) - 1 freq
meiner (3) - 2 freq
debbie (3) - 2 freq
mebbies (3) - 58 freq
weiter (3) - 1 freq
webbiner (0) - 1 freq
webinar (3) - 4 freq
wobbler (4) - 1 freq
webbie (4) - 2 freq
wabbin (4) - 1 freq
widbines (5) - 2 freq
ebner (5) - 5 freq
widbine (5) - 1 freq
weber (5) - 1 freq
bebbin (5) - 1 freq
nebbin (5) - 2 freq
webbit (5) - 1 freq
werner (5) - 1 freq
ebbin (5) - 3 freq
webster (5) - 8 freq
binner (6) - 2 freq
wabster (6) - 17 freq
wudbins (6) - 1 freq
dobber (6) - 4 freq
rubbin (6) - 50 freq
gabbin (6) - 19 freq
brainer (6) - 1 freq
woodbine (6) - 1 freq
dibber (6) - 2 freq
burner (6) - 3 freq
SoundEx code - W156
weaponry - 2 freq
webinar - 4 freq
wapponry - 2 freq
webbiner - 1 freq
MetaPhone code - WBNR
webinar - 4 freq
webbiner - 1 freq
WEBBINER
Time to execute Levenshtein function - 0.209710 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.498977 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.032395 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.077802 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.000901 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.