DOCSLIB.ORG

Enhancing Named Entity Recognition in Twitter Messages Using Entity Linking

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Enhancing Named Entity Recognition in Twitter Messages Using Entity Linking Enhancing Named Entity Recognition in Twitter Messages Using Entity Linking Ikuya Yamada1 2 3 Hideaki Takeda2 Yoshiyasu Takefuji3 [email protected] [email protected] [email protected] 1Studio Ousia, 4489-105-221 Endo, Fujisawa, Kanagawa, Japan 2National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda, Tokyo, Japan 3Keio University, 5322 Endo, Fujisawa, Kanagawa, Japan Abstract Freebase (Bollacker et al., 2008)). Because of the recent emergence of large online knowledge In this paper, we describe our approach bases (KB), EL has recently gained significant at- for Named Entity Recognition in Twitter, tention. It is evident that the performance of EL a shared task for ACL 2015 Workshop also degrades when analyzing tweets (Derczynski on Noisy User-generated Text (Baldwin et et al., 2015; Meij et al., 2012). However, Guo al., 2015). Because of the noisy, short, et al. (Guo et al., 2013) recently revealed that and colloquial nature of Twitter, the per- the main failures of Twitter EL are caused while formance of Named Entity Recognition detecting entity mentions from text, because ex- (NER) degrades significantly. To address isting EL methods usually address the mention this problem, we propose a novel method detection task by using external NER software to enhance the performance of the Twitter whose performance is unreliable when processing NER task by using Entity Linking which tweets. Consequently, several approaches (Guo et is a method for detecting entity mentions al., 2013; Yamada et al., 2015) have been proposed in text and resolving them to correspond- with enhanced abilities that address the task in an ing entries in knowledge bases such as end-to-end manner without completely depending Wikipedia. Our method is based on super- on NER software. vised machine-learning and uses the high- The main objective of this study is to investigate quality knowledge obtained from several the possibility of enhancing the performance of open knowledge bases. In comparison Twitter NER by using an end-to-end EL. Although with the other systems proposed for this EL is typically performed after NER in most of shared task, our method achieved the best the existing methods, our approach performs EL performance. before NER and uses the EL results to enhance the 1 Introduction NER performance. Resolving the entity mentions to the KB entries enables us to use the high-quality Named Entity Recognition (NER) refers to the knowledge in KB for enhancing the NER perfor- task of identifying mentions of entities (e.g., per- mance. This knowledge includes things such as sons, locations, organizations) within text. Be- the popularity of the entity, the classes of the en- cause of the noisy, short, and colloquial nature of tity, and the likelihood that the entity appears in Twitter messages (or tweets), the performance of the given context. standard NER software significantly suffers. For We begin by briefly introducing our end-to-end example, Derczynski et al. (Derczynski et al., EL method that specifically focuses on tweets. 2015) recently demonstrated that the performance Our EL method is based on supervised machine- of various state-of-the-art NER software (e.g., learning and addresses the task in an end-to-end Stanford NER and ANNIE) is typically lower than manner. It considers every possible n-gram as a 50% F11 for tweets. candidate entity mention and detects the mention Entity Linking (EL) refers to the task of de- with a corresponding link to a KB entry if the men- tecting textual entity mentions and linking them tion exists in the KB. Furthermore, it can handle to corresponding entries within knowledge bases mentions that appear as irregular forms (e.g., mis- (e.g., Wikipedia, DBpedia (Auer et al., 2007), spellings, abbreviations, acronyms) using several 1The harmonic mean of precision and recall. approximate string matching algorithms. 136 Proceedings of the ACL 2015 Workshop on Noisy User-generated Text, pages 136–140, Beijing, China, July 31, 2015. c 2015 Association for Computational Linguistics The NER task is split into two separate sub- 2.2.1 Mention Candidate Generation tasks: segmentation and classification. During Our system first generates a set of candidate en- segmentation, the entity mentions are detected tity mentions with the set of corresponding refer- from tweets. Then, the entity mentions are clas- ent entities. The system takes all the n-grams of sified into the predefined entity types. Both tasks n 10 and looks up each n-gram in a dictionary, ≤ involve supervised machine-learning with various treats an n-gram as a candidate mention if it exists features. in the dictionary, and finally, generates an output For the segmentation task, we use data obtained of pairs of mentions and their associated possible from the KB of the corresponding entity men- referent entities. tion detected by the EL and the output of a NER software as the main machine-learning features. Mention-Entity Dictionary: The system uses a Furthermore, we include several common features mention-entity dictionary that maps a mention sur- used in traditional NER methods. face (e.g., apple) to the possible referent entities For the classification task, the following three (e.g., Apple Inc., Apple (food)). The possible types of features are used as primary features: 1) mention surfaces of an entity are extracted from the KB types of the entity detected by the EL, 2) the corresponding Wikipedia page title, the page the entity types detected by the NER software, and titles of the Wikipedia pages that redirect to the 3) the vector representation of the entity mention page of the entity, and anchor texts in Wikipedia derived from word embeddings. The entity’s KB articles that point to the page of the entity. We types are extracted from the corresponding entries constructed this dictionary using the January 2015 in DBpedia and Freebase. Furthermore, the vec- dump of Wikipedia. tor representation of the entity mention is derived Approximate Candidate Generation: One using GloVe word embeddings (Pennington et al., major problem of the mention candidate gen- 2014). eration task is that many entity mentions in To train and evaluate our system, we used the tweets cannot be detected because they appear as dataset given by the Named Entity Recognition in irregular forms (e.g., misspellings, abbreviations). Twitter shared task. Our proposed method signifi- In order to address this problem, we introduce cantly outperformed the second ranked system by the following three approximate string-matching a wide margin; 10.3% F1 at the segmentation task, methods to improve the ability of this task: and 5.0% F1 at the end-to-end (both the segmen- tation and the classification) task. Fuzzy match searches the mention candidates • that have text surfaces within a certain dis- 2 The Proposed System tance of the surface of the n-gram measured by edit distance. 2.1 Preprocessing Approximate token search obtains mention • The system first assigns part-of-speech tags to candidates whose text surfaces have a signif- the resulting tokens using ARK Twitter Part-of- icant ratio of words in common with the sur- Speech Tagger (Gimpel et al., 2011). It also to- face of the n-gram. kenizes Twitter hashtags using our enhanced im- Acronym search retrieves mention candidates plementation of the hashtag tokenization. • with possible acronyms2 that include the sur- face of the n-gram. 2.2 Entity Linking We formalize our EL task as follows: Given a When using the above methods, we observed tweet, our goal is to recognize a set of entity that the number of mention candidates becomes mentions (e.g., Obama, President Obama, Barack very large. To deal with this, we use a simple fil- Obama) that appear in a tweet, and then resolve tering method based on soft tf-idf (Cohen et al., the mentions into entities (e.g., Barack Obama) 2003); we simply use only the mention candidates in Wikipedia if they exist. that have a similarity greater than a threshold mea- Our EL system addresses the task using the fol- sured by the soft tf-idf. We use 0.9 as the threshold lowing two steps; mention candidate generation 2We generate acronyms by tokenizing the mention surface and mention detection and disambiguation. and simply taking the first characters of the resulting tokens. 137 because this achieves the best performance in our 2015). Here, we adopt two models of Stanford experiments of EL. NER to enhance the performance: 1) the standard three-class model which is included in the soft- 2.2.2 Mention Detection and Disambiguation ware and 2) a model that does not use capitaliza- Given a pair of a mention and its possible refer- tion as a feature, in order to deal with the unrelia- ent entity, it needs to be determined if the possible bility of capitalization in tweets. referent entity is indeed the correct one for its as- The results of the NER and the KB knowledge sociated mention. of the corresponding entity mention detected by In this system, we use a supervised machine- the EL are used as the primary machine-learning learning algorithm to assign a relevance score to features. We also include features that are tradi- each of the pairs and select the entity mention with tionally used in NER such as part-of-speech tags the highest score. We use random forest as the and the capitalization features. Furthermore, the machine-learning algorithm. ratio of the capitalized words in the tweet is also Here, we use machine-learning features that are used as an indicator of the reliability of the capi- mostly identical to the method proposed previ- talization. ously (Yamada et al., 2015). Basically, we use var- The machine-learning features for this step in- ious features that are commonly observed in EL clude: studies and enhance the performance further by introducing two new features: 1) the entity pop- EL relevance score∗: The relevance score of • ularity knowledge extracted from Wikipedia page the entity mention assigned by the previous views3, and 2) the contextual similarity between EL step.
Load more

