Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
foondaetions (0) - 1 freq foondaetion (1) - 1 freq foondations (1) - 7 freq foundations (2) - 4 freq foondation (2) - 6 freq foundation (3) - 12 freq condeetions (3) - 7 freq formaetions (3) - 1 freq fundations (3) - 1 freq foonderin (4) - 2 freq donations (4) - 2 freq condeitions (4) - 4 freq conditions (4) - 35 freq condeetion (4) - 5 freq foontains (4) - 7 freq formations (4) - 7 freq coronation (5) - 8 freq factions (5) - 1 freq rendeitions (5) - 2 freq roondaboots (5) - 4 freq foondet (5) - 1 freq conditions' (5) - 1 freq gradations (5) - 1 freq rotations (5) - 1 freq detonations (5) - 1 freq |
foondaetions (0) - 1 freq foondations (1) - 7 freq foondaetion (2) - 1 freq foundations (2) - 4 freq fundations (3) - 1 freq foondation (3) - 6 freq condeetions (4) - 7 freq foundation (4) - 12 freq conditions (5) - 35 freq condeitions (5) - 4 freq foontains (5) - 7 freq formaetions (5) - 1 freq rendeitions (6) - 2 freq donations (6) - 2 freq fountains (6) - 8 freq foonderin (6) - 2 freq functions (6) - 27 freq condeetion (6) - 5 freq formations (6) - 7 freq moontins (7) - 2 freq edeetions (7) - 1 freq forderins (7) - 3 freq fractions (7) - 2 freq foondries (7) - 2 freq foondin (7) - 13 freq |
SoundEx code - F533 foondations - 7 freq foondation - 6 freq fainted - 5 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 |
FOONDAETIONS |
Time to execute Levenshtein function - 0.229972 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.393935 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.028353 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.041044 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.001085 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. |