rfc:mb_levenshtein
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| rfc:mb_levenshtein [2024/09/25 07:14] – Implementation youkidearitai | rfc:mb_levenshtein [2025/03/08 02:23] (current) – This RFC was declined youkidearitai | ||
|---|---|---|---|
| Line 3: | Line 3: | ||
| * Date: 2024-09-25 | * Date: 2024-09-25 | ||
| * Author: Yuya Hamada, youkidearitai@gmail.com | * Author: Yuya Hamada, youkidearitai@gmail.com | ||
| - | * Status: | + | * Status: |
| * First Published at: http:// | * First Published at: http:// | ||
| Line 10: | Line 10: | ||
| ref: [[https:// | ref: [[https:// | ||
| + | |||
| + | ====== Levenshtein distance difference mb_levenshtein vs grapheme_levenshtein ===== | ||
| + | The mb_levenshtein function is the Levenshtein distance in code points. | ||
| + | This is useful for comparing Unicode code points. For example, this can be used to compare concatenated characters. | ||
| + | |||
| + | < | ||
| + | var_dump(mb_levenshtein(" | ||
| + | </ | ||
| + | |||
| + | Surely, There are times when I want to consider this to be the same. In that case, I will propose grapheme_levenshtein separately. | ||
| ===== Proposal ===== | ===== Proposal ===== | ||
| Line 54: | Line 64: | ||
| ===== Voting ===== | ===== Voting ===== | ||
| - | TBD. | + | <doodle title=" |
| + | * Yes | ||
| + | * No | ||
| + | </ | ||
| ===== Implementation ===== | ===== Implementation ===== | ||
| Line 62: | Line 75: | ||
| Userland implementation is here: | Userland implementation is here: | ||
| * https:// | * https:// | ||
| - | * https:// | + | |
| ===== Rejected Features ===== | ===== Rejected Features ===== | ||
| Keep this updated with features that were discussed on the mail lists. | Keep this updated with features that were discussed on the mail lists. | ||
rfc/mb_levenshtein.1727248443.txt.gz · Last modified: 2024/09/25 07:14 by youkidearitai