Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
phenomenon (0) - 20 freq phenomenal (2) - 1 freq phenomena (2) - 8 freq phemomena (3) - 1 freq phenomina (3) - 1 freq phenomenal- (3) - 1 freq phenomenally (4) - 1 freq philomena (4) - 3 freq peyment (5) - 6 freq chessmen (5) - 3 freq hennerin (5) - 1 freq amenments (5) - 1 freq penann (5) - 1 freq phonan (5) - 2 freq melodeon (5) - 7 freq thomson (5) - 26 freq chinamen (5) - 1 freq plennin (5) - 11 freq genomes (5) - 1 freq pokemon (5) - 1 freq enenoo (5) - 8 freq phonin (5) - 22 freq pleenin (5) - 1 freq pennents (5) - 1 freq peyments (5) - 5 freq |
phenomenon (0) - 20 freq phenomena (3) - 8 freq phenomenal (3) - 1 freq phenomina (4) - 1 freq phenomenal- (5) - 1 freq phemomena (5) - 1 freq philomena (6) - 3 freq phenomenally (6) - 1 freq pennin (7) - 2 freq honeymeenin (7) - 1 freq pennan (7) - 2 freq hermann (7) - 4 freq phonin (7) - 22 freq phanton (7) - 1 freq phnom (7) - 1 freq henman (7) - 1 freq pronominal (7) - 1 freq shannon (7) - 2 freq penman (7) - 1 freq penann (7) - 1 freq phonemes (7) - 11 freq chinamen (7) - 1 freq phonan (7) - 2 freq plennin (7) - 11 freq hemmerin (8) - 7 freq |
SoundEx code - P555 pneumonia - 7 freq phenomenon - 20 freq phenomenally - 1 freq phenomena - 8 freq phemomena - 1 freq phonenumber - 53 freq pneumonie - 1 freq phenomenal - 1 freq phenomina - 1 freq phenomenal- - 1 freq phenomenologogical - 1 freq |
MetaPhone code - FNMNN phenomenon - 20 freq |
PHENOMENON |
Time to execute Levenshtein function - 0.240941 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.352731 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.026931 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.037329 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.000863 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. |