| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| phonemes (0) - 11 freq phones (2) - 1 freq phonemic (2) - 14 freq phone's (2) - 9 freq phones (2) - 50 freq phoney (3) - 1 freq homes (3) - 10 freq holmes (3) - 16 freq pomes (3) - 1 freq honey's (3) - 17 freq ponies (3) - 6 freq poames (3) - 2 freq themes (3) - 22 freq phonie (3) - 1 freq pioneer (3) - 2 freq phonetic (3) - 11 freq photaes (3) - 9 freq photes (3) - 1 freq peonies (3) - 1 freq photoies (3) - 1 freq pioneers (3) - 3 freq poyems (3) - 9 freq 'homes (3) - 1 freq jhone's (3) - 9 freq phonebox (3) - 1 freq |
phonemes (0) - 11 freq phones (3) - 50 freq phone's (3) - 9 freq phonemic (3) - 14 freq diaphonemes (4) - 3 freq iphones (4) - 2 freq phones (4) - 1 freq phonics (4) - 1 freq paranems (5) - 1 freq podemos (5) - 4 freq phoebus (5) - 3 freq phone (5) - 509 freq phone't (5) - 1 freq phoned (5) - 72 freq phrasemes (5) - 3 freq rholmes (5) - 2 freq phantoms (5) - 4 freq phnom (5) - 1 freq phenomena (5) - 8 freq phonetics (5) - 1 freq rhones (5) - 1 freq poems (5) - 279 freq phone' (5) - 1 freq photies (5) - 76 freq poiems (5) - 2 freq |
SoundEx code - P552 penning - 2 freq penance - 2 freq penaunce - 1 freq peninsula - 3 freq pinions - 1 freq phonemes - 11 freq phonemic - 14 freq phoning - 4 freq pining - 1 freq piemancharlie - 2 freq pennington - 1 freq |
MetaPhone code - FNMS phonemes - 11 freq venomous - 1 freq |
PHONEMES |
| Time to execute Levenshtein function - 0.186496 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.377058 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.027694 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.038636 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.001214 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. |