| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rear-view (0) - 3 freq review (3) - 71 freq eye-view (3) - 1 freq seaview (3) - 7 freq reerie (4) - 4 freq readie (4) - 36 freq readies (4) - 3 freq overview (4) - 1 freq garvie (4) - 1 freq wearier (4) - 1 freq pearlie (4) - 1 freq near-seen (4) - 1 freq earlier (4) - 109 freq realities (4) - 9 freq feartie (4) - 15 freq jarvie (4) - 5 freq remarried (4) - 3 freq renharvieu (4) - 1 freq owerview (4) - 10 freq drearie (4) - 1 freq wearies (4) - 2 freq tearie (4) - 1 freq wearilie (4) - 1 freq dwarvies (4) - 5 freq weariet (4) - 19 freq |
rear-view (0) - 3 freq review (5) - 71 freq eye-view (5) - 1 freq burraview (6) - 2 freq owerview (6) - 10 freq overview (6) - 1 freq near-low (6) - 1 freq rear-enn (6) - 1 freq freeview (6) - 1 freq seaview (6) - 7 freq year-en (7) - 1 freq heir-awaw (7) - 1 freq reared (7) - 24 freq harvie (7) - 3 freq reviews (7) - 19 freq real-life (7) - 1 freq road-wey (7) - 1 freq arvie (7) - 1 freq redrew (7) - 1 freq repruved (7) - 1 freq review' (7) - 1 freq lear-time (7) - 4 freq earrier (7) - 1 freq rearit (7) - 1 freq rearin (7) - 8 freq |
SoundEx code - R610 rear-view - 3 freq |
MetaPhone code - RRF rear-view - 3 freq |
REAR-VIEW |
| Time to execute Levenshtein function - 0.200948 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.359771 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.028150 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.036774 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.000921 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. |