I have implemented a Levenshtein distance algorithm using a trie tree, as described here by Steve Hanov. However, I m having difficulty handling special characters. For instance, if I calculate the distance between Großmann and Grossmann, I need the distance to be zero, since ß and ss should be considered equal.
支持这些特殊情况的最佳解决办法(如果有的话)是什么?
My initial thought was to kind of normalize all strings before calculating the distance. So in Großmann -> Grossman, österreich -> oesterreich, ... However, there seems to be no such functionality in .NET?