| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zaxbel (0) - 1 freq mabel (2) - 91 freq babel (2) - 7 freq zabell (2) - 1 freq label (2) - 57 freq abel (2) - 7 freq fael (3) - 2 freq hanzel (3) - 1 freq barbed (3) - 4 freq daubed (3) - 3 freq baffel (3) - 1 freq aibul (3) - 1 freq maybee (3) - 3 freq gael (3) - 2 freq tassel (3) - 2 freq aaber (3) - 22 freq 'rebel (3) - 1 freq marbelt (3) - 1 freq axte (3) - 1 freq maxie (3) - 3 freq kael (3) - 5 freq makrel (3) - 1 freq wastel (3) - 1 freq maxter (3) - 5 freq dabbed (3) - 9 freq |
zaxbel (0) - 1 freq label (4) - 57 freq zabell (4) - 1 freq abel (4) - 7 freq babel (4) - 7 freq mabel (4) - 91 freq zdxb (5) - 1 freq boxbed (5) - 2 freq nobel (5) - 9 freq 'nobel (5) - 1 freq cabal (5) - 2 freq expel (5) - 1 freq isobel (5) - 47 freq sobel (5) - 1 freq caybul (5) - 1 freq laybil (5) - 2 freq habbil (5) - 1 freq axil (5) - 1 freq ishbel (5) - 5 freq 'rebel (5) - 1 freq axle (5) - 1 freq aibul (5) - 1 freq kabul (5) - 1 freq gorbel (5) - 1 freq gambol (5) - 1 freq |
SoundEx code - Z214 zaxbel - 1 freq |
MetaPhone code - SKSBL zaxbel - 1 freq |
ZAXBEL |
| Time to execute Levenshtein function - 0.224962 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.404688 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.027886 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.039710 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.000873 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. |