Disambiguation of Company names via Deep Recurrent Networks

Name Entity Disambiguation is the Natural Language Processing task of identifying textual records corresponding to the same Named Entity, i.e. real-world entities represented as a list of attributes (names, places, organisations, etc.). In this work, we face the task of disambiguating companies on t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-04
Hauptverfasser: Basile, Alessandro, Crupi, Riccardo, Grasso, Michele, Mercanti, Alessandro, Regoli, Daniele, Scarsi, Simone, Yang, Shuyi, Cosentini, Andrea
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Basile, Alessandro
Crupi, Riccardo
Grasso, Michele
Mercanti, Alessandro
Regoli, Daniele
Scarsi, Simone
Yang, Shuyi
Cosentini, Andrea
description Name Entity Disambiguation is the Natural Language Processing task of identifying textual records corresponding to the same Named Entity, i.e. real-world entities represented as a list of attributes (names, places, organisations, etc.). In this work, we face the task of disambiguating companies on the basis of their written names. We propose a Siamese LSTM Network approach to extract -- via supervised learning -- an embedding of company name strings in a (relatively) low dimensional vector space and use this representation to identify pairs of company names that actually represent the same company (i.e. the same Entity). Given that the manual labelling of string pairs is a rather onerous task, we analyse how an Active Learning approach to prioritise the samples to be labelled leads to a more efficient overall learning pipeline. With empirical investigations, we show that our proposed Siamese Network outperforms several benchmark approaches based on standard string matching algorithms when enough labelled data are available. Moreover, we show that Active Learning prioritisation is indeed helpful when labelling resources are limited, and let the learning models reach the out-of-sample performance saturation with less labelled data with respect to standard (random) data labelling approaches.
doi_str_mv 10.48550/arxiv.2303.05391
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2303_05391</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2785475421</sourcerecordid><originalsourceid>FETCH-LOGICAL-a951-6570c3f6978e3c1c6701fea3759926b2ba930238fe312616b55e348f079a7bac3</originalsourceid><addsrcrecordid>eNotj0FLwzAYhoMgOOZ-gCcDnluTfE3S4Ek6ncJQkN3L15JIpm1q0k73752bp_fy8PI8hFxxlhellOwW44_f5QIY5EyC4WdkJgB4VhZCXJBFSlvGmFBaSAkzcrf0CbvGv084-tDT4GgVugH7Pe2xs4nuPNKltQN9s-0Uo-1H-mLH7xA_0iU5d_iZ7OJ_52Tz-LCpnrL16-q5ul9naCTPlNSsBaeMLi20vFWacWcRtDRGqEY0aIAJKJ0FLhRXjZQWitIxbVA32MKcXJ9uj2X1EH2HcV__FdbHwgNxcyKGGL4mm8Z6G6bYH5xqoUtZaFkIDr-XxlIP</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2785475421</pqid></control><display><type>article</type><title>Disambiguation of Company names via Deep Recurrent Networks</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Basile, Alessandro ; Crupi, Riccardo ; Grasso, Michele ; Mercanti, Alessandro ; Regoli, Daniele ; Scarsi, Simone ; Yang, Shuyi ; Cosentini, Andrea</creator><creatorcontrib>Basile, Alessandro ; Crupi, Riccardo ; Grasso, Michele ; Mercanti, Alessandro ; Regoli, Daniele ; Scarsi, Simone ; Yang, Shuyi ; Cosentini, Andrea</creatorcontrib><description>Name Entity Disambiguation is the Natural Language Processing task of identifying textual records corresponding to the same Named Entity, i.e. real-world entities represented as a list of attributes (names, places, organisations, etc.). In this work, we face the task of disambiguating companies on the basis of their written names. We propose a Siamese LSTM Network approach to extract -- via supervised learning -- an embedding of company name strings in a (relatively) low dimensional vector space and use this representation to identify pairs of company names that actually represent the same company (i.e. the same Entity). Given that the manual labelling of string pairs is a rather onerous task, we analyse how an Active Learning approach to prioritise the samples to be labelled leads to a more efficient overall learning pipeline. With empirical investigations, we show that our proposed Siamese Network outperforms several benchmark approaches based on standard string matching algorithms when enough labelled data are available. Moreover, we show that Active Learning prioritisation is indeed helpful when labelling resources are limited, and let the learning models reach the out-of-sample performance saturation with less labelled data with respect to standard (random) data labelling approaches.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2303.05391</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Active learning ; Algorithms ; Artificial neural networks ; Computer Science - Artificial Intelligence ; Computer Science - Computation and Language ; Computer Science - Databases ; Computer Science - Learning ; Empirical analysis ; Labeling ; Names ; Natural language processing ; String matching ; Supervised learning ; Vector spaces</subject><ispartof>arXiv.org, 2023-04</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by-nc-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2303.05391$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1016/j.eswa.2023.122035$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Basile, Alessandro</creatorcontrib><creatorcontrib>Crupi, Riccardo</creatorcontrib><creatorcontrib>Grasso, Michele</creatorcontrib><creatorcontrib>Mercanti, Alessandro</creatorcontrib><creatorcontrib>Regoli, Daniele</creatorcontrib><creatorcontrib>Scarsi, Simone</creatorcontrib><creatorcontrib>Yang, Shuyi</creatorcontrib><creatorcontrib>Cosentini, Andrea</creatorcontrib><title>Disambiguation of Company names via Deep Recurrent Networks</title><title>arXiv.org</title><description>Name Entity Disambiguation is the Natural Language Processing task of identifying textual records corresponding to the same Named Entity, i.e. real-world entities represented as a list of attributes (names, places, organisations, etc.). In this work, we face the task of disambiguating companies on the basis of their written names. We propose a Siamese LSTM Network approach to extract -- via supervised learning -- an embedding of company name strings in a (relatively) low dimensional vector space and use this representation to identify pairs of company names that actually represent the same company (i.e. the same Entity). Given that the manual labelling of string pairs is a rather onerous task, we analyse how an Active Learning approach to prioritise the samples to be labelled leads to a more efficient overall learning pipeline. With empirical investigations, we show that our proposed Siamese Network outperforms several benchmark approaches based on standard string matching algorithms when enough labelled data are available. Moreover, we show that Active Learning prioritisation is indeed helpful when labelling resources are limited, and let the learning models reach the out-of-sample performance saturation with less labelled data with respect to standard (random) data labelling approaches.</description><subject>Active learning</subject><subject>Algorithms</subject><subject>Artificial neural networks</subject><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Computation and Language</subject><subject>Computer Science - Databases</subject><subject>Computer Science - Learning</subject><subject>Empirical analysis</subject><subject>Labeling</subject><subject>Names</subject><subject>Natural language processing</subject><subject>String matching</subject><subject>Supervised learning</subject><subject>Vector spaces</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj0FLwzAYhoMgOOZ-gCcDnluTfE3S4Ek6ncJQkN3L15JIpm1q0k73752bp_fy8PI8hFxxlhellOwW44_f5QIY5EyC4WdkJgB4VhZCXJBFSlvGmFBaSAkzcrf0CbvGv084-tDT4GgVugH7Pe2xs4nuPNKltQN9s-0Uo-1H-mLH7xA_0iU5d_iZ7OJ_52Tz-LCpnrL16-q5ul9naCTPlNSsBaeMLi20vFWacWcRtDRGqEY0aIAJKJ0FLhRXjZQWitIxbVA32MKcXJ9uj2X1EH2HcV__FdbHwgNxcyKGGL4mm8Z6G6bYH5xqoUtZaFkIDr-XxlIP</recordid><startdate>20230415</startdate><enddate>20230415</enddate><creator>Basile, Alessandro</creator><creator>Crupi, Riccardo</creator><creator>Grasso, Michele</creator><creator>Mercanti, Alessandro</creator><creator>Regoli, Daniele</creator><creator>Scarsi, Simone</creator><creator>Yang, Shuyi</creator><creator>Cosentini, Andrea</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230415</creationdate><title>Disambiguation of Company names via Deep Recurrent Networks</title><author>Basile, Alessandro ; Crupi, Riccardo ; Grasso, Michele ; Mercanti, Alessandro ; Regoli, Daniele ; Scarsi, Simone ; Yang, Shuyi ; Cosentini, Andrea</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a951-6570c3f6978e3c1c6701fea3759926b2ba930238fe312616b55e348f079a7bac3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Active learning</topic><topic>Algorithms</topic><topic>Artificial neural networks</topic><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Computation and Language</topic><topic>Computer Science - Databases</topic><topic>Computer Science - Learning</topic><topic>Empirical analysis</topic><topic>Labeling</topic><topic>Names</topic><topic>Natural language processing</topic><topic>String matching</topic><topic>Supervised learning</topic><topic>Vector spaces</topic><toplevel>online_resources</toplevel><creatorcontrib>Basile, Alessandro</creatorcontrib><creatorcontrib>Crupi, Riccardo</creatorcontrib><creatorcontrib>Grasso, Michele</creatorcontrib><creatorcontrib>Mercanti, Alessandro</creatorcontrib><creatorcontrib>Regoli, Daniele</creatorcontrib><creatorcontrib>Scarsi, Simone</creatorcontrib><creatorcontrib>Yang, Shuyi</creatorcontrib><creatorcontrib>Cosentini, Andrea</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Basile, Alessandro</au><au>Crupi, Riccardo</au><au>Grasso, Michele</au><au>Mercanti, Alessandro</au><au>Regoli, Daniele</au><au>Scarsi, Simone</au><au>Yang, Shuyi</au><au>Cosentini, Andrea</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Disambiguation of Company names via Deep Recurrent Networks</atitle><jtitle>arXiv.org</jtitle><date>2023-04-15</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Name Entity Disambiguation is the Natural Language Processing task of identifying textual records corresponding to the same Named Entity, i.e. real-world entities represented as a list of attributes (names, places, organisations, etc.). In this work, we face the task of disambiguating companies on the basis of their written names. We propose a Siamese LSTM Network approach to extract -- via supervised learning -- an embedding of company name strings in a (relatively) low dimensional vector space and use this representation to identify pairs of company names that actually represent the same company (i.e. the same Entity). Given that the manual labelling of string pairs is a rather onerous task, we analyse how an Active Learning approach to prioritise the samples to be labelled leads to a more efficient overall learning pipeline. With empirical investigations, we show that our proposed Siamese Network outperforms several benchmark approaches based on standard string matching algorithms when enough labelled data are available. Moreover, we show that Active Learning prioritisation is indeed helpful when labelling resources are limited, and let the learning models reach the out-of-sample performance saturation with less labelled data with respect to standard (random) data labelling approaches.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2303.05391</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-04
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2303_05391
source arXiv.org; Free E- Journals
subjects Active learning
Algorithms
Artificial neural networks
Computer Science - Artificial Intelligence
Computer Science - Computation and Language
Computer Science - Databases
Computer Science - Learning
Empirical analysis
Labeling
Names
Natural language processing
String matching
Supervised learning
Vector spaces
title Disambiguation of Company names via Deep Recurrent Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T04%3A51%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Disambiguation%20of%20Company%20names%20via%20Deep%20Recurrent%20Networks&rft.jtitle=arXiv.org&rft.au=Basile,%20Alessandro&rft.date=2023-04-15&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2303.05391&rft_dat=%3Cproquest_arxiv%3E2785475421%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2785475421&rft_id=info:pmid/&rfr_iscdi=true