| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jovial (0) - 1 freq jovian (1) - 3 freq josiah (2) - 4 freq oval (2) - 7 freq social (2) - 324 freq jovi (2) - 1 freq novil (2) - 3 freq eivill (3) - 1 freq javell (3) - 1 freq movvan (3) - 1 freq socials (3) - 3 freq lovell (3) - 1 freq nial (3) - 4 freq gormal (3) - 1 freq sovict (3) - 1 freq nominal (3) - 1 freq julia (3) - 2 freq lyvia (3) - 2 freq bovril (3) - 11 freq joak (3) - 1 freq donal (3) - 7 freq soviet (3) - 14 freq loving (3) - 27 freq movie (3) - 15 freq yaval (3) - 1 freq |
jovial (0) - 1 freq jovian (2) - 3 freq jovi (3) - 1 freq novil (3) - 3 freq oval (3) - 7 freq devaal (4) - 5 freq divil (4) - 17 freq jowel (4) - 3 freq reveal (4) - 21 freq hovel (4) - 4 freq kevil (4) - 1 freq evil (4) - 90 freq voil (4) - 1 freq novel (4) - 65 freq civil (4) - 38 freq jail (4) - 49 freq joves (4) - 2 freq devil (4) - 35 freq jill (4) - 14 freq joel (4) - 1 freq yeovil (4) - 1 freq vil (4) - 2 freq javig (4) - 1 freq anvil (4) - 5 freq joyful (4) - 2 freq |
SoundEx code - J140 jabblie - 1 freq jibble - 4 freq joyfully - 1 freq jubilee - 4 freq jabble - 2 freq joyful - 2 freq javell - 1 freq jpl - 2 freq €˜joyfull - 1 freq jovial - 1 freq jpla - 1 freq |
MetaPhone code - JFL joyfully - 1 freq joyful - 2 freq javell - 1 freq €˜joyfull - 1 freq jovial - 1 freq |
JOVIAL |
| Time to execute Levenshtein function - 0.246066 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.384830 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.036419 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.040704 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.000921 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. |