| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queenamoan (0) - 1 freq queestion (4) - 17 freq queens (5) - 40 freq queestions (5) - 4 freq bemoan (5) - 1 freq een-an (5) - 1 freq queen-it (5) - 1 freq belnamore (5) - 3 freq gweedman (5) - 3 freq queelrods (5) - 3 freq eendoun (5) - 2 freq teename (5) - 1 freq queen (5) - 643 freq queenie (5) - 3 freq squeakan (5) - 2 freq sweengan (5) - 2 freq opeenian (5) - 1 freq teeman (5) - 2 freq screaman (5) - 5 freq henman (5) - 1 freq belnagoak (5) - 1 freq queenis (5) - 1 freq steenmason (5) - 1 freq gleaman (5) - 1 freq breedman (5) - 1 freq |
queenamoan (0) - 1 freq penman (6) - 1 freq quentin (6) - 6 freq henman (6) - 1 freq queestion (6) - 17 freq queen' (7) - 1 freq weengan (7) - 1 freq cinnamon (7) - 5 freq neemeen (7) - 1 freq opeenion (7) - 32 freq queeryin (7) - 1 freq queenies (7) - 1 freq cumoan (7) - 2 freq queen'd (7) - 1 freq queen- (7) - 1 freq naaman (7) - 2 freq seemon (7) - 17 freq eenan (7) - 1 freq undoan (7) - 2 freq eamonn (7) - 9 freq peengan (7) - 1 freq bukeman (7) - 1 freq steaman (7) - 2 freq namin (7) - 7 freq wutnman (7) - 1 freq |
SoundEx code - Q555 queenamoan - 1 freq |
MetaPhone code - KNMN canmnae - 1 freq queenamoan - 1 freq con-man - 1 freq ken-me-na - 1 freq |
QUEENAMOAN |
| Time to execute Levenshtein function - 0.237300 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.415818 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.029394 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.039352 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.000942 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. |