| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foondations (0) - 7 freq foondaetions (1) - 1 freq foundations (1) - 4 freq foondation (1) - 6 freq fundations (2) - 1 freq foondaetion (2) - 1 freq foundation (2) - 12 freq foontains (3) - 7 freq donations (3) - 2 freq conditions (3) - 35 freq formations (3) - 7 freq oxidation (4) - 1 freq condeitions (4) - 4 freq fountains (4) - 8 freq gradations (4) - 1 freq functions (4) - 27 freq carnations (4) - 1 freq conotations (4) - 4 freq connotations (4) - 9 freq nations (4) - 65 freq coontins (4) - 1 freq connections (4) - 35 freq rotations (4) - 1 freq foondin (4) - 13 freq foondrin (4) - 1 freq |
foondations (0) - 7 freq foundations (1) - 4 freq foondaetions (1) - 1 freq fundations (2) - 1 freq foondation (2) - 6 freq foundation (3) - 12 freq foondaetion (3) - 1 freq foontains (4) - 7 freq conditions (4) - 35 freq condeitions (5) - 4 freq fountains (5) - 8 freq functions (5) - 27 freq formations (5) - 7 freq condeetions (5) - 7 freq donations (5) - 2 freq condition (6) - 36 freq fundins (6) - 1 freq novations (6) - 1 freq fontaines (6) - 1 freq sensations (6) - 3 freq soondins (6) - 2 freq moontains (6) - 13 freq foondries (6) - 2 freq fantation (6) - 2 freq conditions' (6) - 1 freq |
SoundEx code - F533 foondations - 7 freq foondation - 6 freq fainted - 4 freq foondit - 41 freq fundit - 19 freq funded - 13 freq founded - 3 freq foondet - 1 freq foundation - 12 freq faintit - 7 freq faintet - 6 freq fundations - 1 freq foundations - 4 freq fantation - 2 freq fendit - 11 freq feenty-thing - 1 freq foonded - 1 freq fondateur - 1 freq foundit - 6 freq feentie-thing - 1 freq fentit - 3 freq feintit - 1 freq fundiet - 1 freq foondaetions - 1 freq foondaetion - 1 freq |
MetaPhone code - FNTXNS foondations - 7 freq fundations - 1 freq foundations - 4 freq foondaetions - 1 freq |
FOONDATIONS |
| Time to execute Levenshtein function - 0.204020 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.398428 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.027443 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.069000 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.000802 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. |