| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| richtfully (0) - 1 freq rightfully (1) - 1 freq richteously (3) - 1 freq richtly (3) - 49 freq rightful (3) - 1 freq aictully (3) - 1 freq fitfully (3) - 1 freq tactfully (3) - 1 freq thochtfully (3) - 5 freq richtfu' (3) - 1 freq wistfully (3) - 3 freq richtfu (3) - 15 freq lichtly (4) - 15 freq micht'll (4) - 1 freq lichtfu (4) - 5 freq frichtfu (4) - 1 freq lauchfully (4) - 1 freq michtfu (4) - 1 freq fethfully (4) - 1 freq faithfully (4) - 1 freq richtfae (4) - 2 freq michtily (4) - 2 freq richual (4) - 1 freq rightly (4) - 10 freq lichtbulb (4) - 1 freq |
richtfully (0) - 1 freq rightfully (2) - 1 freq richtfu' (5) - 1 freq thochtfully (5) - 5 freq richtfu (5) - 15 freq tactfully (5) - 1 freq rightful (5) - 1 freq richteously (5) - 1 freq richtly (5) - 49 freq richtfae (6) - 2 freq richtfoo (6) - 1 freq richtfou (6) - 2 freq licht'll (6) - 2 freq richtlie (6) - 14 freq resentfully (6) - 1 freq richtfa (6) - 3 freq micht'll (6) - 1 freq lauchfully (6) - 1 freq fitfully (6) - 1 freq thouchtfully (6) - 3 freq regretfully (6) - 1 freq aictully (6) - 1 freq wistfully (6) - 3 freq richly (7) - 4 freq richtous (7) - 1 freq |
SoundEx code - R231 richtfae - 2 freq richtfu - 15 freq richtfou - 2 freq roostaboots - 1 freq reactive - 5 freq re-establishit - 1 freq rightfully - 1 freq richtified - 1 freq richtifyin - 1 freq richtfu' - 1 freq rectify - 2 freq restive - 1 freq re-establishin - 1 freq richtfa - 3 freq re-establish - 1 freq richtfoo - 1 freq richtfully - 1 freq reestablish - 1 freq re-estaiblisht - 1 freq roystevenson - 1 freq rossgstv - 1 freq restful - 1 freq rochdevelopment - 1 freq rightful - 1 freq rgstbz - 1 freq rjdbejrxkm - 1 freq |
MetaPhone code - RXTFL richtfully - 1 freq |
RICHTFULLY |
| Time to execute Levenshtein function - 0.232128 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.378183 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.028461 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.037972 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.000927 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. |