Recommended publications
  • Predicting the Correct Entities in Named-Entity Linking
    Separating the Signal from the Noise: Predicting the Correct Entities in Named-Entity Linking Drew Perkins Uppsala University Department of Linguistics and Philology Master Programme in Language Technology Master’s Thesis in Language Technology, 30 ects credits June 9, 2020 Supervisors: Gongbo Tang, Uppsala University Thorsten Jacobs, Seavus Abstract In this study, I constructed a named-entity linking system that maps between contextual word embeddings and knowledge graph embeddings to predict correct entities. To establish a named-entity linking system, I rst applied named-entity recognition to identify the entities of interest. I then performed candidate gener- ation via locality sensitivity hashing (LSH), where a candidate group of potential entities were created for each identied entity. Afterwards, my named-entity dis- ambiguation component was performed to select the most probable candidate. By concatenating contextual word embeddings and knowledge graph embeddings in my disambiguation component, I present a novel approach to named-entity link- ing. I conducted the experiments with the Kensho-Derived Wikimedia Dataset and the AIDA CoNLL-YAGO Dataset; the former dataset was used for deployment and the later is a benchmark dataset for entity linking tasks. Three deep learning models were evaluated on the named-entity disambiguation component with dierent context embeddings. The evaluation was treated as a classication task, where I trained my models to select the correct entity from a list of candidates. By optimizing the named-entity linking through this methodology, this entire system can be used in recommendation engines with high F1 of 86% using the former dataset. With the benchmark dataset, the proposed method is able to achieve F1 of 79%.
    [Show full text]
  • Three Birds (In the LLOD Cloud) with One Stone: Babelnet, Babelfy and the Wikipedia Bitaxonomy
    Three Birds (in the LLOD Cloud) with One Stone: BabelNet, Babelfy and the Wikipedia Bitaxonomy Tiziano Flati and Roberto Navigli Dipartimento di Informatica Sapienza Universit`adi Roma Abstract. In this paper we present the current status of linguistic re- sources published as linked data and linguistic services in the LLOD cloud in our research group, namely BabelNet, Babelfy and the Wikipedia Bitaxonomy. We describe them in terms of their salient aspects and ob- jectives and discuss the benefits that each of these potentially brings to the world of LLOD NLP-aware services. We also present public Web- based services which enable querying, exploring and exporting data into RDF format. 1 Introduction Recent years have witnessed an upsurge in the amount of semantic information published on the Web. Indeed, the Web of Data has been increasing steadily in both volume and variety, transforming the Web into a global database in which resources are linked across sites. It is becoming increasingly critical that existing lexical resources be published as Linked Open Data (LOD), so as to foster integration, interoperability and reuse on the Semantic Web [5]. Thus, lexical resources provided in RDF format can contribute to the creation of the so-called Linguistic Linked Open Data (LLOD), a vision fostered by the Open Linguistic Working Group (OWLG), in which part of the Linked Open Data cloud is made up of interlinked linguistic resources [2]. The multilinguality aspect is key to this vision, in that it enables Natural Language Processing tasks which are not only cross-lingual, but also independent both of the language of the user input and of the linked data exploited to perform the task.
    [Show full text]
  • Cross Lingual Entity Linking with Bilingual Topic Model
    Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Cross Lingual Entity Linking with Bilingual Topic Model Tao Zhang, Kang Liu and Jun Zhao Institute of Automation, Chinese Academy of Sciences HaiDian District, Beijing, China {tzhang, kliu, jzhao}@nlpr.ia.ac.cn Abstract billion web pages on Internet and 31% of them are written in other languages. This report tells us that the percentage of Cross lingual entity linking means linking an entity web pages written in English are decreasing, which indicates mention in a background source document in one that English pages are becoming less dominant compared language with the corresponding real world entity in with before. Therefore, it becomes more and more important a knowledge base written in the other language. The to maintain the growing knowledge base by discovering and key problem is to measure the similarity score extracting information from all web contents written in between the context of the entity mention and the different languages. Also, inserting new extracted knowledge document of the candidate entity. This paper derived from the information extraction system into a presents a general framework for doing cross knowledge base inevitably needs a system to map the entity lingual entity linking by leveraging a large scale and mentions in one language to their entries in a knowledge base bilingual knowledge base, Wikipedia. We introduce which may be another language. This task is known as a bilingual topic model that mining bilingual topic cross-lingual entity linking. from this knowledge base with the assumption that Intuitively, to resolve the cross-lingual entity linking the same Wikipedia concept documents of two problem, the key is how to define the similarity score different languages share the same semantic topic between the context of entity mention and the document of distribution.
    [Show full text]
  • Babelfying the Multilingual Web: State-Of-The-Art Disambiguation and Entity Linking of Web Pages in 50 Languages
    Babelfying the Multilingual Web: state-of-the-art Disambiguation and Entity Linking of Web pages in 50 languages Roberto Navigli [email protected] http://lcl.uniroma1.it! ERC StG: MultilingualERC Joint Word Starting Sense Disambiguation Grant (MultiJEDI) MultiJEDI No. 259234 1! Roberto Navigli! LIDER EU Project No. 610782! Joint work with Andrea Moro Alessandro Raganato A. Moro, A. Raganato, R. Navigli. Entity Linking meets Word Sense Disambiguation: a Unified Approach. Transactions of the Association for Computational Linguistics (TACL), 2, 2014. Babelfying the Multilingual Web: state-of-the-art Disambiguation and Entity Linking Andrea Moro and Roberto Navigli 2014.05.08 BabelNet & friends3 Roberto Navigli 2014.05.08 BabelNet & friends4 Roberto Navigli Motivation • Domain-specific Web content is available in many languages • Information should be extracted and processed independently of the source/target language • This could be done automatically by means of high- performance multilingual text understanding Babelfying the Multilingual Web: state-of-the-art Disambiguation and Entity Linking Andrea Moro, Alessandro Raganato and Roberto Navigli BabelNet (http://babelnet.org) A wide-coverage multilingual semantic network and encyclopedic dictionary in 50 languages! Named Entities and specialized concepts Concepts from WordNet from Wikipedia Concepts integrated from both resources Babelfying the Multilingual Web: state-of-the-art Disambiguation and Entity Linking Andrea Moro, Alessandro Raganato and Roberto Navigli BabelNet (http://babelnet.org)
    [Show full text]
  • Named Entity Extraction for Knowledge Graphs: a Literature Overview
    Received December 12, 2019, accepted January 7, 2020, date of publication February 14, 2020, date of current version February 25, 2020. Digital Object Identifier 10.1109/ACCESS.2020.2973928 Named Entity Extraction for Knowledge Graphs: A Literature Overview TAREQ AL-MOSLMI , MARC GALLOFRÉ OCAÑA , ANDREAS L. OPDAHL, AND CSABA VERES Department of Information Science and Media Studies, University of Bergen, 5007 Bergen, Norway Corresponding author: Tareq Al-Moslmi ([email protected]) This work was supported by the News Angler Project through the Norwegian Research Council under Project 275872. ABSTRACT An enormous amount of digital information is expressed as natural-language (NL) text that is not easily processable by computers. Knowledge Graphs (KG) offer a widely used format for representing information in computer-processable form. Natural Language Processing (NLP) is therefore needed for mining (or lifting) knowledge graphs from NL texts. A central part of the problem is to extract the named entities in the text. The paper presents an overview of recent advances in this area, covering: Named Entity Recognition (NER), Named Entity Disambiguation (NED), and Named Entity Linking (NEL). We comment that many approaches to NED and NEL are based on older approaches to NER and need to leverage the outputs of state-of-the-art NER systems. There is also a need for standard methods to evaluate and compare named-entity extraction approaches. We observe that NEL has recently moved from being stepwise and isolated into an integrated process along two dimensions: the first is that previously sequential steps are now being integrated into end-to-end processes, and the second is that entities that were previously analysed in isolation are now being lifted in each other's context.
    [Show full text]
  • Entity Linking
    Entity Linking Kjetil Møkkelgjerd Master of Science in Computer Science Submission date: June 2017 Supervisor: Herindrasana Ramampiaro, IDI Norwegian University of Science and Technology Department of Computer Science Abstract Entity linking may be of help to quickly supplement a reader with further information about entities within a text by providing links to a knowledge base containing more information about each entity, and may thus potentially enhance the reading experience. In this thesis, we look at existing solutions, and implement our own deterministic entity linking system based on our research, using our own approach to the problem. Our system extracts all entities within the input text, and then disam- biguates each entity considering the context. The extraction step is han- dled by an external framework, while the disambiguation step focuses on entity-similarities, where similarity is defined by how similar the entities’ categories are, which we measure by using data from a structured knowledge base called DBpedia. We base this approach on the assumption that simi- lar entities usually occur close to each other in written text, thus we select entities that appears to be similar to other nearby entities. Experiments show that our implementation is not as effective as some of the existing systems we use for reference, and that our approach has some weaknesses which should be addressed. For example, DBpedia is not an as consistent knowledge base as we would like, and the entity extraction framework often fail to reproduce the same entity set as the dataset we use for evaluation. However, our solution show promising results in many cases.
    [Show full text]
  • Named-Entity Recognition and Linking with a Wikipedia-Based Knowledge Base Bachelor Thesis Presentation Niklas Baumert [[email protected]]
    Named-Entity Recognition and Linking with a Wikipedia-based Knowledge Base Bachelor Thesis Presentation Niklas Baumert [[email protected]] 2018-11-08 Contents 1 Why and What?—Motivation. 1.1 What is named-entity recognition? 1.2 What is entity linking? 2 How?—Implementation. 2.1 Wikipedia-backed Knowledge Base. 2.2 Entity Recognizer & Linker. 3 Performance Evaluation. 4 Conclusion. 2 1 Why and What—Motivation. 3 Built to provide input files for QLever. ● Specialized use-case. ○ General application as an extra feature. ● Providing a wordsfile and a docsfile as output. ● Wordsfile is input for QLever. ● Support for Wikipedia page titles, Freebase IDs and Wikidata IDs. ○ Convert between those 3 freely afterwards. 4 The docsfile is a list of all sentences with IDs. record id text 1 Anarchism is a political philosophy that advocates [...] 2 These are often described as [...] 5 The wordsfile contains each word of each sentence and determines entities and their likeliness. word Entity? recordID score Anarchism 0 1 1 <Anarchism> 1 1 0.9727 is 0 1 1 a 0 1 1 political 0 1 1 philosophy 0 1 1 <Philosophy> 1 1 0.955 6 Named-entity recognition (NER) identifies nouns in a given text. ● Finding and categorizing entities in a given text. [1][2] ● (Proper) nouns refer to entities. ● Problem: Words are ambiguous. [1] ○ Same word, different entities within a category—”John F. Kennedy”, the president or his son? ○ Same word, different entities in different categories—”JFK”, person or airport? 7 Entity linking (EL) links entities to a database. ● Resolve ambiguity by associating mentions to entities in a knowledge base.
    [Show full text]
  • KORE 50^DYWC: an Evaluation Data Set for Entity Linking Based On
    Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020), pages 2389–2395 Marseille, 11–16 May 2020 c European Language Resources Association (ELRA), licensed under CC-BY-NC KORE 50DYWC: An Evaluation Data Set for Entity Linking Based on DBpedia, YAGO, Wikidata, and Crunchbase Kristian Noullet, Rico Mix, Michael Farber¨ Karlsruhe Institute of Technology (KIT) [email protected], [email protected], [email protected] Abstract A major domain of research in natural language processing is named entity recognition and disambiguation (NERD). One of the main ways of attempting to achieve this goal is through use of Semantic Web technologies and its structured data formats. Due to the nature of structured data, information can be extracted more easily, therewith allowing for the creation of knowledge graphs. In order to properly evaluate a NERD system, gold standard data sets are required. A plethora of different evaluation data sets exists, mostly relying on either Wikipedia or DBpedia. Therefore, we have extended a widely-used gold standard data set, KORE 50, to not only accommodate NERD tasks for DBpedia, but also for YAGO, Wikidata and Crunchbase. As such, our data set, KORE 50DYWC, allows for a broader spectrum of evaluation. Among others, the knowledge graph agnosticity of NERD systems may be evaluated which, to the best of our knowledge, was not possible until now for this number of knowledge graphs. Keywords: Data Sets, Entity Linking, Knowledge Graph, Text Annotation, NLP Interchange Format 1. Introduction Therefore, annotation methods can only be evaluated Automatic extraction of semantic information from texts is on a small part of the KG concerning a specific do- an open problem in natural language processing (NLP).
    [Show full text]
  • Entity Linking with a Knowledge Base: Issues, Techniques, and Solutions Wei Shen, Jianyong Wang, Senior Member, IEEE, and Jiawei Han, Fellow, IEEE
    1 Entity Linking with a Knowledge Base: Issues, Techniques, and Solutions Wei Shen, Jianyong Wang, Senior Member, IEEE, and Jiawei Han, Fellow, IEEE Abstract—The large number of potential applications from bridging Web data with knowledge bases have led to an increase in the entity linking research. Entity linking is the task to link entity mentions in text with their corresponding entities in a knowledge base. Potential applications include information extraction, information retrieval, and knowledge base population. However, this task is challenging due to name variations and entity ambiguity. In this survey, we present a thorough overview and analysis of the main approaches to entity linking, and discuss various applications, the evaluation of entity linking systems, and future directions. Index Terms—Entity linking, entity disambiguation, knowledge base F 1 INTRODUCTION Entity linking can facilitate many different tasks such as knowledge base population, question an- 1.1 Motivation swering, and information integration. As the world HE amount of Web data has increased exponen- evolves, new facts are generated and digitally ex- T tially and the Web has become one of the largest pressed on the Web. Therefore, enriching existing data repositories in the world in recent years. Plenty knowledge bases using new facts becomes increas- of data on the Web is in the form of natural language. ingly important. However, inserting newly extracted However, natural language is highly ambiguous, es- knowledge derived from the information extraction pecially with respect to the frequent occurrences of system into an existing knowledge base inevitably named entities. A named entity may have multiple needs a system to map an entity mention associated names and a name could denote several different with the extracted knowledge to the corresponding named entities.
    [Show full text]
  • Capturing Semantic Similarity for Entity Linking with Convolutional Neural Networks
    Capturing Semantic Similarity for Entity Linking with Convolutional Neural Networks Matthew Francis-Landau, Greg Durrett and Dan Klein Computer Science Division University of California, Berkeley mfl,gdurrett,klein @cs.berkeley.edu { } Abstract al., 2011), but such heuristics are hard to calibrate and they capture structure in a coarser way than A key challenge in entity linking is making ef- learning-based methods. fective use of contextual information to dis- In this work, we model semantic similarity be- ambiguate mentions that might refer to differ- tween a mention’s source document context and its ent entities in different contexts. We present a model that uses convolutional neural net- potential entity targets using convolutional neural works to capture semantic correspondence be- networks (CNNs). CNNs have been shown to be ef- tween a mention’s context and a proposed tar- fective for sentence classification tasks (Kalchbren- get entity. These convolutional networks oper- ner et al., 2014; Kim, 2014; Iyyer et al., 2015) and ate at multiple granularities to exploit various for capturing similarity in models for entity linking kinds of topic information, and their rich pa- (Sun et al., 2015) and other related tasks (Dong et rameterization gives them the capacity to learn al., 2015; Shen et al., 2014), so we expect them to be which n-grams characterize different topics. effective at isolating the relevant topic semantics for We combine these networks with a sparse lin- ear model to achieve state-of-the-art perfor- entity linking. We show that convolutions over mul- mance on multiple entity linking datasets, out- tiple granularities of the input document are useful performing the prior systems of Durrett and for providing different notions of semantic context.
    [Show full text]
  • Satellitener: an Effective Named Entity Recognition Model for the Satellite Domain
    SatelliteNER: An Effective Named Entity Recognition Model for the Satellite Domain Omid Jafari1 a, Parth Nagarkar1 b, Bhagwan Thatte2 and Carl Ingram3 1Computer Science Department, New Mexico State University, Las Cruces, NM, U.S.A. 2Protos Software, Tempe, AZ, U.S.A. 3Vigilant Technologies, Tempe, AZ, U.S.A. Keywords: Natural Language Processing, Named Entity Recognition, Spacy. Abstract: Named Entity Recognition (NER) is an important task that detects special type of entities in a given text. Existing NER techniques are optimized to find commonly used entities such as person or organization names. They are not specifically designed to find custom entities. In this paper, we present an end-to-end framework, called SatelliteNER, that its objective is to specifically find entities in the Satellite domain. The workflow of our proposed framework can be further generalized to different domains. The design of SatelliteNER in- cludes effective modules for preprocessing, auto-labeling and collection of training data. We present a detailed analysis and show that the performance of SatelliteNER is superior to the state-of-the-art NER techniques for detecting entities in the Satellite domain. 1 INTRODUCTION with having NER tools for different human languages (e.g., English, French, Chinese, etc.), domain-specific Nowadays, large amounts of data is generated daily. NER software and tools have been created with the Textual data is generated by news articles, social me- consideration that all sciences and applications have a dia such as Twitter, Wikipedia, etc. Managing these growing need for NLP. For instance, NER is used in large data and extracting useful information from the medical field (Abacha and Zweigenbaum, 2011), them is an important task that can be achieved using for the legal documents (Dozier et al., 2010), for Natural Language Processing (NLP).
    [Show full text]
  • BENNERD: a Neural Named Entity Linking System for COVID-19
    BENNERD: A Neural Named Entity Linking System for COVID-19 Mohammad Golam Sohraby,∗, Khoa N. A. Duongy,∗, Makoto Miway, z , Goran Topic´y, Masami Ikeday, and Hiroya Takamuray yArtificial Intelligence Research Center (AIRC) National Institute of Advanced Industrial Science and Technology (AIST), Japan zToyota Technological Institute, Japan fsohrab.mohammad, khoa.duong, [email protected], fikeda-masami, [email protected], [email protected] Abstract in text mining system, Xuan et al.(2020b) created CORD-NER dataset with comprehensive NE an- We present a biomedical entity linking (EL) system BENNERD that detects named enti- notations. The annotations are based on distant ties in text and links them to the unified or weak supervision. The dataset includes 29,500 medical language system (UMLS) knowledge documents from the CORD-19 corpus. The CORD- base (KB) entries to facilitate the corona virus NER dataset gives a shed on NER, but they do not disease 2019 (COVID-19) research. BEN- address linking task which is important to address NERD mainly covers biomedical domain, es- COVID-19 research. For example, in the example pecially new entity types (e.g., coronavirus, vi- sentence in Figure1, the mention SARS-CoV-2 ral proteins, immune responses) by address- ing CORD-NER dataset. It includes several needs to be disambiguated. Since the term SARS- NLP tools to process biomedical texts includ- CoV-2 in this sentence refers to a virus, it should ing tokenization, flat and nested entity recog- be linked to an entry of a virus in the knowledge nition, and candidate generation and rank- base, not to an entry of ‘SARS-CoV-2 vaccination’, ing for EL that have been pre-trained using which corresponds to therapeutic or preventive pro- the CORD-NER corpus.
    [Show full text]