{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T05:04:51Z","timestamp":1749618291725,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031490101"},{"type":"electronic","value":"9783031490118"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49011-8_33","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T16:03:27Z","timestamp":1702569807000},"page":"413-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Address Matching Using Siamese Transformer Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5987-0789","authenticated-orcid":false,"given":"Andr\u00e9 V.","family":"Duarte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8638-5594","authenticated-orcid":false,"given":"Arlindo L.","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"issue":"16","key":"33_CR1","doi-asserted-by":"publisher","first-page":"7608","DOI":"10.3390\/app11167608","volume":"11","author":"J Chen","year":"2021","unstructured":"Chen, J., Chen, J., She, X., Mao, J., Chen, G.: Deep contrast learning approach for address semantic matching. Appl. Sci. 11(16), 7608 (2021)","journal-title":"Appl. Sci."},{"issue":"2","key":"33_CR2","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1111\/tgis.12522","volume":"23","author":"S Comber","year":"2019","unstructured":"Comber, S., Arribas-Bel, D.: Machine learning innovations in address matching: a practical comparison of Word2vec and CRFs. Trans. GIS 23(2), 334\u2013348 (2019)","journal-title":"Trans. GIS"},{"key":"33_CR3","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 4171\u20134186. Association for Computational Linguistics (2019)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Glass, M., Rossiello, G., Chowdhury, M.F.M., Naik, A., Cai, P., Gliozzo, A.: Re2G: retrieve, rerank, generate. In: Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 2701\u20132715. Association for Computational Linguistics, Seattle, United States (2022)","DOI":"10.18653\/v1\/2022.naacl-main.194"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, V., Gupta, M., Garg, J., Garg, N.: Improvement in semantic address matching using natural language processing. In: 2021 2nd International Conference for Emerging Technology (INCET), pp. 1\u20135 (2021)","DOI":"10.1109\/INCET51464.2021.9456342"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Karpukhin, V., Oguz, B., Min, S., Lewis, P., Wu, L., Edunov, S., Chen, D., Yih, W.t.: Dense passage retrieval for open-domain question answering. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 6769\u20136781. Association for Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"issue":"8","key":"33_CR7","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phys. Doklady 10(8), 707\u2013710 (1965)","journal-title":"Soviet Phys. Doklady"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/13658816.2019.1681431","volume":"34","author":"Y Lin","year":"2020","unstructured":"Lin, Y., Kang, M., Wu, Y., Du, Q., Liu, T.: A deep learning architecture for semantic address matching. Int. J. Geogr. Inf. Sci. 34(3), 559\u2013576 (2020)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"33_CR9","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space (2013). arXiv:1301.3781"},{"key":"33_CR10","unstructured":"Mosbach, M., Andriushchenko, M., Klakow, D.: On the stability of fine-tuning BERT: misconceptions, explanations, and strong baselines (2020). arXiv:2006.04884"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Recchia, G., Louwerse, M.: A comparison of string similarity measures for toponym matching. In: COMP 2013\u2014ACM SIGSPATIAL International Workshop on Computational Models of Place, pp. 54\u201361 (2013)","DOI":"10.1145\/2534848.2534850"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Reimers, N., Gurevych, I.: Sentence-BERT: sentence embeddings using Siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/D19-1410"},{"key":"33_CR13","unstructured":"Sanh, V., Debut, L., Chaumond, J., Wolf, T.: DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter (2019). arXiv:1910.01108"},{"issue":"9","key":"33_CR14","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1080\/17538947.2017.1371253","volume":"11","author":"R Santos","year":"2018","unstructured":"Santos, R., Murrieta-Flores, P., Martins, B.: Learning to combine multiple string similarity metrics for effective toponym matching. Int. J. Digit. Earth 11(9), 913\u2013938 (2018)","journal-title":"Int. J. Digit. Earth"},{"key":"33_CR15","unstructured":"Statista.: (2021). https:\/\/www.statista.com\/chart\/10922\/parcel-shipping-volume-and-parcel-spend-in-selected-countries\/"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Urbanek, J., Fan, A., Karamcheti, S., Jain, S., Humeau, S., Dinan, E., Rockt\u00e4schel, T., Kiela, D., Szlam, A., Weston, J.: Learning to speak and act in a fantasy text adventure game. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp. 673\u2013683. Association for Computational Linguistics, Hong Kong, China (2019)","DOI":"10.18653\/v1\/D19-1062"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Z., Ng, P., Ma, X., Nallapati, R., Xiang, B.: Multi-passage BERT: a globally normalized BERT model for open-domain question answering (2019)","DOI":"10.18653\/v1\/D19-1599"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49011-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T01:18:37Z","timestamp":1730855917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49011-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031490101","9783031490118"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49011-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faial Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2023.inesctec.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"163","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}