Given string A,B I need to compute the number of insertions, deletions and substitutions for B to become A. What would be a good algorithm for this?
Given string A,B I need to compute the number of insertions, deletions and substitutions
Share
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.
Given string A,B I need to compute the number of insertions, deletions and substitutions for B to become A. What would be a good algorithm for this?
That’s known as Levenshtein distance.