| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| florence (0) - 29 freq jflorence (1) - 1 freq florewnce (1) - 1 freq florence's (2) - 2 freq clarence (2) - 2 freq fawrence (2) - 1 freq licence (3) - 29 freq flores (3) - 1 freq flamenco (3) - 1 freq fleece (3) - 11 freq provence (3) - 1 freq flouncy (3) - 1 freq french (3) - 260 freq fluency (3) - 6 freq florrie (3) - 1 freq foree (3) - 1 freq flouerie (3) - 2 freq france (3) - 84 freq orenge (3) - 2 freq lorne (3) - 6 freq flounced (3) - 1 freq glence (3) - 4 freq forebye (3) - 59 freq prence (3) - 1 freq flooerie (3) - 3 freq |
florence (0) - 29 freq florewnce (2) - 1 freq jflorence (2) - 1 freq clarence (3) - 2 freq fawrence (3) - 1 freq frunce (4) - 1 freq florin (4) - 4 freq flunce (4) - 1 freq laurence (4) - 10 freq tolerence (4) - 1 freq fluency (4) - 6 freq france (4) - 84 freq flamenco (4) - 1 freq florence's (4) - 2 freq flouncy (4) - 1 freq francie (5) - 2 freq flense (5) - 1 freq foreneen (5) - 39 freq fence (5) - 154 freq flowen (5) - 2 freq flooerin (5) - 4 freq lawrence (5) - 5 freq terence (5) - 1 freq flarin (5) - 3 freq franca (5) - 8 freq |
SoundEx code - F465 florence - 29 freq flairin - 2 freq florin - 4 freq florence's - 2 freq flooerin - 4 freq flaran - 1 freq floareen - 1 freq fleerin - 4 freq flarin - 3 freq fleerymaneerie - 1 freq florewnce - 1 freq florentines - 1 freq florencerounda - 1 freq flyering - 1 freq |
MetaPhone code - FLRNS florence - 29 freq florewnce - 1 freq |
FLORENCE |
| Time to execute Levenshtein function - 0.435190 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.568404 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.027319 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.071264 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.000779 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. |