| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foonert (0) - 17 freq foondert (1) - 8 freq fooner (1) - 4 freq founert (1) - 4 freq fooneret (1) - 1 freq footert (1) - 3 freq funnert (2) - 2 freq foont (2) - 2 freq foolery (2) - 2 freq footer (2) - 14 freq foondit (2) - 41 freq cornert (2) - 1 freq donnert (2) - 20 freq foonders (2) - 2 freq ooner (2) - 2 freq soonest (2) - 1 freq footers (2) - 3 freq foongers (2) - 1 freq wonnert (2) - 11 freq founnert (2) - 1 freq foundert (2) - 3 freq foothert (2) - 2 freq fowert (2) - 10 freq foondet (2) - 1 freq dooners (2) - 2 freq |
foonert (0) - 17 freq founert (1) - 4 freq fooneret (1) - 1 freq foondert (2) - 8 freq fooner (2) - 4 freq footert (2) - 3 freq foonerin (3) - 1 freq foondet (3) - 1 freq fowert (3) - 10 freq foundert (3) - 3 freq foont (3) - 2 freq funnert (3) - 2 freq foonered (3) - 1 freq founnert (3) - 1 freq foondit (3) - 41 freq fibert (4) - 2 freq feert (4) - 36 freq fynest (4) - 1 freq founit (4) - 2 freq fount (4) - 2 freq fingert (4) - 3 freq forret (4) - 32 freq foumart (4) - 3 freq floret (4) - 1 freq finer (4) - 14 freq |
SoundEx code - F563 foonert - 17 freq founert - 4 freq foumart - 3 freq foumartskynnis - 1 freq fowmart - 4 freq foumarts - 1 freq €˜fowmart - 1 freq fumart - 1 freq foonered - 1 freq fooneret - 1 freq founnert - 1 freq funnert - 2 freq feyenoord - 1 freq feenertie - 1 freq foonertness - 1 freq fionaruthbo - 1 freq |
MetaPhone code - FNRT foonert - 17 freq founert - 4 freq foonered - 1 freq fooneret - 1 freq founnert - 1 freq funnert - 2 freq feenertie - 1 freq |
FOONERT |
| Time to execute Levenshtein function - 0.189833 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.351342 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.029452 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.040848 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.000970 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. |