| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| figuratif (0) - 1 freq figurative (2) - 3 freq feigurative (3) - 2 freq migratin (3) - 1 freq figuratively (4) - 7 freq situatit (4) - 1 freq migration (4) - 10 freq gratin (4) - 4 freq figueral (4) - 1 freq graif (4) - 3 freq regulatit (4) - 2 freq migrates (4) - 1 freq figurs (4) - 7 freq figur (4) - 2 freq figure (4) - 106 freq curatit (4) - 1 freq migrate (4) - 1 freq gratis (4) - 3 freq figurine (4) - 2 freq vibratin (4) - 2 freq fightin (4) - 34 freq figurr (4) - 2 freq fiurst (4) - 1 freq fingertip (4) - 1 freq figurines (4) - 2 freq |
figuratif (0) - 1 freq figurative (3) - 3 freq feigurative (4) - 2 freq migratin (5) - 1 freq figurines (6) - 2 freq gyratin (6) - 1 freq figures (6) - 48 freq figurr (6) - 2 freq fightin (6) - 34 freq figured (6) - 11 freq fingertip (6) - 1 freq odoratif (6) - 1 freq ungratefu (6) - 6 freq fortify (6) - 1 freq gratefu (6) - 28 freq fogarty (6) - 1 freq firritin (6) - 1 freq figures' (6) - 1 freq emigratit (6) - 1 freq migrates (6) - 1 freq figurs (6) - 7 freq gratin (6) - 4 freq graif (6) - 3 freq figurine (6) - 2 freq figueral (6) - 1 freq |
SoundEx code - F263 figured - 11 freq fichert - 1 freq fuskered - 1 freq fissured - 1 freq fjords - 2 freq fu-growed - 2 freq figuratif - 1 freq fiegured - 1 freq figuratively - 7 freq figurative - 3 freq fjord - 2 freq focherty - 1 freq fause-hertit - 1 freq foghradh - 1 freq feigurative - 2 freq fasert - 1 freq faizart - 1 freq fawkert - 2 freq fichertie - 1 freq fichered - 1 freq fogarty - 1 freq |
MetaPhone code - FKRTF figuratif - 1 freq figurative - 3 freq feigurative - 2 freq |
FIGURATIF |
| Time to execute Levenshtein function - 0.228711 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.394603 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.030881 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.039329 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.000874 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. |