| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goodcompany (0) - 1 freq company (4) - 207 freq accompany (4) - 8 freq goodbrand (5) - 1 freq comp'ny (5) - 1 freq woodsman (5) - 1 freq goodlookin (5) - 1 freq ootcomin (5) - 1 freq cumpany (5) - 1 freq toooooopay (5) - 1 freq accompong (6) - 2 freq goodfoodgal (6) - 1 freq gudeman (6) - 2 freq goldson (6) - 1 freq ootcomes (6) - 9 freq gordson (6) - 1 freq command (6) - 36 freq ootcumin (6) - 1 freq ootcom (6) - 1 freq moonman (6) - 2 freq compact (6) - 7 freq gollopin (6) - 2 freq goodwin (6) - 7 freq goooo'n (6) - 1 freq hodman (6) - 1 freq |
goodcompany (0) - 1 freq company (6) - 207 freq accompany (6) - 8 freq cumpany (7) - 1 freq gudeman (8) - 2 freq companie (8) - 32 freq guidman (8) - 54 freq guid-man (8) - 2 freq ootcomin (8) - 1 freq woodsman (8) - 1 freq comp'ny (8) - 1 freq goodlookin (8) - 1 freq accompanit (9) - 1 freq comply (9) - 4 freq gloaman (9) - 2 freq accompanyin (9) - 8 freq coman (9) - 41 freq compair (9) - 1 freq 'coman (9) - 1 freq incoman (9) - 1 freq comman (9) - 4 freq campain (9) - 3 freq campin (9) - 4 freq oncomin (9) - 4 freq road-man (9) - 1 freq |
SoundEx code - G325 gadgin - 1 freq gethsemane - 1 freq good-goin - 1 freq godssend - 3 freq godsend - 3 freq guid-gaun - 3 freq guid-gauin - 1 freq goat-skin - 1 freq goodcompany - 1 freq gatehsenursery - 2 freq guidson - 4 freq |
MetaPhone code - KTKMPN goodcompany - 1 freq |
GOODCOMPANY |
| Time to execute Levenshtein function - 0.261680 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.383866 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.031171 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.039029 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.000902 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. |