| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jupiter (0) - 9 freq jubiter (1) - 29 freq juicer (2) - 1 freq quaiter (2) - 4 freq cuiter (2) - 1 freq jupiter's (2) - 1 freq scaiter (3) - 1 freq weiter (3) - 1 freq uiser (3) - 5 freq lucifer (3) - 8 freq dunter (3) - 2 freq puirer (3) - 6 freq suiner (3) - 27 freq quited (3) - 1 freq japer (3) - 1 freq lupine (3) - 1 freq culter (3) - 1 freq quanter (3) - 4 freq juliet (3) - 7 freq pikter (3) - 1 freq waiter (3) - 34 freq juicier (3) - 1 freq julie (3) - 29 freq spiker (3) - 1 freq quater (3) - 5 freq |
jupiter (0) - 9 freq jubiter (2) - 29 freq jater (4) - 1 freq janitor (4) - 6 freq pityer (4) - 1 freq japer (4) - 1 freq jaupit (4) - 1 freq jester (4) - 4 freq peter (4) - 148 freq quaiter (4) - 4 freq juicer (4) - 1 freq cuiter (4) - 1 freq jupiter's (4) - 1 freq 'peter (4) - 3 freq jotter (4) - 28 freq pleiter (5) - 1 freq piper (5) - 24 freq upsteer (5) - 3 freq outer (5) - 4 freq igniter (5) - 2 freq wunter (5) - 27 freq heiter (5) - 1 freq utter (5) - 62 freq hunter (5) - 48 freq judith (5) - 5 freq |
SoundEx code - J136 jupiter - 9 freq jubiter - 29 freq jubiter's - 1 freq jupiter's - 1 freq |
MetaPhone code - JPTR jupiter - 9 freq |
JUPITER |
| Time to execute Levenshtein function - 0.204523 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.361662 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.027511 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.037050 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.000854 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. |