| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| empathy (0) - 7 freq pathy (2) - 1 freq seempathy (2) - 2 freq apathy (2) - 8 freq sympathy (2) - 35 freq empty (2) - 207 freq bathy (3) - 2 freq meaty (3) - 2 freq math (3) - 6 freq i'path (3) - 1 freq emphatic (3) - 4 freq earthy (3) - 1 freq mhath (3) - 3 freq matey (3) - 5 freq patty (3) - 3 freq empty' (3) - 2 freq breathy (3) - 1 freq pithy (3) - 9 freq epty (3) - 1 freq clathy (3) - 1 freq patchy (3) - 4 freq matha (3) - 2 freq telepathy (3) - 1 freq maths (3) - 32 freq matty (3) - 54 freq |
empathy (0) - 7 freq empty (3) - 207 freq apathy (3) - 8 freq sympathy (3) - 35 freq seempathy (3) - 2 freq pathy (3) - 1 freq path (4) - 176 freq empathise (4) - 4 freq matha (4) - 2 freq seempithy (4) - 1 freq maath (4) - 3 freq pithy (4) - 9 freq emptie (4) - 1 freq muithy (4) - 1 freq emptit (4) - 1 freq impty (4) - 14 freq mhath (4) - 3 freq i'path (4) - 1 freq math (4) - 6 freq empty' (4) - 2 freq emptiet (5) - 1 freq masath (5) - 1 freq emptyin (5) - 6 freq impetus (5) - 3 freq matthey (5) - 2 freq |
SoundEx code - E513 empty - 207 freq embdy - 14 freq empied - 3 freq emptyin - 6 freq empathy - 7 freq empties - 6 freq emptied - 20 freq embittert - 1 freq emptiness - 8 freq eenveytet - 1 freq embattled - 1 freq embedded - 4 freq embodies - 2 freq envied - 3 freq empathise - 4 freq embeddit - 4 freq emphatic - 4 freq emptyhaunded - 1 freq empty-handed - 1 freq embeddin' - 2 freq embed - 2 freq emptie - 1 freq empty' - 2 freq 'empty' - 1 freq embitter - 1 freq emptiet - 1 freq embodie - 1 freq embodiment - 2 freq empathetic - 2 freq enubdy - 1 freq embodyin - 1 freq €˜emptiness - 1 freq emphatically - 1 freq embodied - 2 freq embeddin - 1 freq emptit - 1 freq emptypocket - 1 freq |
MetaPhone code - EMP0 empathy - 7 freq |
EMPATHY |
| Time to execute Levenshtein function - 0.220412 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.426162 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.031086 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.037064 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. |