| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jarl (0) - 36 freq jar (1) - 41 freq darl (1) - 1 freq earl (1) - 31 freq jarv (1) - 15 freq karl (1) - 6 freq barl (1) - 1 freq farl (1) - 5 freq warl (1) - 164 freq jail (1) - 49 freq jarls (1) - 11 freq varl (1) - 1 freq harl (1) - 5 freq carl (1) - 13 freq jars (1) - 21 freq yarl (1) - 18 freq marl (1) - 1 freq para (2) - 12 freq snarl (2) - 9 freq jaa (2) - 31 freq jake (2) - 71 freq barn (2) - 68 freq farel (2) - 1 freq warle (2) - 1 freq ward (2) - 89 freq |
jarl (0) - 36 freq varl (2) - 1 freq jarls (2) - 11 freq carl (2) - 13 freq yarl (2) - 18 freq marl (2) - 1 freq jail (2) - 49 freq jars (2) - 21 freq harl (2) - 5 freq darl (2) - 1 freq warl (2) - 164 freq jar (2) - 41 freq earl (2) - 31 freq jarv (2) - 15 freq farl (2) - 5 freq barl (2) - 1 freq karl (2) - 6 freq pearl (3) - 8 freq girl (3) - 76 freq jill (3) - 14 freq jure (3) - 1 freq carla (3) - 5 freq nrl (3) - 1 freq wurl (3) - 2 freq jul (3) - 1 freq |
SoundEx code - J640 jarl - 36 freq jsrael - 1 freq |
MetaPhone code - JRL girl - 76 freq jarl - 36 freq girl' - 1 freq €˜girl - 2 freq girlw - 1 freq girlie - 5 freq girly - 1 freq |
JARL |
| Time to execute Levenshtein function - 0.208340 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.334747 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.029841 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.041937 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.000924 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. |