Serial Computations of Levenshtein Distances (1997)

Cached

Download Links

by Dan Hirschberg
Citations:14 - 0 self

Documents Related by Co-Citation

656 The string-to-string correction problem – R A Wagner, M J Fischer - 1974
15 String Editing and Longest Common Subsequences – Alberto Apostolico - 1996
22 On the Scalability of Data Synchronization Protocols for PDAs and Mobile Devices – S. Agarwal, D. Starobinski, A. Trachtenberg - 2002
1456 Space/Time Trade-offs in Hash Coding with Allowable Errors – Burton H. Bloom - 1970
681 Summary cache: A scalable wide-area web cache sharing protocol – Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder - 1998
204 Informed content delivery across adaptive overlay networks – John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost - 2002
193 Compressed Bloom Filters – Michael Mitzenmacher - 2001
338 On the Resemblance and Containment of Documents – Andrei Z. Broder - 1997
215 Finding similar files in a large file system – Udi Manber, Udi Manber - 1994
385 Some complexity questions related to distributive computing – A C C Yao - 1979
168 A fast algorithm for computing longest common subsequences – J W Hunt, T G Szymanski - 1977
182 Algorithms for approximate string matching – E Ukkonen - 1985
4 Random access communication and graph entropy – J Korner, K Marton - 1988
2 Meaning representation for knowpedge sharing in practical machine translation – Kavi Mahesh, Sergei Nirenburg - 1996
2 Open directory project. http://dmoz.org – Netscape Inc - 2004
2 Deutscher wortschatz online. http://wortschatz.uni-leipzig.de – Uwe Quasthoff - 2000
7 Automatic Sense Disambiguation of the Near-Synonyms in a Dictionary Entry – Diana Zaiu Inkpen, Graeme Hirst - 2003
18 Theseus: Categorization by context – Giuseppe Attardi , Antonio Gullì, Fabrizio Sebastiani - 1998
23 Automatically Acquiring Conceptual Patterns Without an Annotated Corpus – Ellen Riloff, Jay Shoen - 1995