korean_levenshtein
v0.0.1 · released 2 years ago · MIT License
First published 2 years ago.
Calculates similarity between two Korean strings using Levenshtein distance with decomposed phonemes, improving accuracy. 자모음 분리 및 초/종/중성 가중치 적용을 통해 두 한글 문자열 사이의 유사도를 정확하게 측정하는 패키지.
#370 in Text Processing #30302 overall no release in 2 years androidioswindowslinuxmacosweb
Downloads / day
1
as of 2026-06-27
GitHub stars
4
★ refreshed weekly
Likes
5
on pub.dev
Pub points
140 / 160
Repository health
- Last commit
- 2 years ago
- Commit activity
- Open issues
- 0
- Open PRs
- 0
- Contributors
- 1
- CI
- None detected
- License (repo)
Last refreshed 8 days ago.
How korean_levenshtein compares in Text Processing
Top of the Text Processing leaderboard, with korean_levenshtein highlighted.
| Rank | Package | Downloads / day | Stars | Likes |
|---|---|---|---|---|
| #1 | 🇨🇭 lukas-renggli.ch | 489.6K | ★ 488 | 402 |
| #2 | 272.2K | ★ 89 | 139 | |
| #3 | 🇺🇸 tools.dart.dev | 104.1K | ★ 116 | 369 |
| #4 | 85.6K | ★ 104 | 371 | |
| #370 | 1 | ★ 4 | 5 |
