A Statistical Model for Flexible String Similarity
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1420-1420.
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.
Atsuhiro Takasu. 2003. A Statistical Model for Flexible String Similarity. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1420–1420. https://ijcai.org/proceedings/2003/222
Takasu, A. (2003). A Statistical Model for Flexible String Similarity. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 (pp. 1420–1420). IJCAI. https://ijcai.org/proceedings/2003/222
@inproceedings{ijcai2003p222,
title = {A Statistical Model for Flexible String Similarity},
author = {Takasu, Atsuhiro},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1420--1420},
year = {2003},
url = {https://ijcai.org/proceedings/2003/222},
}
TY - CPAPER TI - A Statistical Model for Flexible String Similarity AU - Takasu, Atsuhiro T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1420 EP - 1420 UR - https://ijcai.org/proceedings/2003/222 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
