| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| plural (0) - 56 freq plurals (1) - 3 freq floral (2) - 3 freq aural (2) - 1 freq plul (2) - 1 freq purl (2) - 3 freq mural (2) - 1 freq rural (2) - 28 freq culural (2) - 1 freq puhl (3) - 1 freq plan (3) - 236 freq petrol (3) - 36 freq lqbal (3) - 2 freq pourit (3) - 4 freq usual (3) - 240 freq laran (3) - 2 freq lucan (3) - 2 freq lurve (3) - 6 freq plummy (3) - 2 freq otral (3) - 1 freq pleurer (3) - 1 freq gurl (3) - 2 freq burial (3) - 12 freq panoal (3) - 1 freq lurid (3) - 1 freq |
plural (0) - 56 freq plurals (2) - 3 freq purl (3) - 3 freq plul (3) - 1 freq culural (3) - 1 freq floral (3) - 3 freq puull (4) - 1 freq petrel (4) - 3 freq pleurer (4) - 1 freq plurality (4) - 3 freq pearl (4) - 8 freq pleure (4) - 1 freq palatal (4) - 3 freq pleyar (4) - 1 freq pirl (4) - 7 freq pairl (4) - 3 freq patrol (4) - 7 freq pitril (4) - 7 freq laurel (4) - 4 freq pll (4) - 5 freq pler (4) - 1 freq petrol (4) - 36 freq rural (4) - 28 freq mural (4) - 1 freq pull (4) - 145 freq |
SoundEx code - P464 plurality - 3 freq plurals - 3 freq plural - 56 freq pluralism - 1 freq pluralitie - 7 freq plouralitie - 2 freq pluralité - 1 freq pluralitié - 1 freq pleuralitee - 1 freq pluralisation - 1 freq |
MetaPhone code - PLRL plural - 56 freq |
PLURAL |
| Time to execute Levenshtein function - 0.198777 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.420985 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.032356 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.037809 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.000924 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. |