| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| govts (0) - 1 freq govtm (1) - 1 freq goves (1) - 2 freq govt (1) - 7 freq goats (1) - 17 freq gouts (1) - 1 freq gats (2) - 1 freq govn (2) - 2 freq gobs (2) - 4 freq govie (2) - 3 freq gests (2) - 2 freq groats (2) - 5 freq gasts (2) - 1 freq bowts (2) - 2 freq gloats (2) - 1 freq lots (2) - 80 freq gobbs (2) - 20 freq got' (2) - 3 freq dolts (2) - 2 freq gota (2) - 3 freq voits (2) - 2 freq ots (2) - 2 freq joves (2) - 2 freq monts (2) - 5 freq gove (2) - 14 freq |
govts (0) - 1 freq gouts (2) - 1 freq govt (2) - 7 freq goats (2) - 17 freq goves (2) - 2 freq govtm (2) - 1 freq govies (3) - 1 freq guvs (3) - 1 freq gives (3) - 20 freq govit (3) - 1 freq gets (3) - 432 freq guts (3) - 73 freq getts (3) - 7 freq gants (3) - 1 freq gifts (3) - 33 freq gents (3) - 8 freq gaits (3) - 30 freq grits (3) - 1 freq geets (3) - 23 freq bovets (3) - 1 freq gaets (3) - 4 freq gasts (3) - 1 freq voits (3) - 2 freq groats (3) - 5 freq gests (3) - 2 freq |
SoundEx code - G132 gifts - 33 freq gifties - 4 freq gibt's - 1 freq goviedick - 1 freq govts - 1 freq gypeheidgendies - 1 freq gfeadjrd - 1 freq gqvfdoka - 1 freq |
MetaPhone code - KFTS covetice - 1 freq cavities - 1 freq covetous - 1 freq caveats - 1 freq govts - 1 freq covids - 1 freq |
GOVTS |
| Time to execute Levenshtein function - 0.182627 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.364499 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.027686 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.037612 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.000880 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. |