| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| guinea-pigs (0) - 19 freq guineapigs (1) - 1 freq guinea-pig (1) - 8 freq guinea-peeg (3) - 2 freq geeny-pigs (4) - 2 freq guineas (4) - 4 freq mince-pies (5) - 1 freq gun-dogs (5) - 1 freq tint-pegs (5) - 1 freq geenypigs (5) - 2 freq quine-ness (5) - 1 freq guinea (5) - 6 freq guiness (5) - 2 freq guiseppim (5) - 6 freq pineapples (5) - 2 freq geenipigs (5) - 6 freq unnerpins (5) - 2 freq geeny-pig (5) - 2 freq lineage (6) - 6 freq gings (6) - 75 freq ghini's (6) - 1 freq uneasily (6) - 4 freq muintrampit (6) - 1 freq quines (6) - 155 freq untappit (6) - 1 freq |
guinea-pigs (0) - 19 freq guinea-pig (2) - 8 freq guineapigs (2) - 1 freq geeny-pigs (4) - 2 freq guinea-peeg (4) - 2 freq geeny-pig (6) - 2 freq gun-dogs (6) - 1 freq geenypigs (6) - 2 freq geenipigs (6) - 6 freq tint-pegs (7) - 1 freq guineas (7) - 4 freq gings (8) - 75 freq genealogies (8) - 2 freq hin-laigs (8) - 1 freq geenipig (8) - 9 freq gyings (8) - 3 freq line-ups (8) - 1 freq hin-legs (8) - 2 freq gingies (8) - 1 freq quine-ness (8) - 1 freq guiness (8) - 2 freq mince-pies (8) - 1 freq unnerpins (8) - 2 freq pineapples (8) - 2 freq gunwales (9) - 2 freq |
SoundEx code - G512 guinea-pigs - 19 freq guinea-pig - 8 freq gimps - 4 freq geenypigs - 2 freq geeny-pigs - 2 freq geeny-pig - 2 freq guineapigs - 1 freq geneva's - 4 freq gumpick - 1 freq geenipig - 9 freq geenipigs - 6 freq guinea-peeg - 2 freq gainbiggin - 1 freq gaun-fuckin-naewhere - 1 freq gnyaffs - 1 freq gmuuufs - 1 freq ginboyjoe - 2 freq gsmvcmvtte - 1 freq gnvcq - 1 freq |
MetaPhone code - KNPKS guinea-pigs - 19 freq guineapigs - 1 freq |
GUINEA-PIGS |
| Time to execute Levenshtein function - 0.182773 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.426954 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.030963 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.038488 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.000847 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. |