| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hephaestus (0) - 2 freq ephasus (3) - 1 freq alphaeus (4) - 1 freq exhausts (4) - 2 freq heests (4) - 2 freq elephant's (5) - 1 freq paerts (5) - 1 freq ghaists (5) - 48 freq behest (5) - 2 freq plaesis (5) - 1 freq shaest (5) - 1 freq heat's (5) - 1 freq past's (5) - 2 freq herodotus (5) - 1 freq sealestu (5) - 1 freq exhausted (5) - 16 freq beastis (5) - 1 freq highnesses (5) - 1 freq heats (5) - 3 freq repents (5) - 2 freq exhaust (5) - 3 freq highness (5) - 1 freq shepherd's (5) - 7 freq heraclitus (5) - 2 freq herbaceous (5) - 5 freq |
hephaestus (0) - 2 freq ephasus (5) - 1 freq exhausts (6) - 2 freq heests (6) - 2 freq alphabets (7) - 1 freq happiest (7) - 10 freq highest (7) - 21 freq phasers (7) - 1 freq pastas (7) - 1 freq pests (7) - 2 freq wheests (7) - 1 freq alphaeus's (7) - 1 freq hoasts (7) - 8 freq ephesians (7) - 1 freq hapless (7) - 11 freq chests (7) - 7 freq elephants (7) - 12 freq heychesters (7) - 2 freq pasts (7) - 4 freq heychester (7) - 1 freq hippolytus (7) - 2 freq pastes (7) - 1 freq poasts (7) - 1 freq henhooses (7) - 1 freq priests (7) - 25 freq |
SoundEx code - H123 hauf-biggit - 2 freq hauf-shut - 2 freq hauf-past - 7 freq heavy-set - 1 freq hauf-steikit - 2 freq happiest - 10 freq haufbiggit - 1 freq hipster - 3 freq hauf-chaaed - 1 freq heavy-weight - 1 freq heavy-shoodered - 1 freq hivviest - 1 freq hobbyists - 1 freq haafgaits - 1 freq hauf-stirred - 1 freq heaviest - 2 freq hopscotch - 3 freq hauf-gates - 1 freq hephaestus - 2 freq hauf-baked - 1 freq heavyweicht - 1 freq hyvast - 6 freq hevagidday - 1 freq heeposhit - 1 freq havester - 1 freq hbctyy - 1 freq hbkxcdgvss - 1 freq hubster - 1 freq hfqwd - 1 freq heavyweight - 1 freq hipsters - 1 freq hbjgtize - 1 freq |
MetaPhone code - HFSTS hephaestus - 2 freq |
HEPHAESTUS |
| Time to execute Levenshtein function - 0.208625 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.429490 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.029070 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.038365 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. |