| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| javan (0) - 4 freq javans (1) - 20 freq japan (1) - 10 freq cavan (1) - 1 freq jaan (1) - 1 freq java (1) - 1 freq savan (1) - 1 freq wavan (1) - 9 freq ravan (1) - 2 freq bayan (2) - 4 freq avant (2) - 1 freq jakin (2) - 1 freq avaw (2) - 5 freq nava (2) - 30 freq laevan (2) - 15 freq javons (2) - 2 freq awan (2) - 1 freq basan (2) - 1 freq weavan (2) - 1 freq savin (2) - 38 freq gaean (2) - 2 freq bajan (2) - 2 freq fadan (2) - 1 freq takan (2) - 10 freq ivan (2) - 6 freq |
javan (0) - 4 freq ravan (2) - 2 freq jeavin (2) - 1 freq jovian (2) - 3 freq savan (2) - 1 freq wavan (2) - 9 freq javans (2) - 20 freq java (2) - 1 freq japan (2) - 10 freq jaan (2) - 1 freq cavan (2) - 1 freq jonan (3) - 2 freq jason (3) - 24 freq hevan (3) - 10 freq javig (3) - 1 freq livan (3) - 6 freq rivan (3) - 2 freq jawin (3) - 2 freq rovan (3) - 1 freq caven (3) - 1 freq jean (3) - 169 freq wavin (3) - 83 freq hivan (3) - 7 freq jan (3) - 27 freq avin (3) - 2 freq |
SoundEx code - J150 japan - 10 freq jabbin - 8 freq jaupin - 1 freq jobnny - 1 freq jeavin - 1 freq jowpin - 1 freq jovian - 3 freq juppen - 4 freq japanee - 7 freq javan - 4 freq jaw-bane - 1 freq jappin - 1 freq jpm - 1 freq jvooeom - 1 freq |
MetaPhone code - JFN givin - 8 freq given - 69 freq jeavin - 1 freq geffin - 1 freq gif'n - 5 freq jovian - 3 freq giovanni - 3 freq givan - 4 freq gevin - 1 freq javan - 4 freq €˜giovanni - 2 freq giovino - 1 freq 'given' - 1 freq |
JAVAN |
| Time to execute Levenshtein function - 0.216451 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.348825 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.027447 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.037917 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.001222 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. |