| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hypocrisy (0) - 12 freq hypocricy (1) - 1 freq heepocrisy (2) - 2 freq hypocrisie (2) - 1 freq hypocrite (2) - 4 freq hypocrites (3) - 9 freq hypnosis (4) - 3 freq hyperion (4) - 1 freq heepocrite (4) - 1 freq hoorish (4) - 1 freq hypnotise (4) - 1 freq hoise (5) - 4 freq hovrin (5) - 2 freq hours' (5) - 1 freq skouriss (5) - 1 freq pocky (5) - 2 freq crish (5) - 1 freq spoors (5) - 1 freq houres (5) - 8 freq perish (5) - 12 freq policy (5) - 149 freq theprivy (5) - 1 freq sporty (5) - 3 freq pacify (5) - 2 freq by-oors (5) - 1 freq |
hypocrisy (0) - 12 freq heepocrisy (2) - 2 freq hypocrisie (2) - 1 freq hypocricy (2) - 1 freq hypocrite (3) - 4 freq hypocrites (4) - 9 freq heepocrite (5) - 1 freq hypnotise (6) - 1 freq hypnosis (6) - 3 freq hyperion (6) - 1 freq hoarse (7) - 29 freq paris (7) - 52 freq hubris (7) - 1 freq heris (7) - 1 freq haycorns (7) - 13 freq prise (7) - 3 freq pores (7) - 4 freq highrise (7) - 2 freq hyper (7) - 4 freq horus (7) - 1 freq hours (7) - 114 freq honours (7) - 11 freq priouris (7) - 1 freq harris (7) - 14 freq liprosy (7) - 2 freq |
SoundEx code - H126 hypocrites - 9 freq hauf-croon - 1 freq heepocreets - 1 freq hauf-serene - 1 freq hauf-croun - 1 freq hypocrisy - 12 freq hauf-crazed - 1 freq hauf-grue - 1 freq hypocritical - 2 freq hippycrates - 4 freq hippycrate - 1 freq hippycrit - 1 freq hippycrits - 3 freq hypocrisie - 1 freq hauf-greetin - 1 freq hypocrite - 4 freq hauf-a-croon - 1 freq hauf-circle - 1 freq hypocricy - 1 freq hauf-crouns - 2 freq hauf-grown - 1 freq haafcroon - 2 freq heepocrite - 1 freq heepocrisy - 2 freq hypociritcal - 1 freq hbxrjnxqn - 1 freq heepocreetocal - 1 freq happygrower - 1 freq hvkkrqgwih - 1 freq |
MetaPhone code - PKRS powkers - 1 freq hypocrisy - 12 freq hypocrisie - 1 freq hypocricy - 1 freq pickers - 1 freq packers - 1 freq |
HYPOCRISY |
| Time to execute Levenshtein function - 0.207868 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.401318 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.028272 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.038865 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.000939 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. |