| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitwards (0) - 1 freq fithauds (2) - 1 freq fitwark (2) - 3 freq tiwards (2) - 3 freq liftwards (2) - 1 freq outwards (2) - 1 freq ootwards (2) - 12 freq inwards (2) - 7 freq forwards (2) - 5 freq atwards (2) - 3 freq westwards (3) - 1 freq onwards (3) - 19 freq firearms (3) - 1 freq fitbans (3) - 1 freq forward (3) - 162 freq coowards (3) - 1 freq fitbas (3) - 1 freq furwirds (3) - 1 freq retards (3) - 1 freq fingars (3) - 1 freq stewards (3) - 4 freq norwards (3) - 1 freq fithers (3) - 4 freq lizards (3) - 4 freq seawards (3) - 1 freq |
fitwards (0) - 1 freq forwards (3) - 5 freq atwards (3) - 3 freq outwards (3) - 1 freq ootwards (3) - 12 freq liftwards (3) - 1 freq tiwards (3) - 3 freq furwirds (4) - 1 freq twaards (4) - 1 freq forwirds (4) - 1 freq taewards (4) - 186 freq tawards (4) - 7 freq stewards (4) - 4 freq towards (4) - 170 freq futrads (4) - 2 freq fitwark (4) - 3 freq fithauds (4) - 1 freq eftirwards (4) - 2 freq inwards (4) - 7 freq eastwards (4) - 3 freq upwards (5) - 12 freq fitwear (5) - 1 freq outward (5) - 2 freq inwairds (5) - 1 freq edwards (5) - 5 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.374644 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.412091 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.027562 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.040249 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.000937 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. |