| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refused (0) - 41 freq refuses (1) - 17 freq refuse (1) - 25 freq refuted (1) - 1 freq refuised (1) - 1 freq reuse (2) - 2 freq refuge (2) - 6 freq refusal (2) - 2 freq revised (2) - 2 freq refunded (2) - 1 freq defuse (2) - 2 freq rekksed (2) - 1 freq reduced (2) - 25 freq infused (2) - 4 freq refugee (2) - 5 freq eused (2) - 1 freq refuise (2) - 1 freq reised (2) - 1 freq fused (2) - 6 freq refined (2) - 8 freq refund (2) - 3 freq reffled (2) - 2 freq refusit (2) - 6 freq refusin (2) - 16 freq roused (2) - 14 freq |
refused (0) - 41 freq refuised (1) - 1 freq refuted (2) - 1 freq refaised (2) - 1 freq refuses (2) - 17 freq refuse (2) - 25 freq refund (3) - 3 freq refined (3) - 8 freq reised (3) - 1 freq refusit (3) - 6 freq roused (3) - 14 freq reesed (3) - 12 freq refuise (3) - 1 freq refusin (3) - 16 freq fused (3) - 6 freq revised (3) - 2 freq infused (3) - 4 freq refusal (3) - 2 freq raelised (4) - 3 freq rifled (4) - 1 freq released (4) - 31 freq rinsed (4) - 2 freq roosed (4) - 6 freq refereed (4) - 1 freq refeese (4) - 1 freq |
SoundEx code - R123 repositorie - 1 freq refused - 41 freq repost - 1 freq robust - 10 freq ravaged - 2 freq refusit - 6 freq revokit - 1 freq rhapsody - 1 freq refuised - 1 freq reveesitin - 1 freq repast - 1 freq rebukit - 3 freq reveesit - 1 freq rebiggit - 2 freq revisitit - 1 freq refected - 1 freq reveisitit - 1 freq reveisit - 1 freq refaised - 1 freq ripest - 1 freq re-biggit - 2 freq refectory - 1 freq revised - 2 freq re-passed - 1 freq reposeetion - 1 freq revisit - 3 freq revsitied - 1 freq revstu - 1 freq rfjtdh - 1 freq refyoozed - 1 freq raiphsadventcalandur - 1 freq rpxjzttv - 2 freq |
MetaPhone code - RFST refused - 41 freq refusit - 6 freq refuised - 1 freq roughest - 3 freq reveesit - 1 freq reveisit - 1 freq refaised - 1 freq revised - 2 freq revisit - 3 freq revstu - 1 freq |
REFUSED |
| Time to execute Levenshtein function - 0.297009 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.500908 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.027947 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.071494 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.000887 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. |