| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| figment (0) - 1 freq pigmen (2) - 1 freq aisment (2) - 1 freq pigments (2) - 1 freq fragment (2) - 2 freq fient (2) - 6 freq ferment (2) - 3 freq fitmen (2) - 1 freq augment (2) - 2 freq biggent (2) - 1 freq filament (2) - 2 freq ailment (2) - 2 freq firnent (2) - 1 freq segment (2) - 1 freq foment (2) - 2 freq fibert (3) - 2 freq mirkent (3) - 1 freq figgers (3) - 1 freq festent (3) - 1 freq pliament (3) - 1 freq simmet (3) - 3 freq muivment (3) - 5 freq finman (3) - 2 freq cogent (3) - 1 freq torment (3) - 15 freq |
figment (0) - 1 freq augment (3) - 2 freq filament (3) - 2 freq segment (3) - 1 freq foment (3) - 2 freq ferment (3) - 3 freq fragment (3) - 2 freq airgyment (4) - 6 freq argiment (4) - 2 freq argyment (4) - 2 freq jugement (4) - 3 freq argument (4) - 80 freq aagmint (4) - 1 freq regiment (4) - 21 freq airgument (4) - 6 freq fient (4) - 6 freq firnent (4) - 1 freq aisment (4) - 1 freq pigments (4) - 1 freq biggent (4) - 1 freq fitmen (4) - 1 freq ailment (4) - 2 freq pigmen (4) - 1 freq furrent (5) - 2 freq agent (5) - 13 freq |
SoundEx code - F255 fusomeness - 1 freq fishmongers - 1 freq fishmannie's - 2 freq fag-mingin - 1 freq fishman - 8 freq fushmongers - 1 freq fushmonger - 1 freq figment - 1 freq faxnumber - 1 freq fcnenk - 1 freq |
MetaPhone code - FKMNT figment - 1 freq |
FIGMENT |
| Time to execute Levenshtein function - 0.197392 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.386255 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.037645 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.046974 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.000782 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. |