| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feibn (0) - 1 freq feinn (1) - 1 freq feign (1) - 3 freq fein (1) - 3 freq fion (2) - 2 freq feish (2) - 51 freq fib (2) - 3 freq feich (2) - 1 freq leibh (2) - 1 freq fenian (2) - 3 freq fibo (2) - 1 freq feyn (2) - 7 freq rein (2) - 14 freq feilan (2) - 2 freq fyin (2) - 1 freq sein (2) - 67 freq fen (2) - 47 freq eein (2) - 7 freq seiin (2) - 2 freq feirm (2) - 4 freq fern (2) - 5 freq reign (2) - 15 freq neibin (2) - 3 freq feint (2) - 5 freq neib (2) - 1 freq |
feibn (0) - 1 freq feign (2) - 3 freq fein (2) - 3 freq feinn (2) - 1 freq fibf (3) - 1 freq reiban (3) - 2 freq finn (3) - 47 freq f-in (3) - 1 freq bein (3) - 1776 freq felon (3) - 2 freq feidin (3) - 1 freq feein (3) - 4 freq fin (3) - 1563 freq frein (3) - 36 freq fuin (3) - 4 freq fenn (3) - 1 freq fain (3) - 44 freq frien (3) - 61 freq neibin (3) - 3 freq feba (3) - 1 freq feb (3) - 7 freq fion (3) - 2 freq fyin (3) - 1 freq feilan (3) - 2 freq feyn (3) - 7 freq |
SoundEx code - F150 fuffin - 2 freq fobbin - 3 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq fabiani - 5 freq fee-pyin - 1 freq fee-peyin - 1 freq feibn - 1 freq |
MetaPhone code - FBN fobbin - 3 freq fabiani - 5 freq feibn - 1 freq |
FEIBN |
| Time to execute Levenshtein function - 0.256290 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.370147 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.030667 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.038835 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.000926 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. |