Title of article
Calculating distances for dissimilar strings: The shortest path formulation revisited
Author/Authors
K. Spiliopoulos، نويسنده , , S. Sofianopoulou، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
15
From page
525
To page
539
Keywords
Levenshtein distance , String matching , Shortest path problem , Computing science , Data cleansing
Journal title
European Journal of Operational Research
Serial Year
2007
Journal title
European Journal of Operational Research
Record number
216499
Link To Document