A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We describe an improvement on Ukkonen's Enhanced Dynamic Programming (EHD) approximate string-matching algorithm for unit-penalty four-edit comparisons. ... The new algorithm has an asymptotic complexity similar to that of Ukkonen's but is significantly faster due to a decrease in the number of array cell calculations. ... ACKNOWLEDGMENTS We wish to thank David Andrews, Gordon Beavers, Daniel Berleant, Ed Fox, Bernard Moret, Esko Ukkonen, and several anonymous referees for many useful comments on earlier drafts of this article ...doi:10.1145/214174.214183 fatcat:xmuztgobgzakfhwzegpxtbpajq
Proceedings of the sixth international workshop on Information retrieval with Asian languages -
In this paper, we propose a method of dynamic programming matching for information retrieval. ... Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usually too poor to use it for ... Acknowledgement This work was supported in The 21st Century COE Program "Intelligent Human Sensing," from the Ministry of Education, Culture, Sports, Science, and Technology. ...doi:10.3115/1118935.1118948 fatcat:ufzgwtkmsza7vb2maqcf3gjoh4
of interactions among them. ... comparison's results and further demonstrates that request-flow comparison helps developers quickly identify starting points for diagnosis.This dissertation also distills design choices that will maximize an ... An extension of Ukkonen's enhanced dynamic programming ASM algorithm. Transactions on Information Systems (TOIS, ( ), January . Cited on page . [ ] Christopher M. Bishop. ...doi:10.1184/r1/6715934.v1 fatcat:yetaf5ssz5hhtdrrqiyudy2qci