| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exclaim (0) - 6 freq exclaims (1) - 4 freq exclaimt (1) - 24 freq exclaimet (2) - 1 freq explain (2) - 166 freq reclaim (2) - 7 freq claim (2) - 80 freq declaim (2) - 1 freq acclaim (2) - 3 freq 'claim (2) - 4 freq exclaimed (2) - 36 freq exclaimin (2) - 1 freq exclaimit (2) - 1 freq claimt (3) - 3 freq re-claims (3) - 1 freq explaen (3) - 2 freq clam (3) - 10 freq proclaim (3) - 5 freq claem (3) - 2 freq enclave (3) - 3 freq exaltit (3) - 1 freq exlpid (3) - 1 freq sclam (3) - 1 freq glaim (3) - 4 freq excludin (3) - 1 freq |
exclaim (0) - 6 freq exclaimt (2) - 24 freq exclaims (2) - 4 freq 'claim (3) - 4 freq exclaimed (3) - 36 freq exclaimit (3) - 1 freq acclaim (3) - 3 freq exclaimin (3) - 1 freq declaim (3) - 1 freq reclaim (3) - 7 freq exclaimet (3) - 1 freq claim (3) - 80 freq sclam (4) - 1 freq clim (4) - 33 freq exclude (4) - 4 freq claem (4) - 2 freq sclim (4) - 25 freq explain (4) - 166 freq clam (4) - 10 freq 'calm (5) - 10 freq excaise (5) - 6 freq becaim (5) - 2 freq clem (5) - 4 freq exchie (5) - 1 freq exam (5) - 19 freq |
SoundEx code - E245 exclaimt - 24 freq exclaimed - 36 freq exclamation - 4 freq exclaims - 4 freq excellence' - 2 freq excellence - 23 freq exclaimit - 1 freq exclaim - 6 freq exclaimin - 1 freq excellent - 26 freq esquiline - 1 freq exclamaetion - 1 freq eaglewaang - 1 freq easslin - 1 freq esh-lance - 1 freq eglon - 1 freq exclamations - 1 freq esslemont - 3 freq excelling - 1 freq echelons - 1 freq €˜excellent - 2 freq exclaimet - 1 freq |
MetaPhone code - EKSKLM exclaim - 6 freq |
EXCLAIM |
| Time to execute Levenshtein function - 0.261315 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.419284 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.029877 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.042250 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.000960 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. |