| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| polyphème (0) - 4 freq polyphonic (4) - 2 freq polyphemus (4) - 1 freq polythene (4) - 3 freq polyphony (4) - 3 freq problème (5) - 2 freq morpheme (5) - 10 freq molière (5) - 22 freq olphrmze (5) - 1 freq blythsome (5) - 1 freq payphone (5) - 1 freq polyshen (5) - 1 freq golspie (6) - 1 freq flype (6) - 3 freq lyfetyme (6) - 2 freq popeye (6) - 8 freq pollidee (6) - 3 freq telephone (6) - 16 freq palpable (6) - 3 freq pompoms (6) - 1 freq selfshame (6) - 1 freq paraphrase (6) - 3 freq pope (6) - 26 freq palindrome (6) - 2 freq pollute (6) - 2 freq |
polyphème (0) - 4 freq polyphemus (7) - 1 freq polyphony (7) - 3 freq polyphonic (7) - 2 freq polythene (8) - 3 freq problème (8) - 2 freq payphone (9) - 1 freq polyshen (9) - 1 freq blythsome (9) - 1 freq olphrmze (9) - 1 freq morpheme (9) - 10 freq molière (9) - 22 freq peephole (10) - 2 freq porphory (10) - 1 freq playtime (10) - 24 freq plentèrs (10) - 1 freq polished (10) - 39 freq sulphate (10) - 2 freq polishin' (10) - 2 freq polisht (10) - 5 freq polishin (10) - 10 freq calaphine (10) - 2 freq lychtsome (10) - 1 freq caliphate (10) - 1 freq blithsome (10) - 2 freq |
SoundEx code - P415 plappin - 2 freq phillipines - 2 freq plipan - 1 freq pluffin - 2 freq pleepin - 1 freq playpen - 1 freq pleepan - 1 freq philippians - 1 freq ploppan - 1 freq pluffen - 4 freq polyphonic - 2 freq pluffins - 2 freq polyphème - 4 freq plypin - 1 freq polyphony - 3 freq pleven - 1 freq €˜polyphonic - 1 freq polyphemus - 1 freq plebeians - 1 freq philbinmark - 1 freq polypantransman - 1 freq |
MetaPhone code - PLFM polyphème - 4 freq |
POLYPHÈME |
| Time to execute Levenshtein function - 0.215308 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.467259 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.031728 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.040347 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.001207 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. |