| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gustave (0) - 1 freq gustav (1) - 2 freq bustage (2) - 1 freq ustae (2) - 2 freq mustae (2) - 6 freq gustie (2) - 3 freq stave (2) - 1 freq must've (2) - 26 freq gustative (2) - 1 freq furtive (3) - 2 freq 'state (3) - 2 freq gesture (3) - 35 freq restive (3) - 1 freq bustle (3) - 6 freq untape (3) - 1 freq hustle (3) - 1 freq stane (3) - 421 freq gutsie (3) - 2 freq state (3) - 368 freq i'stage (3) - 1 freq slave (3) - 41 freq gauntae (3) - 1 freq guitar (3) - 27 freq funstane (3) - 1 freq yuptae (3) - 4 freq |
gustave (0) - 1 freq gustav (1) - 2 freq gustative (3) - 1 freq gustie (3) - 3 freq stave (3) - 1 freq gustin (4) - 1 freq goustie (4) - 4 freq festive (4) - 18 freq mustuv (4) - 1 freq steve (4) - 46 freq stove (4) - 63 freq gestapo (4) - 4 freq staive (4) - 1 freq gusts (4) - 5 freq gustfu (4) - 1 freq ustae (4) - 2 freq stav (4) - 2 freq must've (4) - 26 freq mustae (4) - 6 freq gusto (4) - 6 freq gust (4) - 18 freq steave (4) - 1 freq bustage (4) - 1 freq restive (4) - 1 freq gesture (4) - 35 freq |
SoundEx code - G231 gustave - 1 freq gestapo's - 1 freq gestapo - 4 freq gustav - 2 freq gustfu - 1 freq guasdf - 1 freq ghostbusters - 2 freq |
MetaPhone code - KSTF cast-aff - 2 freq gustave - 1 freq queesitive - 1 freq queisitive - 1 freq gustav - 2 freq gustfu - 1 freq causative - 1 freq guasdf - 1 freq hxdav - 1 freq yyqzdfw - 1 freq |
GUSTAVE |
| Time to execute Levenshtein function - 0.194602 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.387465 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.031766 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.038347 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.000848 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. |