Author:
Jordão Carlos C.,Rosa João Luís G.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Freeman, A.T., Condon, S.L., Ackerman, C.M.: Cross linguistic name matching in english and arabic: a “one to many mapping” extension of the levenshtein edit distance algorithm. In: Proceedings of the Main Conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, NAACL 2006, pp. 471–478. Association for Computational Linguistics, Stroudsburg (2006),
http://dx.doi.org/10.3115/1220835.1220895
2. Jaro, M.A.: Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida. Journal of the American Statistical Association 84(406), 414–420 (1989),
http://dx.doi.org/10.2307/2289924
3. Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10, 707 (1966)
4. Odell, M.K., Russell, R.C.: U.S. Patents 1261167 (1918), 1435663 (1922)
$\dag$
(1918/1922), cited in Knuth (1973)
5. Philips, L.: Hanging on the metaphone. Computer Language 7(12) (1990)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献