| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foreplay (0) - 2 freq horseplay (2) - 1 freq roleplay (2) - 1 freq forepaas (2) - 1 freq replay (2) - 5 freq fore-paas (3) - 1 freq foreleg (3) - 1 freq freely (3) - 28 freq formerly (3) - 3 freq foredaw (3) - 2 freq formulae (3) - 3 freq replays (3) - 1 freq forestaa (3) - 3 freq foray (3) - 1 freq rokelay (3) - 1 freq foreman (3) - 5 freq repay (3) - 1 freq sorely (3) - 2 freq foreby (3) - 2 freq owerlay (3) - 1 freq fregley (3) - 2 freq fureday (3) - 1 freq fireplace (3) - 25 freq role-play (3) - 2 freq fellay (3) - 2 freq |
foreplay (0) - 2 freq replay (3) - 5 freq forepaas (3) - 1 freq fregley (4) - 2 freq formulae (4) - 3 freq firefly (4) - 1 freq fireplace (4) - 25 freq formula (4) - 8 freq freely (4) - 28 freq roleplay (4) - 1 freq reply (4) - 165 freq horseplay (4) - 1 freq furly (5) - 10 freq firmly (5) - 42 freq foretoul (5) - 3 freq relay (5) - 4 freq forehan (5) - 4 freq freyday (5) - 5 freq fordel (5) - 7 freq fordil (5) - 1 freq frienly (5) - 5 freq freelie (5) - 3 freq purpley (5) - 1 freq freenly (5) - 22 freq frilly (5) - 8 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 - FRPL foreplay - 2 freq |
FOREPLAY |
| Time to execute Levenshtein function - 0.327606 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.390606 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.028518 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.038227 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.000846 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. |