| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| near-aboot (0) - 1 freq nearaboot (1) - 3 freq naur-aboot (2) - 1 freq nearaboots (2) - 1 freq gaan-aboot (3) - 1 freq naeraboot (3) - 4 freq nortaboot (3) - 1 freq near-front (3) - 1 freq hereaboot (3) - 1 freq gan-aboot (3) - 1 freq near-shut (4) - 2 freq nearabuin (4) - 1 freq carboot (4) - 3 freq here-aboots (4) - 2 freq ill-aboot (4) - 1 freq gaun-aboot (4) - 2 freq thare-about (4) - 2 freq eraboots (4) - 1 freq far-oot (4) - 1 freq farraboots (4) - 1 freq faraboots (4) - 2 freq hereaboots (4) - 31 freq oot-aboot (4) - 1 freq thareaboots (4) - 1 freq whauraboot (4) - 1 freq |
near-aboot (0) - 1 freq naur-aboot (2) - 1 freq nearaboot (2) - 3 freq nortaboot (4) - 1 freq naeraboot (4) - 4 freq nearaboots (4) - 1 freq hereaboot (5) - 1 freq in-aboot (5) - 1 freq gan-aboot (5) - 1 freq gaan-aboot (5) - 1 freq nor-aist (6) - 3 freq turnaboot (6) - 1 freq oot-aboot (6) - 1 freq near-on (6) - 2 freq nearmaist (6) - 1 freq touraboot (6) - 1 freq hereabout (6) - 1 freq trailaboot (6) - 1 freq naeraboots (6) - 1 freq near-low (6) - 1 freq gaun-aboot (6) - 2 freq carboot (6) - 3 freq nearabuin (6) - 1 freq near-shut (6) - 2 freq near-front (6) - 1 freq |
SoundEx code - N613 nearaboots - 1 freq nearaboot - 3 freq naeraboot - 4 freq naeraboots - 1 freq near-aboot - 1 freq naur-aboot - 1 freq |
MetaPhone code - NRBT nearaboot - 3 freq naeraboot - 4 freq near-aboot - 1 freq naur-aboot - 1 freq |
NEAR-ABOOT |
| Time to execute Levenshtein function - 0.574005 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.704341 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.030353 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.077123 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.000893 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. |