| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backflips (0) - 1 freq backlins (2) - 18 freq baklins (3) - 7 freq backdraps (3) - 2 freq backslide (3) - 1 freq backfires (3) - 1 freq backies (3) - 5 freq backins (3) - 2 freq backless (3) - 1 freq backlit (3) - 1 freq backfire (3) - 1 freq backrooms (4) - 1 freq backpacks (4) - 1 freq backwards (4) - 36 freq backin' (4) - 1 freq bankins (4) - 2 freq tackles (4) - 3 freq hafflins (4) - 1 freq backsides (4) - 2 freq backdoors (4) - 1 freq backid (4) - 1 freq bucklin (4) - 7 freq backleens (4) - 1 freq hackles (4) - 3 freq backie (4) - 18 freq |
backflips (0) - 1 freq backlins (4) - 18 freq backfires (5) - 1 freq backless (5) - 1 freq backdraps (5) - 2 freq backfire (6) - 1 freq backlauns (6) - 1 freq buckles (6) - 2 freq backlit (6) - 1 freq backleens (6) - 1 freq backins (6) - 2 freq backslide (6) - 1 freq baklins (6) - 7 freq backies (6) - 5 freq backfired (7) - 3 freq backlands (7) - 1 freq backlan's (7) - 1 freq backdrop (7) - 3 freq backweys (7) - 1 freq backcloth (7) - 1 freq backairts (7) - 1 freq backwirds (7) - 2 freq backerties (7) - 1 freq backwyes (7) - 1 freq back's (7) - 6 freq |
SoundEx code - B214 baseball - 7 freq beachball - 1 freq byspiel - 1 freq bogshaivilt - 1 freq bogshaivelt - 1 freq backflips - 1 freq buckpool - 3 freq bbcpolliemac - 8 freq bbcpolitics - 3 freq bbciplayer - 1 freq bwaxbljzke - 1 freq |
MetaPhone code - BKFLPS backflips - 1 freq |
BACKFLIPS |
| Time to execute Levenshtein function - 0.214529 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.375586 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.029883 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.037902 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.000932 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. |