Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
friable (0) - 2 freq dribble (2) - 3 freq tribble (2) - 31 freq variable (2) - 5 freq frizzle (2) - 2 freq arable (2) - 8 freq amiable (2) - 1 freq frisbee (2) - 4 freq viable (2) - 11 freq fable (2) - 8 freq feable (2) - 1 freq fixable (2) - 1 freq liable (2) - 4 freq grille (3) - 1 freq ariadne (3) - 4 freq edible (3) - 3 freq fridae (3) - 1 freq cradle (3) - 23 freq drittle (3) - 1 freq yable (3) - 7 freq suitable (3) - 13 freq gibble (3) - 1 freq nibble (3) - 8 freq enable (3) - 4 freq -able (3) - 1 freq |
friable (0) - 2 freq feable (3) - 1 freq fixable (3) - 1 freq arable (3) - 8 freq fable (3) - 8 freq variable (3) - 5 freq proably (4) - 1 freq mairble (4) - 4 freq firbye (4) - 29 freq frail (4) - 18 freq affable (4) - 1 freq freebie (4) - 2 freq frienly (4) - 5 freq frilly (4) - 8 freq truible (4) - 1 freq trooble (4) - 1 freq treble (4) - 9 freq dreeble (4) - 1 freq fumble (4) - 1 freq rouble (4) - 7 freq feeble (4) - 10 freq frisbee (4) - 4 freq viable (4) - 11 freq amiable (4) - 1 freq frizzle (4) - 2 freq |
SoundEx code - F614 forflithert - 1 freq fireplace - 25 freq fearful - 10 freq fireflaucht - 5 freq fire-bells - 1 freq fearfu-like - 1 freq fireflies - 1 freq freffly - 1 freq frivolity - 1 freq farvel - 1 freq fairfield - 1 freq ferfull - 2 freq ferful - 2 freq fireplaces - 1 freq foreplay - 2 freq forefolk - 2 freq far-flung - 2 freq ferfal - 8 freq fairfal - 1 freq fireplace's - 1 freq fearfully - 3 freq fowerfaul - 1 freq frivolous - 2 freq friable - 2 freq fire-filled - 1 freq ferfil - 7 freq fair-fleggit - 1 freq faerful - 2 freq fripples - 1 freq fripple's - 1 freq free-flowin - 1 freq fireflauchts - 4 freq firefly - 1 freq fireballs - 1 freq €œfirefly - 1 freq fire-fly - 1 freq faur-flung - 1 freq freebelfast - 1 freq freyabalfour - 1 freq |
MetaPhone code - FRBL verbal - 29 freq friable - 2 freq verball - 1 freq variable - 5 freq verbally - 1 freq |
FRIABLE |
Time to execute Levenshtein function - 0.250527 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.575823 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.032240 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.047876 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.000906 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. |