| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alvinstraight (0) - 1 freq awfastraight (4) - 1 freq distraught (5) - 1 freq straight (5) - 236 freq stgaight (6) - 1 freq ravenscraig (6) - 2 freq plainstains (6) - 1 freq yalla-straikit (6) - 1 freq straught (6) - 1 freq alistair's (6) - 6 freq staight (6) - 1 freq lightweight (6) - 3 freq streight (6) - 4 freq insight (6) - 5 freq stright (6) - 1 freq martingeraght (6) - 1 freq alicraig (6) - 1 freq poker-straight (6) - 1 freq alistair (6) - 22 freq alright (6) - 21 freq straieht (6) - 1 freq mistraucht (6) - 1 freq straicht (6) - 129 freq constraint (6) - 1 freq insertit (7) - 2 freq |
alvinstraight (0) - 1 freq awfastraight (7) - 1 freq straight (8) - 236 freq distraught (8) - 1 freq stright (9) - 1 freq straught (9) - 1 freq streight (9) - 4 freq straieht (10) - 1 freq poker-straight (10) - 1 freq mistraucht (10) - 1 freq streght (10) - 2 freq heaven-taught (10) - 1 freq constraint (10) - 1 freq straicht (10) - 129 freq alright (10) - 21 freq staight (10) - 1 freq yalla-straikit (10) - 1 freq ravenscraig (10) - 2 freq lightweight (10) - 3 freq stgaight (10) - 1 freq insight (10) - 5 freq doonright (11) - 2 freq stricht (11) - 1 freq twinty-eight (11) - 1 freq instructit (11) - 1 freq |
SoundEx code - A415 aleevint - 1 freq album - 24 freq albums - 8 freq albania - 1 freq alban - 3 freq aleyven - 2 freq alpin - 7 freq alfenus - 1 freq aa-lappin - 8 freq alven - 1 freq alfounder - 1 freq alpinson - 1 freq albanian - 1 freq alabama - 2 freq albion - 3 freq aliveness - 2 freq aleevin - 1 freq alpine - 2 freq allophone - 1 freq albino - 2 freq alvinstraight - 1 freq alivin - 1 freq albannach - 8 freq albans - 1 freq alibammm - 2 freq |
MetaPhone code - ALFNSTRF |
ALVINSTRAIGHT |
| Time to execute Levenshtein function - 0.219726 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.392572 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.027400 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.037723 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.000882 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. |