| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feentie-thing (0) - 1 freq feenty-thing (2) - 1 freq feeneeshin (5) - 3 freq seen-aathing (5) - 2 freq oniething (5) - 37 freq feenishin (5) - 22 freq dentie-like (6) - 1 freq seed-eating (6) - 1 freq gentie-like (6) - 10 freq echtie-nine (6) - 1 freq enticing (6) - 1 freq onniethin (6) - 2 freq feenertie (6) - 1 freq entering (6) - 9 freq retweeting (6) - 1 freq twentieth (6) - 9 freq favoritething (6) - 1 freq sieventie-three (6) - 1 freq teenie-weeny (6) - 1 freq iveriethin (6) - 13 freq neathing (6) - 2 freq entertaint (6) - 2 freq sentencing (6) - 1 freq entreatin (6) - 2 freq nithing (6) - 61 freq |
feentie-thing (0) - 1 freq feenty-thing (2) - 1 freq seen-aathing (7) - 2 freq oniething (8) - 37 freq favoritething (9) - 1 freq nithing (9) - 61 freq naething (9) - 230 freq neathing (9) - 2 freq finishing (9) - 1 freq 'naething (9) - 2 freq feeneeshin (9) - 3 freq feenishin (9) - 22 freq fine-tuin (9) - 1 freq fetching (9) - 1 freq nething (9) - 1 freq feinishin (10) - 3 freq flitting (10) - 1 freq identifying (10) - 1 freq seen-everything (10) - 1 freq oniehing (10) - 1 freq fleeting (10) - 2 freq noathing (10) - 2 freq €œnaething (10) - 3 freq pointataing (10) - 1 freq nothing (10) - 91 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 - FNT0NK feenty-thing - 1 freq feentie-thing - 1 freq |
FEENTIE-THING |
| Time to execute Levenshtein function - 0.193234 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.387575 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.029697 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.039463 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.000933 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. |