| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitwards (0) - 1 freq forwards (2) - 5 freq ootwards (2) - 12 freq inwards (2) - 7 freq tiwards (2) - 3 freq fitwark (2) - 3 freq liftwards (2) - 1 freq outwards (2) - 1 freq fithauds (2) - 1 freq atwards (2) - 3 freq tiward's (3) - 5 freq ootward (3) - 6 freq inwairds (3) - 1 freq cowards (3) - 5 freq retards (3) - 1 freq fitbas (3) - 1 freq bakwards (3) - 2 freq netwarks (3) - 2 freq stewards (3) - 4 freq tacwards (3) - 1 freq slawards (3) - 1 freq innards (3) - 4 freq fitman's (3) - 2 freq fitnaes (3) - 1 freq fitters (3) - 3 freq |
fitwards (0) - 1 freq liftwards (3) - 1 freq atwards (3) - 3 freq tiwards (3) - 3 freq outwards (3) - 1 freq forwards (3) - 5 freq ootwards (3) - 12 freq twaards (4) - 1 freq furwirds (4) - 1 freq eastwards (4) - 3 freq tawards (4) - 7 freq eftirwards (4) - 2 freq forwirds (4) - 1 freq towards (4) - 161 freq futrads (4) - 2 freq taewards (4) - 183 freq stewards (4) - 4 freq fitwark (4) - 3 freq fithauds (4) - 1 freq inwards (4) - 7 freq efterwards (5) - 17 freq skywards (5) - 2 freq aifterwards (5) - 3 freq forward (5) - 158 freq fitmerks (5) - 9 freq |
SoundEx code - F363 futrets - 2 freq feathered - 7 freq futrat - 10 freq featured - 9 freq foothert - 2 freq footered - 5 freq futtered - 1 freq federated - 1 freq faithered - 3 freq footert - 3 freq futret - 7 freq faidered - 1 freq futrads - 2 freq fethert - 1 freq featurt - 1 freq fittert - 1 freq futrats - 1 freq fittret - 1 freq futterat - 14 freq futterat's - 1 freq faitherit - 1 freq federation - 3 freq fitwards - 1 freq futterats - 1 freq faytert - 1 freq faitherhood - 1 freq futtret - 1 freq ftrdbbgxy - 1 freq futtritt - 1 freq futtrit - 1 freq fdrt - 1 freq |
MetaPhone code - FTWRTS fitwards - 1 freq |
FITWARDS |
| Time to execute Levenshtein function - 0.215513 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.373258 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.027992 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.037230 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.000843 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. |