| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ianuare (0) - 1 freq januar (2) - 34 freq january (2) - 67 freq fanfare (2) - 6 freq manure (2) - 10 freq mature (3) - 17 freq haare (3) - 1 freq anhere (3) - 1 freq lanyard (3) - 1 freq in'ae (3) - 13 freq manuals (3) - 2 freq impure (3) - 1 freq pianae (3) - 7 freq cantar (3) - 1 freq vanguard (3) - 5 freq canary (3) - 14 freq language (3) - 1435 freq invade (3) - 5 freq landart (3) - 2 freq hansard (3) - 3 freq anurr (3) - 4 freq nare (3) - 1 freq inquire (3) - 4 freq manual (3) - 6 freq incase (3) - 11 freq |
ianuare (0) - 1 freq nare (3) - 1 freq anar (3) - 1 freq manure (3) - 10 freq januar (3) - 34 freq january (3) - 67 freq nuir (4) - 1 freq tenure (4) - 4 freq incore (4) - 2 freq nature (4) - 113 freq insure (4) - 2 freq inane (4) - 2 freq aware (4) - 61 freq manere (4) - 2 freq anr (4) - 1 freq ansar (4) - 1 freq afoare (4) - 1 freq nar (4) - 15 freq anae (4) - 1 freq anymare (4) - 17 freq narie (4) - 1 freq oantae (4) - 99 freq intae (4) - 4690 freq aname (4) - 1 freq injure (4) - 8 freq |
SoundEx code - I560 inower - 10 freq inner - 46 freq immer - 2 freq in-ower - 1 freq innywhaur - 1 freq i'winner - 1 freq i'mower - 1 freq i'mair - 1 freq ianuare - 1 freq innoyer - 1 freq imrie - 1 freq ianmaher - 1 freq |
MetaPhone code - INR inner - 46 freq ianuare - 1 freq |
IANUARE |
| Time to execute Levenshtein function - 0.230359 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.390735 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.028911 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.039308 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.004144 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. |