{"type":"ScholarlyArticle","title":"A Statistical Model for Flexible String Similarity","authors":[{"name":"Atsuhiro Takasu","slug":"atsuhiro-takasu","given":"Atsuhiro","family":"Takasu","affiliation":""}],"abstract":"This paper proposes a statistical model for defining string similarity. The proposed model is based on hidden Markov model and defines string similarity as the combination of similarities of substrings. The proposed model has an advantage that the similarity is flexibly defined and complex parameters for the similarity are learnable from training data.","doi":null,"url":"https://ijcai.org/proceedings/2003/222","pdf":"https://ijcai.org/proceedings/2003/0222.pdf","markdown":"https://ijcai.org/proceedings/2003/222.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/222","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":222,"pages":{"first":1420,"last":1420},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}