| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fankelites (0) - 4 freq fankelite (1) - 2 freq fankeliser (2) - 3 freq fanklit (3) - 2 freq fanklie (3) - 1 freq fankelt (3) - 10 freq fankles (3) - 4 freq faceelities (3) - 3 freq bakelite (3) - 3 freq feelies (4) - 1 freq lanelie (4) - 1 freq sanglines (4) - 1 freq fanklet (4) - 1 freq fankl't (4) - 2 freq fankils (4) - 1 freq fankit (4) - 2 freq angeles (4) - 4 freq rankles (4) - 2 freq ankles (4) - 24 freq antedates (4) - 2 freq laikewies (4) - 1 freq faimilies (4) - 43 freq defankelise (4) - 1 freq families (4) - 30 freq hankies (4) - 3 freq |
fankelites (0) - 4 freq fankelite (2) - 2 freq fankelt (4) - 10 freq fankles (4) - 4 freq fanklit (4) - 2 freq fankeliser (4) - 3 freq fanklt (5) - 3 freq fankils (5) - 1 freq fanklet (5) - 1 freq faceelities (5) - 3 freq fankilt (5) - 2 freq fanklie (5) - 1 freq fanglit (6) - 1 freq faceilities (6) - 2 freq rankels (6) - 1 freq banalities (6) - 1 freq facilities (6) - 22 freq fankle (6) - 45 freq defankelise (6) - 1 freq hankelt (6) - 1 freq fanklin (6) - 5 freq fankled (6) - 14 freq fanckles (6) - 1 freq rankles (6) - 2 freq ankles (6) - 24 freq |
SoundEx code - F524 fankle - 45 freq fankelt - 10 freq fanklin - 5 freq fanklt - 3 freq funcy-lik - 1 freq fankled - 14 freq fingalton - 3 freq fankilt - 2 freq fanklet - 1 freq fang'l - 1 freq famously - 7 freq fanglit - 1 freq fangled - 3 freq fang'led - 1 freq fanklit - 2 freq fawmouslie - 1 freq fankil - 2 freq fanklie - 1 freq feingle-fangle - 1 freq fankles - 4 freq fankl't - 2 freq fingla's - 1 freq fankils - 1 freq fanckles - 1 freq fingle - 1 freq fankeliser - 3 freq fankle-cycle - 1 freq fankelites - 4 freq fankle-fork - 2 freq fankelite - 2 freq fankle-forks - 1 freq fnnsljnqsw - 1 freq finegael - 1 freq fangle - 1 freq fionahyslop - 7 freq fankle-heidit - 1 freq fnhjlejhxh - 1 freq fmujlhg - 1 freq |
MetaPhone code - FNKLTS fankelites - 4 freq |
FANKELITES |
| Time to execute Levenshtein function - 0.200432 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.370087 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.028097 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.037243 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.001248 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. |