ML Anthology

A Statistical Model for Flexible String Similarity

Atsuhiro Takasu
IJCAI 2003 pp. 1420-1421
/ijcai/2003/takasu2003ijcai-statistical/

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. 1

PDF Semantic Scholar

Cite

Text

Takasu. "A Statistical Model for Flexible String Similarity." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Takasu. "A Statistical Model for Flexible String Similarity." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/takasu2003ijcai-statistical/)

BibTeX

@inproceedings{takasu2003ijcai-statistical,
  title     = {{A Statistical Model for Flexible String Similarity}},
  author    = {Takasu, Atsuhiro},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {1420-1421},
  url       = {https://mlanthology.org/ijcai/2003/takasu2003ijcai-statistical/}
}