Skip to content

Latest commit

 

History

History
102 lines (51 loc) · 7.2 KB

BIBLIOGRAPHY.md

File metadata and controls

102 lines (51 loc) · 7.2 KB

Talisman Bibliography

BibTex file

Bartolini, I., Ciaccia, P., & Patella, M. (2002). String matching with metric trees using an approximate distance. International Symposium on String Processing and Information Retrieval, 271–283.

Beider, A. (2008). Beider-Morse phonetic matching: An alternative to Soundex with fewer false hits. Avotaynu: The International Review of Jewish Genealogy, 24(2), 12.

Black, P. E. (2004). Ratcliff/Obershelp pattern recognition. Dictionary of Algorithms and Data Structures, 17.

Bouchard, G., Brard, P., & Lavoie, Y. (1981). FONEM: Un code de transcription phonétique pour la reconstitution automatique des familles saguenayennes. Population (French Edition), 1085–1103.

Broder, A. Z. (1998). On the resemblance and containment of documents. Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 21–29. https://doi.org/10.1109/SEQUEN.1997.666900

Caumanns, J. (1999). A fast and simple stemming algorithm for German words.

Damerau, F. J. (1964). A technique for computer detection and correction of spelling errors. Communications of the ACM, 7(3), 171–176.

Dice, L. R. (1945). Measures of the amount of ecologic association between species. Ecology, 26(3), 297–302.

Dong, W., Moses, C., & Li, K. (2011). Efficient k-nearest neighbor graph construction for generic similarity measures. Proceedings of the 20th International Conference on World Wide Web - WWW ’11, 577. https://doi.org/10.1145/1963405.1963487

Guth, G. J. (1976). Surname spellings and computerized record linkage. Historical Methods Newsletter, 10(1), 10–19.

Hamming, R. W. (1950). Error detecting and error correcting codes. The Bell System Technical Journal, 29(2), 147–160.

Harman, D. (1991). How effective is suffixing? Journal of the American Society for Information Science, 42(1), 7–15.

Holmes, D., & McCabe, C. M . (2002). Improving precision and recall for soundex retrieval. Proceedings. International Conference on Information Technology: Coding and Computing, 22–26.

Hood, D. (2002). Caverphone: Phonetic matching algorithm. Technical Paper CTP060902, University of Otago, New Zealand.

Hood, D. (2004). Caverphone revisited. Technical Paper CTP150804, 10.

Jaccard, P. (1912). The distribution of the flora in the alpine zone. 1. New Phytologist, 11(2), 37–50. https://doi.org/10.1111/j.1469-8137.1912.tb05611.x

Jaro, M. A. (1989). 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.

Jaro, M. A. (1995). Probabilistic linkage of large public health data files. Statistics in Medicine, 14(5–7), 491–498.

Jenkins, M.-C., & Smith, D. (2005). Conservative stemming for search and indexing. Proc. ACM SIGIR.

Khan, S. I., & Hoque, A. S. Md. L. (2016). Similarity analysis of patients’ data: Bangladesh perspective. 2016 International Conference on Medical Engineering, Health Informatics and Technology (MediTec), 1–5. https://doi.org/10.1109/MEDITEC.2016.7835390

Kiss, T., & Strunk, J. (2006). Unsupervised multilingual sentence boundary detection. Computational Linguistics, 32(4), 485–525.

Lait, A. J., & Randell, B. (1996). An assessment of name matching algorithms. Technical Report Series-University of Newcastle Upon Tyne Computing Science.

Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8), 707–710.

Liang, F. M. (1983). Word Hy-phen-a-tion by Com-put-er. Calif. Univ. Stanford. Comput. Sci. Dept.

Lovins, J. B. (1968). Development of a stemming algorithm. Mech. Translat. &Comp. Linguistics, 11(1–2), 22–31.

Lynch, B. T., & Arends, W. L. (1977). Selection of a surname coding procedure for the SRS record linkage system. Washington, DC: US Department of Agriculture, Sample Survey Research Branch, Research Division.

Monge, A. E., Elkan, C., & others. (1996). The Field Matching Problem: Algorithms and Applications. Kdd, 2, 267–270.

Moore, G. B. (1977). Accessing individual records from personal data files using non-unique identifiers (Vol. 13). US Department of Commerce, National Bureau of Standards.

Nakache, D. (2007). Extraction automatique des diagnostics à partir des comptes rendus médicaux textuels. Laboratoire CEDRIC-Équipe ISID. Paris, Conservatoire National Des Arts et Métiers, 219.

Odell, M. K. (1956). The profit in records management. Systems (New York), 20, 20.

Paice, C. D. (1990). Another stemmer. ACM Sigir Forum, 24(3), 56–61.

Paternostre, M., Francq, P., Lamoral, J., Wartel, D., & Saerens, M. (2002). Carry, un algorithme de désuffixation pour le français. Rapport Technique Du Projet Galilei.

Philips, L. (1990). Hanging on the metaphone. Computer Language, 7(12), 39–43.

Philips, L. (2000). The double metaphone search algorithm. C/C++ Users Journal, 18(6), 38–43.

Pollock, J. J., & Zamora, A. (1984). Automatic spelling correction in scientific and scholarly text. Communications of the ACM, 27(4), 358–368. https://doi.org/10.1145/358027.358048

Postel, H. J. (1969). Die Kölner Phonetik. Ein Verfahren zur Identifizierung von Personennamen auf der Grundlage der Gestaltanalyse. IBM-Nachrichten, 19, 925–931.

Ratcliff, J. W., & Metzener, D. E. (1988). Pattern-matching-the gestalt approach. Dr Dobbs Journal, 13(7), 46.

Savoy, J. (1993). Stemming of French words based on grammatical categories. Journal of the American Society for Information Science, 44(1), 1–9.

Savoy, J. (1999). A stemming procedure and stopword list for general French corpora. Journal of the American Society for Information Science, 50(10), 944–952.

Schinke, R., Greengrass, M., Robertson, A. M., & Willett, P. (1996). A stemming algorithm for Latin text databases. Journal of Documentation.

Shannaq, B. A., & Alexandrov, V. V. (2010). Using Product Similarity for Adding BusinessValue and Returning Customers. Global Journal of Computer Science and Technology.

Smith, T. F., Waterman, M. S., & others. (1981). Identification of common molecular subsequences. Journal of Molecular Biology, 147(1), 195–197.

Snae, C., & Diaz, B. (2002). An interface for mining genealogical nominal data using the concept of linkage and a hybrid name matching algorithm. Journal of 3D-Forum Society, 16(1), 142–147.

Sørensen, T. (1948). A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons.

Tversky, A. (1977). Features of similarity. Psychological Review, 84(4), 327.

Van Rijsbergen, C. J., Robertson, S. E., & Porter, M. F. (1980). New models in probabilistic information retrieval. British Library Research and Development Department London.

Varol, C., & Bayrak, C. (2012). Hybrid matching algorithm for personal names. Journal of Data and Information Quality (JDIQ), 3(4), 1–18.

Wilde, G., & Meyer, C. (1999). Doppelgänger gesucht: Ein Programm für kontextsensitive phonetische Textumwandlung. c.

Winkler, W. E. (1990). String Comparator Metrics and Enhanced Decision Rules in the Fellegi-Sunter Model of Record Linkage.