| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faraboots (0) - 2 freq farraboots (1) - 1 freq layaboots (2) - 1 freq nearaboots (2) - 1 freq naeraboots (2) - 1 freq hiraboots (2) - 2 freq eraboots (2) - 1 freq whaaraboots (3) - 1 freq inaboots (3) - 3 freq far-oot (3) - 1 freq thareaboots (3) - 1 freq a'aboot (3) - 1 freq gadaboot (3) - 1 freq naeraboot (3) - 4 freq hereaboots (3) - 31 freq farmfoods (3) - 1 freq walkaboots (3) - 2 freq in-aboots (3) - 1 freq theraboots (3) - 1 freq whauraboots (3) - 5 freq carboot (3) - 3 freq nearaboot (3) - 3 freq rinaboots (3) - 1 freq aboots (3) - 15 freq brak-oots (4) - 1 freq |
faraboots (0) - 2 freq farraboots (2) - 1 freq eraboots (3) - 1 freq naeraboots (3) - 1 freq hiraboots (3) - 2 freq nearaboots (3) - 1 freq hereaboots (4) - 31 freq layaboots (4) - 1 freq rinaboots (5) - 1 freq whauraboots (5) - 5 freq aboots (5) - 15 freq carboot (5) - 3 freq farts (5) - 5 freq theraboots (5) - 1 freq hereabouts (5) - 5 freq firlots (5) - 2 freq robots (5) - 4 freq nearaboot (5) - 3 freq thareaboots (5) - 1 freq far-oot (5) - 1 freq in-aboots (5) - 1 freq inaboots (5) - 3 freq fronts (5) - 1 freq whaaraboots (5) - 1 freq naeraboot (5) - 4 freq |
SoundEx code - F613 forbid - 10 freq four-bedroom - 1 freq forbidden - 15 freq faraboots - 2 freq forebodins - 2 freq forfeited - 1 freq forfeit - 9 freq forebodin - 4 freq forbodin - 4 freq forfaithers - 2 freq forbad - 5 freq forefeitit - 1 freq faur-fetcht - 1 freq four-foot - 1 freq forefaithers - 5 freq forefaither - 1 freq forbïd - 1 freq forebodin' - 1 freq foreboding - 2 freq fower-fit - 1 freq forfeits - 2 freq forefit - 1 freq forbids - 1 freq foirfaithers - 1 freq forpit - 1 freq forefathers - 5 freq frappid - 1 freq forbiddin - 2 freq farraboots - 1 freq |
MetaPhone code - FRBTS faraboots - 2 freq forbids - 1 freq farraboots - 1 freq |
FARABOOTS |
| Time to execute Levenshtein function - 0.397750 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.972139 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.101492 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.197374 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.001250 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. |