@article{Damerau1964,
  abstract = {The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary again, testing each time to see if the words match—assuming one of these errors occurred. During a test run on garbled text, correct identifications were made for over 95 percent of these error types.},
  address = {New York, NY, USA},
  author = {Damerau, Fred J.},
  doi = {http://doi.acm.org/10.1145/363958.363994},
  interhash = {b10df81f1860fd8bd7990f4684ad6f3a},
  intrahash = {668a64114d9dedf793cb2644e05dac14},
  issn = {0001-0782},
  journal = {Commun. ACM},
  number = 3,
  pages = {171--176},
  publisher = {ACM Press},
  title = {A technique for computer detection and correction of spelling errors},
  url = {http://portal.acm.org/citation.cfm?id=363994},
  volume = 7,
  year = 1964
}

@inproceedings{conf/icdt/BeyerGRS99,
  author = {Beyer, Kevin S. and Goldstein, Jonathan and Ramakrishnan, Raghu and Shaft, Uri},
  booktitle = {ICDT},
  cite = {conf/icde/WhiteJ96},
  crossref = {conf/icdt/99},
  date = {2002-01-03},
  editor = {Beeri, Catriel and Buneman, Peter},
  ee = {http://link.springer.de/link/service/series/0558/bibs/1540/15400217.htm},
  interhash = {17f2a2126af823b1b135231d1c189e7d},
  intrahash = {b0beff3a9fa219560f51295a27a3fc5a},
  isbn = {3-540-65452-6},
  pages = {217-235},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {When Is ''Nearest Neighbor'' Meaningful?},
  url = {http://dblp.uni-trier.de/db/conf/icdt/icdt99.html#BeyerGRS99},
  volume = 1540,
  year = 1999
}

@inproceedings{1081960,
  address = {New York, NY, USA},
  author = {Wu, Gang and Chang, Edward Y. and Panda, Navneet},
  booktitle = {KDD '05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining},
  doi = {http://doi.acm.org/10.1145/1081870.1081960},
  interhash = {d0c8814f4b944586939bc57f045e66fc},
  intrahash = {d8cc50c1628f3559d42de2fe8d09d4a9},
  isbn = {1-59593-135-X},
  location = {Chicago, Illinois, USA},
  pages = {703--709},
  publisher = {ACM Press},
  title = {Formulating distance functions via the kernel trick},
  year = 2005
}

@article{kwok2003lik,
  author = {Kwok, J.T. and Tsang, I.W.},
  interhash = {89dfd58e3a36e69dba89201775ba13ab},
  intrahash = {97771b8acda61c547bc2a547b2a39ab9},
  journal = {Proceedings of the Twentieth International Conference on Machine Learning},
  pages = {400--407},
  title = {{Learning with idealized kernels}},
  year = 2003
}