| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zabell (0) - 1 freq abell (1) - 1 freq waell (2) - 1 freq danbell (2) - 2 freq javell (2) - 1 freq zaxbel (2) - 1 freq lavell (2) - 2 freq label (2) - 57 freq dayell (2) - 1 freq labellt (2) - 1 freq pjbell (2) - 1 freq bell (2) - 215 freq babel (2) - 7 freq labels (2) - 6 freq sabill (2) - 1 freq labelt (2) - 2 freq fatell (2) - 1 freq ab'll (2) - 2 freq rabels (2) - 1 freq masell (2) - 67 freq gbell (2) - 1 freq abel (2) - 7 freq mabel (2) - 91 freq umbels (3) - 1 freq rebelle (3) - 1 freq |
zabell (0) - 1 freq abell (2) - 1 freq bell (3) - 215 freq gbell (3) - 1 freq sabill (3) - 1 freq i'bill (4) - 2 freq kbll (4) - 1 freq bella (4) - 96 freq mabel (4) - 91 freq rebelle (4) - 1 freq boll (4) - 1 freq ball (4) - 62 freq belle (4) - 17 freq bull (4) - 92 freq sibella (4) - 2 freq nobill (4) - 1 freq masell (4) - 67 freq belly (4) - 163 freq bill (4) - 551 freq abel (4) - 7 freq label (4) - 57 freq dayell (4) - 1 freq labellt (4) - 1 freq lavell (4) - 2 freq zaxbel (4) - 1 freq |
SoundEx code - Z140 zabell - 1 freq |
MetaPhone code - SBL sabill - 1 freq sibiel - 1 freq sable - 2 freq sobel - 1 freq sibble - 1 freq seeable - 1 freq ys-bloo - 1 freq sibella - 2 freq sybil - 1 freq Ísabel - 6 freq zabell - 1 freq |
ZABELL |
| Time to execute Levenshtein function - 0.359294 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.524992 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.067257 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.043637 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.000893 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. |