Online ISSN:1349-8606
Progress in Informatics  
No.6 March 2009  
Page 57-62 PDF(180KB) | References
doi:10.2201/NiiPi.2009.6.7
Statistical string similarity model for information linkage
Atsuhiro TAKASU
National Institute of Informatics
(Received: September 16, 2008)
(Revised: December 24, 2008)
(Accepted: December 25, 2008)
Abstract:
This paper proposes a statistical string similarity model for approximate matching in information linkage. The proposed similarity model is an extension of hidden Markov model and its learnable ability realizes string matching function adaptable to various information sources. The main contribution of this paper is to develop an efficient learning algorithm for estimating parameters of the statistical similarity model. The proposed algorithm is based on the Expectation-Maximization (EM) technique where dynamic programing technique is used to update parameters in EM process.
Keywords:
String similarity, statistical model, EM algorithm
PDF(180KB) | References

National Institute of Informatics is a member of CrossRef.
Go back HOME