CINXE.COM

<!doctype html><html lang=en-us><head><meta charset=utf-8><meta name=language content="English"><meta http-equiv=content-language content="en"><meta http-equiv=X-UA-Compatible content="IE=edge"><meta name=generator content="Hugo 0.125.4"><meta name=viewport content="width=device-width,initial-scale=1"><meta name=description content="In our previous instalments of the blog series about matching (see part 1 and part 2), we explained what metadata matching is, why it is important and described its basic terminology. In this entry, we will discuss a few common beliefs about metadata matching that are often encountered when interacting with users, developers, integrators, and other stakeholders. Spoiler alert: we are calling them myths because these beliefs are not true! Read on to learn why."><meta name=author content="Rosa-Clark"><meta name=gitlastmod content="2024-11-17 19:19:02 -0500 -0500"><meta name=hugolastmod content="2024-11-17 19:19:02 -0500 -0500"><meta name=copyright content="Crossref - 2024"><meta name=twitter:label1 value="Reading time"><meta name=twitter:data1 value="10 minute read 🕑"><meta property="dc:language" content="en"><meta property="dc:format" content="text/html"><meta property="dc:rights" content="CC BY 4.0"><meta property="dc:source" content="Crossref"><meta property="dc:type" content="website"><meta property="dc:title" content="The myth of perfect metadata matching"><meta property="og:title" content="The myth of perfect metadata matching - Crossref"><meta property="og:site_name" content="www.crossref.org"><meta property="og:description" content="In our previous instalments of the blog series about matching (see part 1 and part 2), we explained what metadata matching is, why it is important and described its basic terminology. In this entry, we will discuss a few common beliefs about metadata matching that are often encountered when interacting with users, developers, integrators, and other stakeholders. Spoiler alert: we are calling them myths because these beliefs are not true! Read on to learn why."><meta property="og:type" content="website"><meta property="og:url" content="https://www.crossref.org/blog/the-myth-of-perfect-metadata-matching/"><meta property="og:image" content="https://www.crossref.org/img/default_banner.png"><meta property="og:updated_time" content="2024-08-28T00:00:00"><title>The myth of perfect metadata matching - Crossref</title> <link href=https://www.crossref.org//blog/index.xml rel=alternate type=application/atom+xml title="Crossref Blog Feed"><link rel=stylesheet href=https://pro.fontawesome.com/releases/v5.7.2/css/all.css integrity=sha384-6jHF7Z3XI3fF4XZixAuSu0gGKrXwoX/w3uFPxC56OtjChio7wtTGJWRW53Nhx6Ev crossorigin=anonymous><link href=https://www.crossref.org//css/bootstrap.min.css rel=stylesheet><script src=https://use.fontawesome.com/1873acdb2d.js></script><link rel=stylesheet type=text/css href=//cdn.datatables.net/1.10.16/css/jquery.dataTables.min.css><link rel=stylesheet type=text/css href=//cdn.datatables.net/buttons/1.5.1/css/buttons.dataTables.min.css><link href=https://www.crossref.org//css/syntax.css rel=stylesheet><link rel=stylesheet href=https://www.crossref.org/css/crossref.min.25b9f9a3fb27bdc6ab8648d7f9588be651a79a7bc3e92af30e19495d1012d03c.css><link rel=stylesheet href=https://www.crossref.org/css/print.min.5b37715a8e5bdae856e4d3b1fd9d7c8dad0c1d2cee2ed79d6397d375334339ce.css><link rel="shortcut icon" href=/favicon.ico type=image/x-icon><script src=https://cdn.jsdelivr.net/algoliasearch/3/algoliasearch.min.js></script><script src=https://cdn.jsdelivr.net/autocomplete.js/0/autocomplete.min.js></script></head><body><div id=nav2019 class="nav-container nav-container--hidden"><div class=menu-wrap><ul class=menu-icon data-toggle-nav=nav2019><li><div class=nav-burger><span></span> <span></span> <span></span></div></li><li>Menu</li></ul></div><div class=social-icons><a rel=me href=https://mastodon.online/@crossref><i class="fab fa-mastodon" aria-hidden=true></i> </a><a href=https://twitter.com/CrossrefOrg><i class="fab fa-twitter" aria-hidden=true></i> </a><a href=https://www.facebook.com/crossref><i class="fab fa-facebook" aria-hidden=true></i> </a><a href=https://www.linkedin.com/company/crossref><i class="fab fa-linkedin" aria-hidden=true></i> </a><a href=https://www.youtube.com/c/CrossrefVideos><i class="fab fa-youtube" aria-hidden=true></i></a></div><div class="nav-wrapper dark-grey"><div class=nav-outer-flex><div class=nav-flex><div class="nav-col first-col order-1 mobile-home-btn"><ul class=key-nav><li><a href=/ class="home-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="home" d="M1.3 17.1 25.2.0l23.5 17.1V50H31.6V32.9H18.2L18.4 50H1.3V17.1z"/></svg> <span>Home</span></a></li></ul></div><div class="nav-col first-col order-2"><ul class=key-nav><li class=hide-small><a href=/ class="home-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="home" d="M1.3 17.1 25.2.0l23.5 17.1V50H31.6V32.9H18.2L18.4 50H1.3V17.1z"/></svg> <span>Home</span></a></li><li><a href=/membership/ class="apply-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="apply" d="M20.4 21.1v4.1L7.2 19.8v-4.1l13.2 5.4zM7.2 29.3l13.2 5.3v-4.1L7.2 25.2v4.1zM42.8 15.7 29.6 21v4.1l13.2-5.3V15.7zm0 13.6v-4.1l-13.2 5.3v4.1l13.2-5.3zM45.1 7.9l-18.5 7.6v27.1L45.1 35V7.9zM4.9 35l18.9 7.7V15.6L4.9 7.9V35zM48.7 2.5c.6.4 1 1.1 1 1.9v32.1c0 .9-.6 1.8-1.5 2.1l-22.4 9s-.1.0-.1.0c-.3.1-.5.2-.8.2s-.5-.1-.8-.2H24l-22.4-9c-.9-.4-1.4-1.2-1.4-2.1V4.4c0-.8.4-1.5 1-1.9C2 2.1 2.8 2 3.5 2.3L25 10.9l21.5-8.6C47.2 2 48 2.1 48.7 2.5"/></svg> <span>Join</span></a></li><li><a href=/members-area/ class="members-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="members" d="M31.1 27.1c-.3.0-.6.0-.9.1-1.6.5-3.4.9-5.2.9s-3.6-.3-5.2-.9c-.3-.1-.6-.1-.9-.1-7.9.0-14.3 8.4-14.2 16.3.0 3.3 2.8 6 6.1 6h28.4c3.3.0 6.1-2.7 6.1-6C45.4 35.5 39 27.1 31.1 27.1zM25 25c6.7.0 12.2-5.5 12.2-12.2S31.7.6 25 .6 12.8 6.1 12.8 12.8 18.3 25 25 25z"/></svg> <span>Members</span></a></li><li><a href=/documentation/ class="documentation-nav reverse"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="support" d="M16.3 33.4c-.2.0-.4.0-.5.1-1 .3-2.1.5-3.2.5s-2.2-.2-3.2-.5c-.2-.1-.4-.1-.5-.1-4.8.0-8.7 3.9-8.7 8.7.0 2 1.7 3.7 3.7 3.7h17.3c2 0 3.7-1.6 3.7-3.7C25 37.3 21.1 33.4 16.3 33.4zm-3.7-2.5c4.1.0 7.4-3.3 7.4-7.4s-3.3-7.4-7.4-7.4-7.4 3.3-7.4 7.4 3.3 7.4 7.4 7.4zM46 6.2H16.3c-2 0-3.7 1.7-3.7 3.8v3.6c1.8.0 3.5.5 4.9 1.4v-3.9h27.2v22.3h-4.9v-4.9h-9.9v4.9H24c1.5 1.3 2.6 3 3.1 4.9H46c2 0 3.7-1.7 3.7-3.8V10c0-2.1-1.6-3.8-3.7-3.8z"/></svg> <span>Documentation</span></a></li><li><a href=https://community.crossref.org class="forum-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="forum" d="M46.181 36.189C48.568 33.86 50 30.938 50 27.75c0-6.875-6.641-12.555-15.295-13.57-2.735-4.95-9.158-8.43-16.649-8.43C8.082 5.75.0 11.903.0 19.5c0 3.18 1.432 6.102 3.819 8.439C2.491 30.577.582 32.623.547 32.657.0 33.233-.156 34.075.165 34.805.477 35.536 1.207 36.009 2.005 36.009c4.644.0 8.394-1.736 10.868-3.335C13.672 32.855 14.497 32.992 15.339 33.095c2.725 4.933 9.123 8.405 16.605 8.405C33.75 41.5 35.486 41.294 37.135 40.916 39.609 42.505 43.351 44.25 48.003 44.25 48.802 44.25 49.523 43.777 49.844 43.047 50.156 42.316 50.009 41.474 49.462 40.898 49.427 40.873 47.509 38.827 46.181 36.189zM12.083 28.257 10.599 29.211c-1.224.782-2.474 1.401-3.741 1.839.234-.404.468-.834.694-1.272l1.346-2.673L6.745 25c-1.172-1.152-2.578-3.034-2.578-5.5.0-5.216 6.363-9.625 13.889-9.625S31.944 14.284 31.944 19.5s-6.362 9.625-13.888 9.625C16.623 29.125 15.191 28.962 13.802 28.644L12.083 28.257zM43.255 33.25 41.111 35.347l1.346 2.673C42.682 38.458 42.917 38.888 43.151 39.291 41.884 38.853 40.634 38.234 39.41 37.452L37.925 36.498 36.198 36.894C34.809 37.212 33.377 37.375 31.944 37.375c-4.687.0-8.871-1.727-11.397-4.271C29.34 32.176 36.111 26.452 36.111 19.5 36.111 19.208 36.076 18.924 36.05 18.641c5.591 1.246 9.783 4.881 9.783 9.109.0 2.466-1.406 4.348-2.578 5.5z"/></svg> <span>Forum</span></a></li><li><a href=/blog/ class="blog-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="blog" d="M10.5 33.7c-3.4.0-6.2 2.8-6.2 6.2.0 3.4 2.8 6.1 6.2 6.1s6.2-2.8 6.2-6.1C16.6 36.4 13.9 33.7 10.5 33.7zM5 18c-.4.0-.6.3-.6.6v7.8c0 .4.3.6.6.6 10 0 18.2 8.2 18.2 18.2.0.3.3.6.6.6h7.8.0c.4.0.6-.3.6-.6V45C32.1 30.2 19.9 18 5 18zM45.8 45.1C45.7 22.7 27.4 4.5 5 4.5c-.4.0-.6.3-.6.6v8c0 .4.3.6.6.6 17.4.0 31.5 14.1 31.5 31.5.0.3.3.6.6.6h8 0c.3.0.6-.3.6-.6L45.8 45.1z"/></svg> <span>Blog</span></a></li><li><a href=/contact/ class="contact-nav normal"><svg class="nav-icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 50 50"><path class="contact" d="M43.9 6.2H6.1c-3.2.0-5.9 2.5-5.9 5.7v26.4c0 3.1 2.6 5.7 5.9 5.7h37.8c3.2.0 5.9-2.5 5.9-5.7V11.8C49.8 8.7 47.2 6.2 43.9 6.2zm0 32.7H6.1c-.5.0-.9-.3-.9-.7V15.3l17.1 14.5c.4.3 2.8 2 5.4.0l17.1-14.5v22.9C44.8 38.5 44.4 38.9 43.9 38.9zM25 25.3 8.4 11.1h33.3L25 25.3z"/></svg> <span>Contact</span></a></li></ul></div><div class="nav-col mobile order-3"><h2 id=get-involved data-toggle-sibling class="nav-toggle desktop-style">Get involved<div class=plus-wrapper><div class="plus go-yellow"></div><div class="minus go-yellow minus-1"></div></div></h2><ul id=get-involved-child class=child-list><div class=child-mobile-arrow></div><li><a href=/community/>Overview</a></li><li><a href=/membership/>Become a member</a></li><li><a href=/community/initiatives/>Initiatives</a></li><li><a href=/community/service-providers/>Service providers</a></li><li><a href=/community/special-programs/>Special programs</a></li><li><a href=/community/working-for-you/>Working for you</a></li><li><a href=/community/sponsors/>Sponsors program</a></li><li><a href=/events/>Webinars and events</a></li><li><a href=/community/ambassadors/>Ambassadors</a></li><li><a href=/working-groups/>Working groups</a></li><li><a href=/code-of-conduct/>Code of conduct</a></li><li><a href=/fees/>Fees</a></li><li><a href=/learning/>Crossref API Learning Hub</a></li></ul></div><div class="nav-col mobile order-3"><h2 id=get-involved data-toggle-sibling class="nav-toggle desktop-style">Find a service<div class=plus-wrapper><div class="plus go-yellow"></div><div class="minus go-yellow minus-1"></div></div></h2><ul id=get-involved-child class=child-list><div class=child-mobile-arrow></div><li><a href=/services/>Overview</a></li><li><a href=/services/content-registration/>Content Registration</a></li><li><a href=/services/grant-linking-system/>Grant Linking System (GLS)</a></li><li><a href=/services/metadata-retrieval/>Metadata Retrieval</a></li><li><a href=/services/funder-registry/>Open Funder Registry (OFR)</a></li><li><a href=/services/reference-linking/>Reference Linking</a></li><li><a href=/services/similarity-check/>Similarity Check</a></li><li><a href=/services/cited-by/>Cited-by</a></li><li><a href=/services/metadata-retrieval/metadata-plus/>Metadata Plus</a></li><li><a href=/services/event-data/>Event Data</a></li><li><a href=/services/crossmark/>Crossmark</a></li></ul></div><div class="nav-col mobile order-3"><h2 id=get-involved data-toggle-sibling class="nav-toggle desktop-style">Documentation<div class=plus-wrapper><div class="plus go-yellow"></div><div class="minus go-yellow minus-1"></div></div></h2><ul id=get-involved-child class=child-list><div class=child-mobile-arrow></div><li><a href=/documentation/>Overview</a></li><li><a href=/documentation/member-setup/>Setting up as a member</a></li><li><a href=/documentation/research-nexus/>The research nexus</a></li><li><a href=/documentation/principles-practices/>Metadata principles and practices</a></li><li><a href=/documentation/register-maintain-records/>Register and maintain your records</a></li><li><a href=/documentation/schema-library/>Schema library</a></li><li><a href=/documentation/reports/>Reports</a></li><li><a href=/documentation/crossmark/>Crossmark</a></li><li><a href=/documentation/cited-by/>Cited-by</a></li><li><a href=/documentation/similarity-check/>Similarity Check</a></li><li><a href=/documentation/retrieve-metadata/>Metadata Retrieval</a></li></ul></div><div class="nav-col mobile order-3"><h2 id=get-involved data-toggle-sibling class="nav-toggle desktop-style">About us<div class=plus-wrapper><div class="plus go-yellow"></div><div class="minus go-yellow minus-1"></div></div></h2><ul id=get-involved-child class=child-list><div class=child-mobile-arrow></div><li><a href=/about/>Overview</a></li><li><a href=/operations-and-sustainability/>Operations & sustainability</a></li><li><a href=/board-and-governance/>Board & governance</a></li><li><a href=/strategy/>Strategic agenda and roadmap</a></li><li><a href=/truths/>Our truths</a></li><li><a href=/people/>Our people</a></li><li><a href=/people/org-chart/>Organization chart</a></li><li><a href=/jobs/>Jobs</a></li></ul></div></div><div class="nav-flex posts"><div class=nav-col><span class="latest-posts light-grey-text">Latest blog posts</span></div><div class="nav-col nav2019__post"><img class=profile-pic src=https://www.crossref.org//images/staff/martyn-1.png alt='Martyn Rittman' height=57 width=57><div class=nav2019__post-text><h5>2024 November 15</h5><h3><a href=/blog/research-integrity-roundtable-2024/>Research Integrity Roundtable 2024</a></h3><p>For the third year in a row, Crossref hosted a roundtable on research integrity prior to the Frankfurt book fair. This year the event looked at Crossmark, our tool to display retractions and other post-publication updates to readers. Since the start of 2024, we have been carrying out a consultation on Crossmark, gathering feedback and input from a range of members. The roundtable discussion was a chance to check and refine some of the conclusions we’ve come to, and gather more suggestions on the way forward.</p></div><a href=/blog/research-integrity-roundtable-2024/ class=nav2019__post-readmore>...Find out more</a></div><div class="nav-col nav2019__post"><img class=profile-pic src=https://www.crossref.org//images/staff/dominika-thumbnail.jpg alt='Dominika Tkaczyk' height=57 width=57><div class=nav2019__post-text><h5>2024 November 06</h5><h3><a href=/blog/how-good-is-your-matching/>How good is your matching?</a></h3><p>In our previous blog post in this series, we explained why no metadata matching strategy can return perfect results. Thankfully, however, this does not mean that it’s impossible to know anything about the quality of matching. Indeed, we can (and should!) measure how close (or far) we are from achieving perfection with our matching. Read on to learn how this can be done! How about we start with a quiz? Imagine a database of scholarly metadata that needs to be enriched with identifiers, such as ORCIDs or ROR IDs.</p></div><a href=/blog/how-good-is-your-matching/ class=nav2019__post-readmore>...Find out more</a></div><div class="nav-col nav2019__post"><img class=profile-pic src=https://www.crossref.org//images/staff/kora-fisher-edit.png alt='Kornelia Korzec' height=57 width=57><div class=nav2019__post-text><h5>2024 October 28</h5><h3><a href=/blog/update-rcfs/>Update on the Resourcing Crossref for Future Sustainability research</a></h3><p>We’re in year two of the Resourcing Crossref for Future Sustainability (RCFS) research. This report provides an update on progress to date, specifically on research we’ve conducted to better understand the impact of our fees and possible changes. Crossref is in a good financial position with our current fees, which haven’t increased in 20 years. This project is seeking to future-proof our fees by: Making fees more equitable Simplifying our complex fee schedule Rebalancing revenue sources In order to review all aspects of our fees, we’ve planned five projects to look into specific aspects of our current fees that may need to change to achieve the goals above.</p></div><a href=/blog/update-rcfs/ class=nav2019__post-readmore>...Find out more</a></div><div class="nav-col nav2019__post"><img class=profile-pic src=https://www.crossref.org//images/staff/lucy3.jpg alt='Lucy Ofiesh' height=57 width=57><div class=nav2019__post-text><h5>2024 September 24</h5><h3><a href=/blog/2024-board-election/>Meet the candidates and vote in our 2024 Board elections</a></h3><p>On behalf of the Nominating Committee, I’m pleased to share the slate of candidates for the 2024 board election. Each year we do an open call for board interest. This year, the Nominating Committee received 53 submissions from members worldwide to fill four open board seats. We maintain a balanced board of 8 large member seats and 8 small member seats. Size is determined based on the organization’s membership tier (small members fall in the $0-$1,650 tiers and large members in the $3,900 - $50,000 tiers).</p></div><a href=/blog/2024-board-election/ class=nav2019__post-readmore>...Find out more</a></div></div><div class=footer-colours></div></div></div><div class=logo><a class=crossref-brand href=https://www.crossref.org/><img class=site-logo src=https://www.crossref.org//img/crossref-logo-reverse.svg alt="Crossref logo"></a></div></div><div class=site-header><div class="container-fluid site-header-inner"><div class=menu-wrap><ul class=menu-icon data-toggle-nav=nav2019><li><div class=nav-burger><span></span> <span></span> <span></span></div></li><li>Menu</li></ul></div><div class=social-icons><a rel=me href=https://mastodon.online/@crossref><i class="fab fa-mastodon" aria-hidden=true></i> </a><a href=https://twitter.com/CrossrefOrg><i class="fab fa-twitter" aria-hidden=true></i> </a><a href=https://www.facebook.com/crossref><i class="fab fa-facebook" aria-hidden=true></i> </a><a href=https://www.linkedin.com/company/crossref><i class="fab fa-linkedin" aria-hidden=true></i> </a><a href=https://www.youtube.com/c/CrossrefVideos><i class="fab fa-youtube" aria-hidden=true></i></a></div><div class=search-icon><a href=# class=search-trigger>search</a></div><div class=hcwh-box-top><input id=howcanwehelptop class=hcwh-inner placeholder="Search entire site" tabindex=1 autocomplete=on></div><div class=logo><a class=crossref-brand href=https://www.crossref.org/><img class=site-logo src=https://assets.crossref.org/logo/crossref-logo-200.svg alt="Crossref logo"></a></div></div></div><header class="intro-header short"><div class="container short"><div class=row><div class="col-md-11 col-md-offset-1"><h1>Blog</h1></div></div></div></header><div class=container><div class=row><div class="col-md-11 col-md-offset-1"><div class=breadcrumb-wrap role=navigation aria-label="breadcrumbs navigation"><ul class=wy-breadcrumbs><li><a href=https://www.crossref.org/>Home</a><span>></span></li><li><a href=/blog/>Blog</a><span>></span></li><li>The myth of perfect metadata matching</li></ul></div></div></div><div class=row><div class="col-md-8 col-md-offset-1 content-column"><strong><i class="fa fa-clock-o reading-time" aria-hidden=true></i> 10 minute read.</strong><h2>The myth of perfect metadata matching</h2><div class="details-wrapper clearfix"><div class=details><div class=img><img src=https://www.crossref.org//images/staff/dominika-thumbnail.jpg alt="Dominika Tkaczyk" height=57 width=57></div><p><a href=/authors/dominika-tkaczyk>Dominika Tkaczyk</a>, <a href=/authors/adam-buttrick>Adam Buttrick</a> – 2024 August 28</p><p>In <span class=category-link><a href=/categories/metadata>Metadata</a></span><span class=category-link><a href=/categories/linking>Linking</a></span><span class=category-link><a href=/categories/metadata-matching>Metadata Matching</a></span></p></div></div><p>In our previous instalments of the blog series about matching (see <a href=/blog/metadata-matching-101-what-is-it-and-why-do-we-need-it/>part 1</a> and <a href=/blog/the-anatomy-of-metadata-matching/>part 2</a>), we explained what metadata matching is, why it is important and described its basic terminology. In this entry, we will discuss a few common beliefs about metadata matching that are often encountered when interacting with users, developers, integrators, and other stakeholders. Spoiler alert: we are calling them myths because these beliefs are not true! Read on to learn why.</p><p>If you have stuck with us this far in our series, hopefully, you are at least a bit excited about the possibility of creating new relationships between the works, authors, institutions, preprints, datasets, and myriad other objects in our existing scholarly metadata. Who would not want all of these to be better connected?</p><p>We have to pause for a moment and be honest with you: metadata matching is a complex problem, and doing it correctly requires significant effort. What is worse, even if we do everything right, our matching won’t be perfect. This may be counterintuitive. Perhaps you’ve heard that matching is not a hard problem, or have encountered people surprised that a matching strategy returned a wrong or incomplete answer. Sometimes, it is obvious to a person from looking at some specific example that a match should (or should not) have been made, so they naturally assume that a change to account for this has to be simple.</p><p>Misconceptions like these can be problematic. They create confusion around matching, drive users’ expectations to unreasonable levels, and make people drastically underestimate the effort needed to build and integrate matching strategies. So let’s dive right in and debunk a few common myths about metadata matching.</p><h2 id=myth-1-a-metadata-matching-strategy-should-be-100-correct>Myth #1: A metadata matching strategy should be 100% correct</h2><p>Anyone who has built or supported a matching strategy has likely encountered the following belief: it is possible to develop a perfect strategy, meaning one that always returns the correct results, no matter the inputs. The unfortunate truth is that while one’s aim should always be to design matching strategies that return correct results, once we move beyond the simplest class of problems or artificially clean data, no strategy can achieve this outcome. In thinking through why this is the case, some inherent constraints become obvious:</p><p>The inputs to matching are often strings in human-readable formats, which can vary wildly in their structure, order and completeness. Since they’re intended to be parsed by people, instead of machines, they’re inherently lossy and frequently unstructured, anticipating that a person can infer from the source context what is being referenced. Matching strategies, although built to make sense of unstructured data, unfortunately, don’t have the luxury of this flexibility. A strategy has to account for translating a messy, partial, or inconsistent input into a correct and structured match.</p><p>Consider, for example, the following inputs to an affiliation matching strategy:</p><ol><li>“Department of Radiology, St. Mary’s Hospital, London W2 1NY, UK”</li><li>“Saint Mary’s Hospital, Manchester University NHS Foundation Trust”</li><li>“St. Mary’s Medical Center, San Francisco, CA”</li><li>“St Mary’s Hosp., Dublin”</li><li>“St Mary’s Hospital Imperial College Healthcare NHS Trust”</li><li>“聖マリア病院”</li></ol><p>In order to correctly identify the organisations mentioned here, the matching strategy must be able to distinguish between different ways of representing the same institution, disambiguate multiple institutions that have similar names, and handle variant forms for the parts of each name (Saint/St./St), identify the same name in different languages (“聖マリア病院” is Japanese for “St. Mary’s Hospital”), and make assumptions about partial or ambiguous locations translating to more precise references. While a person reviewing each of these strings might be able to accomplish these tasks, even here there are some challenges. Does “St Mary’s Hosp., Dublin” refer to the hospital in Ireland or a separate hospital in one of the many cities that share this name? Should we presume that because “聖マリア病院” is in Japanese, this refers to a hospital in Japan? Would someone, by default, be aware that St. Mary’s Hospital in London is part of the Imperial College Healthcare NHS Trust, such that inputs one and five refer to the same organisation?</p><p>An additional challenge lies in the quality of the data, which in the context of matching, encompasses both the input and the dataset being matched against. In real world circumstances, no dataset is fully accurate, complete, or current and certainly not all three. As a result, there will always be functionally random differences between inputs to the strategy and the entities to be matched. A theoretically perfect matching strategy would thus need to distinguish between inconsequential discrepancies resulting from gaps, errors, and variable forms of reference and actual, meaningful differences indicating an incorrect match. As one might imagine, this would require near total knowledge of the meaning and context for all inputs and outputs, a nigh-on impossible task for any person or system!</p><p>As a consequence, no metadata matching strategy will ever be perfect. It is unreasonable for us to expect them to be. This does not mean, of course, that all strategies are equally flawed or destined to forever return middling results. Some are better than others and we can improve them over time. Which brings us to the next myth:</p><h2 id=myth-2-it-is-always-a-good-idea-to-adapt-the-matching-strategy-to-a-specific-input>Myth #2: It is always a good idea to adapt the matching strategy to a specific input</h2><p>Matching strategies are not static. They can - and should - be improved. There is, however, a deceptive trap that one can fall into when attempting to improve a matching strategy. Whenever we encounter an incorrect or missing result for a specific input, we treat this problem like a software bug and try to adapt the strategy to work better for it, without considering all other cases.</p><p>The more complicated reality is that the quality of matching results is controlled through a complex set of trade-offs between <a href=https://en.wikipedia.org/wiki/Precision_and_recall target=_blank>precision and recall</a> that determine the kind and number of relationships created between items:</p><ul><li>Precision is calculated as the number of correctly matched relationships resulting from a strategy, divided by the total number of matched relationships. It can also be interpreted as the probability that a match is correct. Low precision indicates a high rate of false positives, which are incorrect relationships created by the strategy.</li><li>Recall is calculated as the number of correctly matched relationships resulting from a strategy, divided by the number of true (expected) relationships. It can also be interpreted as the probability that a true (correct) relationship will be created by the strategy. Low recall means a high rate of false negatives, which are relationships that should have been created by the strategy but were not made.</li></ul><div style=text-align:center;margin:10px><figure class=img-responsive><img src=/images/blog/2024/false-positives-negatives.png alt="False positives and false negatives" width=75%><figcaption><p>The diagram depicts false negatives and false positives. The ideal outcome would be that the ellipses are identical, matched relationships are exactly the same as true relationships, and there are no false negatives or false positives. In practice, we try to make the intersection as big as possible.</p></figcaption></figure></div><p>The tradeoff between precision and recall roughly means that modifying the strategy to improve recall will decrease precision, and vice versa.</p><p>Imagine, for example, we received a report about a relationship that was missed by matching because of a partial, noisy, or ambiguous input. We might be tempted to resolve this issue by relaxing our matching criteria. Unfortunately, this will have a cost of a higher overall rate of false positive matches.</p><p>Conversely, if we encounter a case where the matching has returned an incorrect match, we might attempt to make the matching strategy stricter to avoid this result. We should remember, however, that this may have the consequence of causing the strategy to skip many perfectly valid matches.</p><div style=text-align:center;margin:10px><figure class=img-responsive><img src=/images/blog/2024/precision-recall-tradeoff.png alt="The tradeoff between precision and recall" width=50%><figcaption><p>The tradeoff between precision and recall. (a) A strict strategy prioritises precision over recall resulting in more false negatives. (b) A relaxed strategy prioritises recall over precision resulting in more false positives.</p></figcaption></figure></div><p>Striking this balance becomes even more difficult when attempting to address multiple issues at once, or considering constraints like the time and resources consumed by each aspect of the strategy. Each choice can compound the individual effects in unanticipated and expensive ways. The aim of matching ultimately then can’t be to achieve perfect results for every single case. Fixing one particular situation might not be desirable, as it can result in breaking multiple other cases. Instead, we have to find a locally optimal balance that optimises the strategy’s utility, relative to these inherent limitations. This means accepting some level of imperfection as not just inevitable, but necessary for implementing a workable strategy. When you consider all this, you might conclude that…</p><h2 id=myth-3-we-shouldnt-do-large-scale-unsupervised-matching>Myth #3: We shouldn’t do large-scale, unsupervised matching</h2><p>Imperfect matching strategies, when applied automatically to real-world large datasets, might:</p><ul><li>Fail to discover some relationships (false negatives), an outcome that may not be terribly problematic. In the worst case scenario, we have wasted a great deal of effort developing matching strategies that do not improve our metadata.</li><li>Create incorrect relationships between items (false positives), what seems like a potentially larger problem, where we have added incorrect relationships to the metadata.</li></ul><p>Many have the instinct to avoid false positives at any cost, even if this means missing many additional correct relationships at the same time. They might come to the conclusion that if we cannot have 100% precision (see our previous myth), we simply should not allow matching strategies to act in an automated, unsupervised way on large datasets. While there might be circumstances where this belief is rational, in the context of the scholarly record, this notion is seriously flawed.</p><p>First, if you are dealing with any medium to large-sized dataset, it almost certainly contains errors, even before you apply any automated processing to it. Even if data is submitted and curated by users, they can still make mistakes, and might themselves be using automated tools for extracting the data from other sources, without your knowledge. It is thus not entirely obvious that applying an (imperfect) matching strategy to create more relationships would actually make the data quality worse.</p><p>Second, while we cannot eliminate all matching errors, we can place a high priority on precision when developing strategies, with the aim of keeping the number of incorrectly matched results as low as possible. We can also make use of additional mechanisms to easily correct for incorrectly matched results, for example doing so manually, in response to error reports.</p><p>Finally, the results of matching should always contain provenance information to distinguish them from those that have been manually curated. This way, the users can make their own decisions about whether to use and trust the matching results, relative to their use case.</p><p>By applying those additional checks, we can minimise the negative effects of incorrect matching, while at the same time reap the benefits of filling gaps in the scholarly record.</p><h2 id=myth-4-we-can-only-ever-guess-at-the-accuracy-of-our-matching-results>Myth #4: We can only ever guess at the accuracy of our matching results</h2><p>In attempting to determine the correctness of our matching, we immediately encounter a number of inherent limitations. The sheer amount of entries in many datasets prevents a thorough, manual validation of the results, but if instead, we use too few or specific items as our benchmarks, these are unlikely to be representative of overall performance. The unpredictable nature of future data adds another wrinkle: will our matching always be as successful as when we first benchmarked it or will its performance degrade relative to some change in the data?</p><p>With so many unknowns, are we then doomed? No! We have rigorous and scientific tools at our disposal that can help us estimate how accurate our matching will be. How do we use them? Well, that is a big and fairly technical topic, so we will leave you with this little cliffhanger. See you in the next post!</p><div><h2>Further reading</h2><ul><li><a href=/blog/how-good-is-your-matching/>Nov 6, 2024 – How good is your matching?</a></li><li><a href=/blog/the-anatomy-of-metadata-matching/>Jun 27, 2024 – The anatomy of metadata matching</a></li><li><a href=/blog/metadata-matching-101-what-is-it-and-why-do-we-need-it/>May 16, 2024 – Metadata matching 101: what is it and why do we need it?</a></li><li><a href=/blog/with-a-little-help-from-your-crossref-friends-better-metadata/>Mar 31, 2022 – With a little help from your Crossref friends: Better metadata</a></li><li><a href=/blog/a-simpler-text-query-form/>Apr 30, 2019 – A simpler text query form</a></li><li><a href=/blog/included-registered-available-let-the-preprint-linking-commence./>Dec 5, 2016 – Included, registered, available: let the preprint linking commence.</a></li><li><a href=/blog/linked-clinical-trials-initiative-gathers-momentum/>Jun 21, 2016 – Linked Clinical Trials initiative gathers momentum</a></li><li><a href=/blog/getting-started-with-crossref-dois-courtesy-of-scholastica/>Apr 25, 2016 – Getting Started with Crossref DOIs, courtesy of Scholastica</a></li></ul></div><div id=discourse-comments></div><script type=text/javascript>DiscourseEmbed={discourseUrl:"https://community.crossref.org/",discourseEmbedUrl:"https://www.crossref.org/blog/the-myth-of-perfect-metadata-matching/"},function(){var e=document.createElement("script");e.type="text/javascript",e.async=!0,e.src=DiscourseEmbed.discourseUrl+"javascripts/embed.js",(document.getElementsByTagName("head")[0]||document.getElementsByTagName("body")[0]).appendChild(e)}()</script></div><div class=col-md-2><div class=blogsearchouter><form class=blogsearch action=/site-search/ method=get><input type=hidden name=refinementList[section][0] id=refinementList[section][0] value=Blog> <input placeholder='Search the blog' type=text name=query id=howcanwehelpsidebar></form></div><a href=/blog/index.xml><i class="fa fa-rss" aria-hidden=true></i> RSS Feed</a><section><div class=blog-box><h2>Recent Posts</h2><div class=item><p class=headline><a href=/blog/research-integrity-roundtable-2024/>Research Integrity Roundtable 2024</a></p><p class=date>2024 November 15</p></div><div class=item><p class=headline><a href=/blog/how-good-is-your-matching/>How good is your matching?</a></p><p class=date>2024 November 06</p></div><div class=item><p class=headline><a href=/blog/update-rcfs/>Update on the Resourcing Crossref for Future Sustainability research</a></p><p class=date>2024 October 28</p></div><div class=item><p class=headline><a href=/blog/2024-board-election/>Meet the candidates and vote in our 2024 Board elections</a></p><p class=date>2024 September 24</p></div></section><section><div class=blog-box><h2>Categories</h2><ul class=blog-categories><li><a href=/categories/metadata>Metadata</a> <span class=blog-count>(136)</span></li><li><a href=/categories/community>Community</a> <span class=blog-count>(116)</span></li><li><a href=/categories/identifiers>Identifiers</a> <span class=blog-count>(97)</span></li><li><a href=/categories/member-briefing>Member Briefing</a> <span class=blog-count>(58)</span></li><li><a href=/categories/collaboration>Collaboration</a> <span class=blog-count>(51)</span></li><li><a href=/categories/linking>Linking</a> <span class=blog-count>(48)</span></li><li><a href=/categories/content-registration>Content Registration</a> <span class=blog-count>(41)</span></li><li><a href=/categories/apis>APIS</a> <span class=blog-count>(39)</span></li><li><a href=/categories/crossref-live>Crossref Live</a> <span class=blog-count>(38)</span></li><li><a href=/categories/citation>Citation</a> <span class=blog-count>(35)</span></li><li><a href=/categories/event-data>Event Data</a> <span class=blog-count>(33)</span></li><li><a href=/categories/crossref-labs>Crossref Labs</a> <span class=blog-count>(27)</span></li><li><a href=/categories/news-release>News Release</a> <span class=blog-count>(27)</span></li><li><a href=/categories/research-nexus>Research Nexus</a> <span class=blog-count>(26)</span></li><li><a href=/categories/board>Board</a> <span class=blog-count>(25)</span></li><li><a href=/categories/data>Data</a> <span class=blog-count>(25)</span></li><li><a href=/categories/interoperability>Interoperability</a> <span class=blog-count>(24)</span></li><li><a href=/categories/orcid>ORCID</a> <span class=blog-count>(24)</span></li><li><a href=/categories/annual-meeting>Annual Meeting</a> <span class=blog-count>(23)</span></li><li><a href=/categories/datacite>DataCite</a> <span class=blog-count>(23)</span></li><li><a href=/categories/dois>DOIs</a> <span class=blog-count>(23)</span></li><li><a href=/categories/governance>Governance</a> <span class=blog-count>(23)</span></li><li><a href=/categories/persistence>Persistence</a> <span class=blog-count>(22)</span></li><li><a href=/categories/meetings>Meetings</a> <span class=blog-count>(21)</span></li><li><a href=/categories/search>Search</a> <span class=blog-count>(21)</span></li><li><a href=/categories/strategy>Strategy</a> <span class=blog-count>(18)</span></li><li><a href=/categories/api-case-study>Api Case Study</a> <span class=blog-count>(17)</span></li><li><a href=/categories/infrastructure>Infrastructure</a> <span class=blog-count>(17)</span></li><li><a href=/categories/staff>Staff</a> <span class=blog-count>(17)</span></li><li><a href=/categories/standards>Standards</a> <span class=blog-count>(17)</span></li><li><a href=/categories/outreach>Outreach</a> <span class=blog-count>(16)</span></li><li><a href=/categories/linked-data>Linked Data</a> <span class=blog-count>(15)</span></li><li><a href=/categories/membership>Membership</a> <span class=blog-count>(14)</span></li><li><a href=/categories/preprints>Preprints</a> <span class=blog-count>(14)</span></li><li><a href=/categories/publishing>Publishing</a> <span class=blog-count>(14)</span></li><li><a href=/categories/wikipedia>Wikipedia</a> <span class=blog-count>(14)</span></li><li><a href=/categories/xmp>XMP</a> <span class=blog-count>(14)</span></li><li><a href=/categories/crossmark>Crossmark</a> <span class=blog-count>(13)</span></li><li><a href=/categories/election>Election</a> <span class=blog-count>(12)</span></li><li><a href=/categories/research-funders>Research Funders</a> <span class=blog-count>(12)</span></li><li><a href=/categories/handle>Handle</a> <span class=blog-count>(11)</span></li><li><a href=/categories/citation-formats>Citation Formats</a> <span class=blog-count>(10)</span></li><li><a href=/categories/discussion>Discussion</a> <span class=blog-count>(10)</span></li><li><a href=/categories/education>Education</a> <span class=blog-count>(10)</span></li><li><a href=/categories/elections>Elections</a> <span class=blog-count>(10)</span></li><li><a href=/categories/grants>Grants</a> <span class=blog-count>(10)</span></li><li><a href=/categories/rss>RSS</a> <span class=blog-count>(10)</span></li></ul></div><div class=blog-box><h2>Archives</h2><ul class=blog-categories><li><a href=/archives/2024>2024</a> <span class=blog-count>(32)</span></li><li><a href=/archives/2023>2023</a> <span class=blog-count>(32)</span></li><li><a href=/archives/2022>2022</a> <span class=blog-count>(31)</span></li><li><a href=/archives/2021>2021</a> <span class=blog-count>(25)</span></li><li><a href=/archives/2020>2020</a> <span class=blog-count>(34)</span></li><li><a href=/archives/2019>2019</a> <span class=blog-count>(37)</span></li><li><a href=/archives/2018>2018</a> <span class=blog-count>(55)</span></li><li><a href=/archives/2017>2017</a> <span class=blog-count>(41)</span></li><li><a href=/archives/2016>2016</a> <span class=blog-count>(50)</span></li><li><a href=/archives/2015>2015</a> <span class=blog-count>(23)</span></li><li><a href=/archives/2014>2014</a> <span class=blog-count>(4)</span></li><li><a href=/archives/2013>2013</a> <span class=blog-count>(2)</span></li><li><a href=/archives/2012>2012</a> <span class=blog-count>(5)</span></li><li><a href=/archives/2011>2011</a> <span class=blog-count>(6)</span></li><li><a href=/archives/2010>2010</a> <span class=blog-count>(9)</span></li><li><a href=/archives/2009>2009</a> <span class=blog-count>(34)</span></li><li><a href=/archives/2008>2008</a> <span class=blog-count>(56)</span></li><li><a href=/archives/2007>2007</a> <span class=blog-count>(91)</span></li><li><a href=/archives/2006>2006</a> <span class=blog-count>(21)</span></li></ul></div></section></div></div><div class="row infoline"><div class="col-md-11 col-md-offset-1"><p>Page owner: Dominika Tkaczyk   |   Last updated 2024-August-28</p></div></div></div><footer class=top-footer><div class=container><div class=row><div class="home-slot col-md-3 col-md-offset-1"><span class=strap>You are Crossref</span></div><div class="home-slot home-slot-col2 col-md-3"><a href=https://www.crossref.org//membership/><button>Join the community</button></a></div><div class="home-slot col-md-3 strap"><a href=https://www.crossref.org//subscribe-newsletter/><button>Get email updates</button></a></div></div></div></footer><footer class=bottom-footer><div class=container><div class=row><div class="home-slot col-md-3 col-md-offset-1"><a href=/membership/ title="Become a member">Apply</a><br><a href=/membership/terms/ title="Membership terms">Member terms</a><br><a href=/fees/ title=Fees>Fees</a><br><a href=/community/sponsors/ title=Sponsors>Sponsors</a><br></div><div class="home-slot home-slot-col2 col-md-3"><a href=https://status.crossref.org/ title="Status page" target=_blank>Status page</a><br><a href=/documentation/ title=Documentation>Documentation</a><br><a href=https://community.crossref.org/ title="Community forum" target=_blank>Community forum</a><br><a href=/learning/ title="Crossref API Learning Hub">Crossref API Learning Hub</a><br></div><div class="home-slot col-md-3"><a href=/blog/ title=Blog>Blog</a><br><a href=/operations-and-sustainability/ title="Operations and sustainability">Operations and sustainability</a><br><a href=/board-and-governance/ title=Governance>Governance</a><br><a href=/contact/ title=Contact>Contact</a><br></div></div></footer><footer class=very-bottom-footer><div class=container><div class=row><div class="col-md-10 col-md-offset-1"><img class="footer-svg cc" src=/images/footer/cc.svg></i><img class="footer-svg by" src=/images/footer/by.svg> The content of this site is licensed under a <a href=https://creativecommons.org/licenses/by/4.0/ title="Creative Commons" target=_blank>Creative Commons Attribution 4.0 International License</a></div><div class=col-md-1><a href=https://www.crossref.org//operations-and-sustainability/privacy>Privacy</a></div></div></div></footer><script src=https://status.crossref.org/embed/script.js></script><script src=https://kit.fontawesome.com/7e709bc1c7.js crossorigin=anonymous></script><script src=https://www.crossref.org//js/jquery.min.js></script><script src=https://www.crossref.org//js/jquery.ui-min.js></script><script src=https://www.crossref.org//js/js.cookie.js></script><script src=https://www.crossref.org//js/jquery.cookiebar.js></script><script src=https://www.crossref.org//js/jquery.fancybox.js></script><script src=https://www.crossref.org//js/jquery.validate.js></script><script type=text/javascript language=javascript src=//cdn.datatables.net/1.10.16/js/jquery.dataTables.min.js></script><script type=text/javascript language=javascript src=//cdn.datatables.net/buttons/1.5.1/js/dataTables.buttons.min.js></script><script type=text/javascript language=javascript src=//cdn.datatables.net/buttons/1.5.1/js/buttons.html5.min.js></script><script src=https://www.crossref.org//js/jquery.fancybox.js></script><script src=https://www.crossref.org//js/bootstrap.min.js></script><script src=https://www.crossref.org//js/jquery.sticky-kit.min.js></script><script src="https://www.crossref.org//js/crossref.js?v=1"></script><script src=https://cdnjs.cloudflare.com/ajax/libs/masonry/4.1.0/masonry.pkgd.js></script><script type=text/javascript async src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script><script>$(document).ready(function(){$(".short-summary").text(function(e,t){return t.split(" ",35).join(" ")+"…"})})</script><script>(function(e,t,n,s,o){e[t]=e[t]||{},e[t][n]=e[t][n]||{q:[],track:function(e,t,n){this.q.push({r:e,e:t,t:n||+new Date})}};var i=s.createElement(o),a=s.getElementsByTagName(o)[0];i.async=1,i.src="//outreach.crossref.org/cdnr/93/acton/bn/tracker/16781",a.parentNode.insertBefore(i,a)})(window,"ActOn","Beacon",document,"script"),ActOn.Beacon.track()</script><script>function fakeClick(){$('a[href="#tabs-metadatasearch"]').trigger("click")}var $searchstring="";jQuery(document).ready(function(e){var t,n,s,o,i,r,l,h,d=80,f=3e3,p=1170,m=algoliasearch("QSQNJS2NQU","7d7dfcf22bf2af9070353d9f5a7c89c0"),c=m.initIndex("aws-production"),u=/10\./;function a(e){return!!u.test(e)}(function(e){e.fn.writeText=function(e){var s=e.split(""),n=0,t=this;t.val(""),r=setInterval(function(){n<=s.length&&(t.val(e.substring(0,n++)),t.change())},d)}})(jQuery),n=document.getElementById("howcanwehelptop"),autocomplete("#howcanwehelptop",{hint:!1,openOnFocus:!0},[{source:autocomplete.sources.hits(c,{hitsPerPage:5}),displayKey:"title",templates:{header:function(){return a(n.value)?doi="<div class='aa-footer aa-meta-link'>It looks like you are searching for a specific DOI, do you want to <a target='_blank' href='https://search.crossref.org/?from_ui=yes&q="+n.value+"'>try this as a Metadata Search?</a></div>":doi="",doi},suggestion:function(e){return sectionValue=e._highlightResult.section.value.replace(/-/g," "),titleValue=e._highlightResult.title.value,result="<a href='"+e.url+"'><div class='autosuggest-section'>"+sectionValue+"</div><div class='autosuggest-title'>"+titleValue+"</div></a>",result},empty:function(){return`<div class="aa-empty">We don't have anything on that topic. Please try editing your search or typing something new.</div>`},footer:function(){return"<div class='aa-footer'><span class='middle'>|</span><span class='left'><a href='/site-search/?query="+n.value+"'>More results</a></span><span class='right'><a target='_blank' href='https://search.crossref.org/?from_ui=yes&q="+n.value+"'>Search metadata</a></span></div>"}}}]).on("autocomplete:selected",function(e,t){location.href=t.url}),s=document.getElementById("howcanwehelp"),h=e("#howcanwehelp").attr("placeholder"),t=[],t.push("join an advisory group"),t.push("sustainability plan"),t.push("metadata schema library"),o=0,l=t.length,i=setInterval(function(){o==l?(o=0,e("#howcanwehelp").val(""),clearInterval(i)):e("#howcanwehelp").writeText(t[o++])},f),e("#howcanwehelp").click(function(){clearInterval(r),clearInterval(i),e("#howcanwehelp").val("")}),autocomplete("#howcanwehelp",{hint:!1,openOnFocus:!0},[{source:autocomplete.sources.hits(c,{hitsPerPage:5}),displayKey:"title",templates:{header:function(){return a(s.value)?doi="<div class='aa-footer aa-meta-link'>It looks like you are searching for a specific DOI, do you want to <a target='_blank' href='https://search.crossref.org/?from_ui=yes&q="+s.value+"'>try this as a Metadata Search?</a></div>":doi="",doi},suggestion:function(e){return sectionValue=e._highlightResult.section.value.replace(/-/g," "),titleValue=e._highlightResult.title.value,result="<a href='"+e.url+"'><div class='autosuggest-section'>"+sectionValue+"</div><div class='autosuggest-title'>"+titleValue+"</div></a>",result},empty:function(){return`<div class="aa-empty">We don't have anything on that topic. Please try editing your search or typing something new.</div>`},footer:function(){return"<div class='aa-footer'><span class='middle'>|</span><span class='left'><a href='/site-search/?query="+s.value+"'>More results</a></span><span class='right'><a target='_blank' href='https://search.crossref.org/?from_ui=yes&q="+s.value+"'>Search metadata</a></span></div>"}}}]).on("autocomplete:selected",function(e,t){location.href=t.url})})</script><script type=text/javascript>var _paq=_paq||[];_paq.push(["trackPageView"]),_paq.push(["enableLinkTracking"]),function(){t="https://crossref.matomo.cloud/",_paq.push(["setTrackerUrl",t+"piwik.php"]),_paq.push(["setSiteId","1"]);var t,n=document,e=n.createElement("script"),s=n.getElementsByTagName("script")[0];e.type="text/javascript",e.async=!0,e.defer=!0,e.src="//cdn.matomo.cloud/crossref.matomo.cloud/piwik.js",s.parentNode.insertBefore(e,s)}()</script><noscript><img src="https://crossref.matomo.cloud/piwik.php?idsite=1&rec=1" style=border:0 alt></noscript></body></html>