| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| webinar (0) - 4 freq seminar (2) - 6 freq webbiner (2) - 1 freq einar (2) - 27 freq weimar (2) - 1 freq wer'nae (3) - 1 freq regiar (3) - 1 freq weidae (3) - 2 freq winae (3) - 2 freq seminal (3) - 1 freq wesnae (3) - 3 freq epinal (3) - 1 freq retinas (3) - 1 freq webster (3) - 8 freq einas (3) - 1 freq regilar (3) - 1 freq weisna (3) - 3 freq wilinae (3) - 1 freq eynar (3) - 34 freq debonair (3) - 1 freq retenar (3) - 1 freq werna (3) - 13 freq wenna (3) - 1 freq weeir (3) - 3 freq editar (3) - 2 freq |
webinar (0) - 4 freq webbiner (3) - 1 freq werner (4) - 1 freq binary (4) - 4 freq wnar (4) - 1 freq weber (4) - 1 freq debonair (4) - 1 freq seminar (4) - 6 freq ebner (4) - 5 freq einar (4) - 27 freq weimar (4) - 1 freq wesna (5) - 131 freq weyin (5) - 3 freq wernae (5) - 13 freq werenae (5) - 95 freq werenay (5) - 1 freq wein (5) - 2 freq seminary (5) - 1 freq weir (5) - 139 freq denar (5) - 1 freq wear (5) - 157 freq winner (5) - 138 freq bynear (5) - 2 freq wagner (5) - 1 freq wonner (5) - 5 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 |
WEBINAR |
| Time to execute Levenshtein function - 0.194630 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.369714 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.027092 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.036957 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.000807 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. |