Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Will the Levenshtein distance algorithm work well for non-English language strings too?
Update: Would this work automatically in a language like Java when comparing Asian characters?
Only if language is letter based. For example Russian, German,… but hieroglyph (China for example) or syllable (like Laos) – not.