Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.11
In this work we examine a new technique for approximate string matching using Markovian distance. Here we assume each character appears in a probabilistic way. By means of this idea, we introduce a notion of dissimilarity using text corpus. Then we propose our sophisticated algorithm based on dynamic programming. We show some experimental results to see how the approach works well.
Dynamic programming (DP), Edit Distance, Markovian Distance, Approximate String Matching
Akifumi Katsumata, Takao Miura, Isamu Shioya, "Approximate String Matching Using Markovian Distance", Parallel Architectures, Algorithms and Programming, International Symposium on, vol. 00, no. , pp. 231-238, 2010, doi:10.1109/PAAP.2010.11