| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pathetic (0) - 24 freq apathetic (1) - 1 freq bathetic (1) - 1 freq empathetic (2) - 2 freq athletic (2) - 7 freq €œpathetic (2) - 1 freq attic (3) - 15 freq pattin (3) - 14 freq athein (3) - 1 freq catholic (3) - 51 freq phonetic (3) - 11 freq pairtic (3) - 1 freq pattet (3) - 2 freq athelin (3) - 1 freq poetic (3) - 34 freq pitheid (3) - 2 freq 'authentic (3) - 1 freq aesthetic (3) - 4 freq prosthetic (3) - 1 freq sympathetic (3) - 20 freq watherin (3) - 1 freq pathie (3) - 9 freq magnetic (3) - 16 freq pattit (3) - 20 freq athletics (3) - 1 freq |
pathetic (0) - 24 freq apathetic (1) - 1 freq bathetic (2) - 1 freq empathetic (3) - 2 freq aesthetic (4) - 4 freq €œpathetic (4) - 1 freq athletic (4) - 7 freq patriotic (4) - 11 freq pathheid (5) - 1 freq pattie (5) - 2 freq authentic (5) - 13 freq epithet (5) - 2 freq pattit (5) - 20 freq pattir (5) - 2 freq patti (5) - 1 freq prophetic (5) - 2 freq sympathetic (5) - 20 freq synthetic (5) - 8 freq atheistic (5) - 1 freq pathie (5) - 9 freq catholic (5) - 51 freq pitheid (5) - 2 freq poetic (5) - 34 freq pattet (5) - 2 freq pairtic (5) - 1 freq |
SoundEx code - P332 pathetically - 2 freq pathetic - 24 freq potatoes - 7 freq pitheids - 1 freq €œpathetic - 1 freq potetaster - 1 freq |
MetaPhone code - P0TK pathetic - 24 freq €œpathetic - 1 freq |
PATHETIC |
| Time to execute Levenshtein function - 0.217909 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.372378 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.028358 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.037224 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.000878 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. |