| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oneborn (0) - 1 freq reborn (2) - 7 freq newborn (2) - 11 freq unborn (2) - 7 freq reboun (3) - 1 freq nebir (3) - 1 freq inkhorn (3) - 2 freq unicorn (3) - 61 freq oberon (3) - 1 freq €˜born (3) - 1 freq themorn (3) - 1 freq neibor (3) - 3 freq ongoin (3) - 4 freq born (3) - 333 freq onion (3) - 14 freq neebors (3) - 79 freq re-born (3) - 1 freq freeborn (3) - 1 freq nibors (3) - 2 freq osborne (3) - 3 freq laebor (3) - 1 freq loreburn (3) - 2 freq neeborin (3) - 6 freq new-born (3) - 3 freq onbody (3) - 1 freq |
oneborn (0) - 1 freq unborn (2) - 7 freq nyborin (3) - 1 freq unboarn (3) - 1 freq neeborin (3) - 6 freq niborin (3) - 11 freq newborn (3) - 11 freq reborn (3) - 7 freq neiborin (3) - 1 freq nibor (4) - 2 freq 'born (4) - 1 freq neebor (4) - 43 freq onboard (4) - 2 freq nibon (4) - 1 freq neibors (4) - 7 freq raeburn (4) - 1 freq neebourin (4) - 3 freq nynorn (4) - 1 freq nebbin (4) - 2 freq newboarn (4) - 2 freq norn (4) - 34 freq neebirin (4) - 1 freq neibourin (4) - 5 freq born (4) - 333 freq nibors (4) - 2 freq |
SoundEx code - O516 onywey-prolly - 1 freq oonprobabeelity - 2 freq oonfirmin - 1 freq onboard - 2 freq oonfair - 1 freq onparpent - 1 freq onfreindlie - 1 freq oonfairness - 1 freq on-birthday - 3 freq €”one-verse - 1 freq on-buird - 1 freq omnivores - 1 freq onfreinlie - 2 freq on-froggit - 1 freq oomfort - 1 freq oneborn - 1 freq ombr - 1 freq owenbrandmsyp - 1 freq |
MetaPhone code - ONBRN oneborn - 1 freq |
ONEBORN |
| Time to execute Levenshtein function - 0.233426 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.383387 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.027542 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.039095 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.004002 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. |