algorithm - String matching between complete and incomplete(or short form) strings -
this question might reported duplicates, have done lots of research , haven't got satisfactory, thought better ask precisely.
in project, need match address strings. have implemented several string searching algorithms, soundex, levenshtein distance, damerau–levenshtein distance, fuzzy search, character frequency matching etc. results become unsatisfactory search between strings - st. , street, jr. , junior etc. thought of replacing st. streets, cause problems in addresses 'st. pauls street'. should do?
create string distance dictionary. example: distance('street','st')=0 . need training data create dictionary though.
Comments
Post a Comment