| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| figurative (0) - 3 freq feigurative (1) - 2 freq figuratif (2) - 1 freq figuratively (2) - 7 freq figurine (3) - 2 freq furtive (3) - 2 freq figurines (4) - 2 freq vegetative (4) - 2 freq formative (4) - 2 freq fricative (4) - 17 freq migration (4) - 10 freq fugitive (4) - 3 freq lucrative (4) - 2 freq decorative (4) - 2 freq causative (4) - 1 freq gustative (4) - 1 freq migrate (4) - 1 freq negative (4) - 41 freq migrating (4) - 1 freq migraine (4) - 3 freq imitative (4) - 1 freq furgive (4) - 4 freq four-five (4) - 2 freq migratin (4) - 1 freq figure (4) - 106 freq |
figurative (0) - 3 freq feigurative (1) - 2 freq figuratively (3) - 7 freq figuratif (3) - 1 freq furtive (4) - 2 freq fugitive (5) - 3 freq figurine (5) - 2 freq firgive (6) - 2 freq figure (6) - 106 freq furgive (6) - 4 freq migratin (6) - 1 freq digestive (6) - 4 freq narrative (6) - 41 freq nairrative (6) - 3 freq negative (6) - 41 freq nairative (6) - 3 freq imperative (6) - 9 freq migrate (6) - 1 freq fricative (6) - 17 freq migration (6) - 10 freq formative (6) - 2 freq vegetative (6) - 2 freq figurines (6) - 2 freq decorative (6) - 2 freq lucrative (6) - 2 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 |
FIGURATIVE |
| Time to execute Levenshtein function - 0.258744 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.386903 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.028531 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.040073 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.000825 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. |