Calculates similarity between two Korean strings using Levenshtein distance with decomposed phonemes, improving accuracy.
-
Updated
Mar 24, 2024 - Dart
#
levenshtein-algorithm
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the levenshtein-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the levenshtein-algorithm topic, visit your repo's landing page and select "manage topics."