Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
zephaniah (0) - 3 freq bzephaniah (1) - 1 freq zechariah (2) - 19 freq verandah (4) - 6 freq bethanie (4) - 2 freq mechanism (4) - 6 freq pharoah (4) - 1 freq mechanik (4) - 1 freq hannah (4) - 10 freq mechanic (4) - 7 freq zechariah's (4) - 4 freq replenish (4) - 1 freq nehemiah (4) - 1 freq stephanie (4) - 7 freq zenith (4) - 2 freq spanish (4) - 41 freq mean-ah (4) - 1 freq jeconiah (4) - 4 freq mechanics (4) - 6 freq mechanival (4) - 1 freq mechanical (4) - 19 freq papish (5) - 1 freq separat (5) - 1 freq ethnic (5) - 32 freq mechanised (5) - 1 freq |
zephaniah (0) - 3 freq bzephaniah (2) - 1 freq zechariah (4) - 19 freq pharoah (6) - 1 freq phonic (7) - 2 freq penah (7) - 1 freq phonin (7) - 22 freq orphanage (7) - 7 freq phonie (7) - 1 freq phanuel (7) - 2 freq zeph (7) - 1 freq zephyr (7) - 2 freq pharoh (7) - 1 freq jeconiah (7) - 4 freq phonan (7) - 2 freq orphan (7) - 14 freq orphaned (7) - 5 freq stephanie (7) - 7 freq mechanic (7) - 7 freq nehemiah (7) - 1 freq hannah (7) - 10 freq replenish (7) - 1 freq zenith (7) - 2 freq elephant (7) - 35 freq spanish (7) - 41 freq |
SoundEx code - Z150 zephaniah - 3 freq zczofm - 1 freq zbma - 1 freq |
MetaPhone code - SFN seeven - 95 freq sivven - 15 freq sighin - 20 freq seven - 120 freq svein - 1 freq seiven - 113 freq seev'n - 1 freq zephaniah - 3 freq siven - 2 freq savin - 38 freq syven - 10 freq sayven - 1 freq sev'n - 1 freq sayfin - 1 freq savannah - 2 freq sivin - 4 freq seevin - 27 freq saffen - 1 freq sven - 2 freq seivin - 4 freq 'seeven - 2 freq siffin - 1 freq sighan - 5 freq soghin - 1 freq savan - 1 freq sowffin - 2 freq soffin - 1 freq savanna - 2 freq sieven - 2 freq soughin - 2 freq sauvin - 1 freq €˜saufin - 2 freq seevun - 1 freq €˜seeven - 1 freq sievin - 1 freq seevin' - 2 freq saufin - 1 freq sivvin - 1 freq civuni - 1 freq |
ZEPHANIAH |
Time to execute Levenshtein function - 0.227878 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.387299 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.028785 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.042252 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.001124 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. |