| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zbji (0) - 1 freq fuji (2) - 1 freq ji (2) - 7 freq zj (2) - 1 freq xji (2) - 1 freq zbu (2) - 1 freq zfjq (2) - 1 freq bri (2) - 2 freq zbqm (2) - 1 freq pbjs (2) - 1 freq uyji (2) - 1 freq fbi (2) - 1 freq wbki (2) - 1 freq rbi (2) - 1 freq fiji (2) - 1 freq zvi (2) - 1 freq mbjs (2) - 1 freq bei (2) - 55 freq fbsi (2) - 1 freq abi (2) - 3 freq bmi (2) - 1 freq bi (2) - 3287 freq rbj (2) - 1 freq hbui (2) - 1 freq bjv (2) - 1 freq |
zbji (0) - 1 freq bj (3) - 15 freq zb (3) - 3 freq zbu (3) - 1 freq zbma (3) - 1 freq rbj (3) - 1 freq zje (3) - 1 freq zj (3) - 1 freq ybi (4) - 1 freq boi (4) - 3 freq rbjq (4) - 1 freq zjf (4) - 1 freq zijc (4) - 1 freq zkjg (4) - 1 freq baja (4) - 1 freq zob (4) - 1 freq subj (4) - 1 freq yzbv (4) - 1 freq bij (4) - 1 freq zebra (4) - 4 freq zqij (4) - 1 freq 'bi (4) - 4 freq bojo (4) - 5 freq ezb (4) - 1 freq zi (4) - 3 freq |
SoundEx code - Z120 zfoqx - 1 freq zebwc - 1 freq ziofx - 1 freq zvhsw - 1 freq zvs - 1 freq zbji - 1 freq zfjq - 1 freq zgzbqc - 1 freq |
MetaPhone code - SBJ subjee- - 1 freq subj - 1 freq zbji - 1 freq wysbj - 1 freq |
ZBJI |
| Time to execute Levenshtein function - 0.697028 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 - 1.115742 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.099838 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.112192 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.000914 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. |