| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clearances (0) - 12 freq clearance (1) - 16 freq clearan (3) - 2 freq clarence's (3) - 1 freq pleasance (3) - 3 freq appearances (3) - 9 freq deavances (3) - 1 freq clarence (3) - 2 freq owerances (3) - 1 freq clairance (3) - 1 freq frances (4) - 15 freq prances (4) - 1 freq beirance (4) - 1 freq clears (4) - 19 freq pleasence (4) - 1 freq cleanan (4) - 2 freq enhances (4) - 1 freq learner (4) - 7 freq clenches (4) - 1 freq cranes (4) - 7 freq cleanest (4) - 1 freq cleanse (4) - 3 freq clearest (4) - 4 freq celebrants (4) - 1 freq clear's (4) - 1 freq |
clearances (0) - 12 freq clearance (2) - 16 freq clarence (4) - 2 freq clairance (4) - 1 freq clarence's (4) - 1 freq clearan (5) - 2 freq owerances (5) - 1 freq appearances (5) - 9 freq learners (6) - 6 freq cadences (6) - 1 freq balances (6) - 3 freq allegiances (6) - 1 freq clearing (6) - 3 freq clannies (6) - 1 freq entrances (6) - 1 freq cleans (6) - 9 freq clear-cut (6) - 1 freq carnies (6) - 2 freq clearin (6) - 27 freq assurances (6) - 2 freq lances (6) - 1 freq learns (6) - 10 freq glances (6) - 13 freq allouances (6) - 1 freq alliances (6) - 2 freq |
SoundEx code - C465 clourin - 1 freq clarinet - 3 freq clearances - 12 freq clearin - 27 freq cowlraine - 2 freq coulrain' - 2 freq coulrain - 1 freq cailry-on's - 1 freq clarence - 2 freq clearance - 16 freq clearan - 2 freq cullourin - 1 freq clairance - 1 freq chlorine - 1 freq clarinda - 1 freq callerin - 1 freq clarence's - 1 freq clairin - 1 freq cloorin - 1 freq clearing - 3 freq clarion - 1 freq colourin - 3 freq clarendon - 1 freq colourins - 1 freq coleraine - 4 freq clewran - 1 freq chlorinated - 1 freq clairehanm - 1 freq colouring - 2 freq clear-minded - 1 freq colourin-in - 3 freq clairehammond - 1 freq |
MetaPhone code - KLRNSS clearances - 12 freq clarence's - 1 freq |
CLEARANCES |
| Time to execute Levenshtein function - 0.207119 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.392472 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.030808 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.036709 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.000848 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. |