DOCSLIB.ORG

Preliminary Draft (C) 2007 Cambridge UP

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

An Introduction to Information Retrieval Draft of February 17, 2007 Preliminary draft (c)2007 Cambridge UP Preliminary draft (c)2007 Cambridge UP An Introduction to Information Retrieval Christopher D. Manning Prabhakar Raghavan Hinrich Schütze Cambridge University Press Cambridge, England Preliminary draft (c)2007 Cambridge UP DRAFT! DO NOT DISTRIBUTE WITHOUT PRIOR PERMISSION © 2007 Cambridge University Press Printed on February 17, 2007 Website: http://www.informationretrieval.org/ By Christopher D. Manning, Prabhakar Raghavan & Hinrich Schütze Comments, corrections, and other feedback most welcome at: [email protected] Preliminary draft (c)2007 Cambridge UP DRAFT! © February 17, 2007 Cambridge University Press. Feedback welcome. v Brief Contents 1 Information retrieval using the Boolean model 1 2 The dictionary and postings lists 17 3 Tolerant retrieval 39 4 Index construction 51 5 Index compression 65 6 Scoring and term weighting 85 7 Vector space retrieval 97 8 Evaluation in information retrieval 109 9 Relevance feedback and query expansion 129 10 XML retrieval 147 11 Probabilistic information retrieval 163 12 Language models for information retrieval 177 13 Text classification and Naive Bayes 189 14 Vector space classification 213 15 Support vector machines and kernel functions 233 16 Flat clustering 247 17 Hierarchical clustering 269 18 Dimensionality reduction and Latent Semantic Indexing 291 19 Web search basics 301 20 Web crawling and indexes 317 21 Link analysis 331 Preliminary draft (c)2007 Cambridge UP Preliminary draft (c)2007 Cambridge UP DRAFT! © February 17, 2007 Cambridge University Press. Feedback welcome. vii Contents List of Tables xv List of Figures xvii Table of Notations xxiii 1 Information retrieval using the Boolean model 1 1.1 An example information retrieval problem 2 1.2 A first take at building an inverted index 5 1.3 Processing Boolean queries 9 1.4 Boolean querying, extend Boolean querying, and ranked retrieval 11 1.5 Referencesandfurtherreading 13 1.6 Exercises 14 2 The dictionary and postings lists 17 2.1 Document delineation and character sequence decoding 17 2.1.1 Obtaining the character sequence in a document 17 2.1.2 Choosing a document unit 18 2.2 Determining dictionary terms 20 2.2.1 Tokenization 20 2.2.2 Dropping common terms: stop words 23 2.2.3 Normalization (equivalence classing of terms) 24 2.2.4 Stemming and lemmatization 28 2.3 Postings lists, revisited 31 2.3.1 Faster postings merges: Skip pointers 31 2.3.2 Phrasequeries 32 2.4 Referencesandfurtherreading 36 2.5 Exercises 37 3 Tolerant retrieval 39 Preliminary draft (c)2007 Cambridge UP viii Contents 3.1 Wildcard queries 39 3.1.1 Generalwildcardqueries 40 3.1.2 k-gramindexes 42 3.2 Spelling correction 43 3.2.1 Implementing spelling correction 43 3.2.2 Forms of spell correction 44 3.2.3 Editdistance 44 3.2.4 k-gramindexes 46 3.2.5 Context sensitive spelling correction 47 3.3 Phonetic correction 48 3.4 Referencesandfurtherreading 50 4 Index construction 51 4.1 Construction of large indexes 51 4.2 Distributed indexing 54 4.3 Dynamic indexing 57 4.4 Other types of indexes 59 4.5 Referencesandfurtherreading 60 4.6 Exercises 61 5 Index compression 65 5.1 Statistical properties of terms in information retrieval 65 5.2 Dictionary compression 68 5.2.1 Dictionary-as-a-string 68 5.2.2 Blocked storage 70 5.3 Postings file compression 72 5.3.1 Variablebytecodes 73 5.3.2 γ codes 74 5.4 Referencesandfurtherreading 80 5.5 Exercises 81 6 Scoring and term weighting 85 6.1 Parametricandzoneindexes 85 6.1.1 Weighted zone scoring 87 6.2 Term frequency and weighting 87 6.2.1 Inversedocumentfrequency 88 6.2.2 tf-idf weighting 90 6.3 Variants in weighting functions 90 6.3.1 Sublinear tf scaling 91 6.3.2 Maximum tf normalization 91 6.3.3 The effect of document length 92 6.3.4 Learning weight functions 92 6.3.5 Query-term proximity 94 Preliminary draft (c)2007 Cambridge UP Contents ix 7 Vector space retrieval 97 7.1 Documents as vectors 97 7.1.1 Innerproducts 97 7.1.2 Queriesasvectors 100 7.1.3 Pivoted normalized document length 101 7.2 Heuristics for efficient scoring and ranking 102 7.2.1 Inexacttop K document retrieval 103 7.3 Interaction between vector space and other retrieval methods 105 7.3.1 Query parsing and composite scoring 106 7.4 Referencesandfurtherreading 107 8 Evaluation in information retrieval 109 8.1 Evaluating information retrieval systems and search engines 110 8.1.1 Standardbenchmarksforrelevance 111 8.1.2 Measuresofretrievalperformance 111 8.2 Evaluation of ranked retrieval results 114 8.3 From documents to test collections 119 8.4 A broader perspective: System quality and user utility 120 8.4.1 System issues 121 8.4.2 User utility 121 8.4.3 Document relevance: critiques and justifications of theconcept 122 8.5 Results snippets 123 8.6 Conclusion 125 8.7 Referencesandfurtherreading 126 9 Relevance feedback and query expansion 129 9.1 Relevance feedbackand pseudo-relevancefeedback 130 9.1.1 The Rocchio Algorithm 132 9.1.2 Probabilisticrelevancefeedback 136 9.1.3 Whendoesrelevancefeedbackwork? 137 9.1.4 RelevanceFeedbackontheWeb 138 9.1.5 Evaluationof relevancefeedbackstrategies 139 9.1.6 Pseudo-relevancefeedback 139 9.1.7 Indirectrelevancefeedback 140 9.1.8 Summary 140 9.2 Global methods for query reformulation 141 9.2.1 Vocabulary tools for query reformulation 141 9.2.2 Queryexpansion 141 9.2.3 Automatic thesaurus generation 143 9.3 Referencesandfurtherreading 145 Preliminary draft (c)2007 Cambridge UP x Contents 10 XML retrieval 147 10.1 BasicXMLconcepts 148 10.2 Challenges in semistructured retrieval 150 10.3 AvectorspacemodelforXMLretrieval 153 10.4 EvaluationofXMLRetrieval 157 10.5 Text-centric vs. structure-centric XML retrieval 160 10.6 Referencesandfurtherreading 162 10.7 Exercises 162 11 Probabilistic information retrieval 163 11.1 Probability in Information Retrieval 163 11.2 The Probability Ranking Principle 164 11.3 TheBinaryIndependenceModel 166 11.3.1 Deriving a ranking function for query terms 167 11.3.2 Probability estimates in theory 168 11.3.3 Probability estimates in practice 169 11.3.4 Probabilistic approaches to relevance feedback 170 11.3.5 PRPandBIM 171 11.4 An appraisal and some extensions 173 11.4.1 OkapiBM25: anon-binarymodel 173 11.4.2 BayesiannetworkapproachestoIR 174 11.5 Referencesandfurtherreading 175 11.6 Exercises 176 11.6.1 Okapi weighting 176 12 Language models for information retrieval 177 12.1 The Query Likelihood Model 180 12.1.1 Using Query Likelihood Language Models in IR 180 12.1.2 Estimating the query generation probability 181 12.2 Ponte and Croft’s Experiments 183 12.3 Language modeling versus other approaches in IR 183 12.4 Extended language modeling approaches 185 12.5 Referencesandfurtherreading 187 13 Text classification and Naive Bayes 189 13.1 The text classification problem 191 13.2 NaiveBayestextclassification 192 13.3 The multinomial versus the binomial model 198 13.4 PropertiesofNaiveBayes 199 13.5 Feature selection 200 13.5.1 Mutual information 200 13.5.2 χ2 feature selection 202 13.5.3 Frequency-based feature selection 204 Preliminary draft (c)2007 Cambridge UP Contents xi 13.5.4 Comparison of feature selection methods 205 13.6 Evaluation of text classification 206 13.7 Referencesandfurther reading 208 13.8 Exercises 209 14 Vector space classification 213 14.1 Rocchio classification 214 14.2 k nearest neighbor 219 14.3 Linear vs. nonlinear classifiers and the bias-variance tradeoff 222 14.3.1 More than two classes 227 14.4 Referencesandfurther reading 230 14.5 Exercises 230 15 Support vector machines and kernel functions 233 15.1 Support vector machines: The linearly separable case 233 15.2 Soft margin classification 239 15.3 NonlinearSVMs 240 15.4 Experimentaldata 243 15.5 Issues in the categorization of text documents 245 15.6 Referencesandfurther reading 245 16 Flat clustering 247 16.1 Clustering in information retrieval 248 16.2 Problem statement 251 16.3 Evaluation of clustering 252 16.4 K-means 255 16.4.1 Cluster cardinality in k-means 259 16.5 Model-basedclustering 261 16.6 Referencesandfurther reading 265 16.7 Exercises 266 17 Hierarchical clustering 269 17.1 Hierarchical agglomerative clustering 270 17.2 Single-link and complete-link clustering 273 17.2.1 Time complexity 277 17.3 Group-average agglomerative clustering 280 17.4 Centroid clustering 281 17.5 Cluster labeling 283 17.6 Variants 285 17.7 Implementation notes 286 17.8 Referencesandfurther reading 287 17.9 Exercises 288 Preliminary draft (c)2007 Cambridge UP xii Contents 18 Dimensionality reduction and Latent Semantic Indexing 291 18.1 Linearalgebrareview 291 18.1.1 Matrix decompositions 294 18.2 Term-document matrices and singular value decompositions 295 18.3 Low rank approximations and latent semantic indexing 296 18.4 Referencesandfurtherreading 299 19 Web search basics 301 19.1 Background and history 301 19.2 Webcharacteristics 303 19.2.1 Spam 305 19.3 Advertising as the economic model 307 19.4 Thesearchuserexperience 309 19.4.1 Userqueryneeds 309 19.5 Index size and estimation 310 19.6 Duplication and mirrors 313 19.6.1 Shingling 314 19.7 Referencesandfurtherreading 315 20 Web crawling and indexes 317 20.1 Overview 317 20.1.1 Features a crawler must provide 317 20.1.2 Features a crawler should provide 318 20.2 Crawling 318 20.2.1 Crawlerarchitecture 319 20.2.2 DNS resolution 322 20.2.3 TheURLfrontier 323 20.3 Distributing indexes 326 20.4 Connectivityservers 327 20.5 Referencesandfurtherreading 330 21 Link analysis 331 21.1 Thewebasagraph 331 21.1.1 Anchortext 332 21.2 Pagerank 334 21.2.1 Markovchainreview 335 21.2.2 The Pagerank computation 338 21.2.3 Topic-specificPagerank 341 21.3 Hubs and Authorities 343 21.3.1 Choosing the subset of the web 346 21.4 Referencesandfurtherreading 347 Preliminary draft (c)2007 Cambridge UP Contents xiii Bibliography 349 Index 369 Preliminary draft (c)2007 Cambridge UP Preliminary draft (c)2007 Cambridge UP DRAFT! © February 17, 2007 Cambridge University Press.
Recommended publications
  • Preliminary Version of the Text Analysis Component, Including: Ner, Event Detection and Sentiment Analysis

    Preliminary Version of the Text Analysis Component, Including: Ner, Event Detection and Sentiment Analysis

    D4.1 PRELIMINARY VERSION OF THE TEXT ANALYSIS COMPONENT, INCLUDING: NER, EVENT DETECTION AND SENTIMENT ANALYSIS Grant Agreement nr 611057 Project acronym EUMSSI Start date of project (dur.) December 1st 2013 (36 months) Document due Date : November 30th 2014 (+60 days) (12 months) Actual date of delivery December 2nd 2014 Leader GFAI Reply to [email protected] Document status Submitted Project co-funded by ICT-7th Framework Programme from the European Commission EUMSSI_D4.1 Preliminary version of the text analysis component 1 Project ref. no. 611057 Project acronym EUMSSI Project full title Event Understanding through Multimodal Social Stream Interpretation Document name EUMSSI_D4.1_Preliminary version of the text analysis component.pdf Security (distribution PU – Public level) Contractual date of November 30th 2014 (+60 days) delivery Actual date of December 2nd 2014 delivery Deliverable name Preliminary Version of the Text Analysis Component, including: NER, event detection and sentiment analysis Type P – Prototype Status Submitted Version number v1 Number of pages 60 WP /Task responsible GFAI / GFAI & UPF Author(s) Susanne Preuss (GFAI), Maite Melero (UPF) Other contributors Mahmoud Gindiyeh (GFAI), Eelco Herder (LUH), Giang Tran Binh (LUH), Jens Grivolla (UPF) EC Project Officer Mrs. Aleksandra WESOLOWSKA [email protected] Abstract The deliverable reports on the resources and tools that have been gathered and installed for the preliminary version of the text analysis component Keywords Text analysis component, Named Entity Recognition, Named Entity Linking, Keyphrase Extraction, Relation Extraction, Topic modelling, Sentiment Analysis Circulated to partners Yes Peer review Yes completed Peer-reviewed by Eelco Herder (L3S) Coordinator approval Yes EUMSSI_D4.1 Preliminary version of the text analysis component 2 Table of Contents 1.
  • Information Retrieval and Web Search

    Information Retrieval and Web Search

    Information Retrieval and Web Search Text processing Instructor: Rada Mihalcea (Note: Some of the slides in this slide set were adapted from an IR course taught by Prof. Ray Mooney at UT Austin) IR System Architecture User Interface Text User Text Operations Need Logical View User Query Database Indexing Feedback Operations Manager Inverted file Query Searching Index Text Ranked Retrieved Database Docs Ranking Docs Text Processing Pipeline Documents to be indexed Friends, Romans, countrymen. OR User query Tokenizer Token stream Friends Romans Countrymen Linguistic modules Modified tokens friend roman countryman Indexer friend 2 4 1 2 Inverted index roman countryman 13 16 From Text to Tokens to Terms • Tokenization = segmenting text into tokens: • token = a sequence of characters, in a particular document at a particular position. • type = the class of all tokens that contain the same character sequence. • “... to be or not to be ...” 3 tokens, 1 type • “... so be it, he said ...” • term = a (normalized) type that is included in the IR dictionary. • Example • text = “I slept and then I dreamed” • tokens = I, slept, and, then, I, dreamed • types = I, slept, and, then, dreamed • terms = sleep, dream (stopword removal). Simple Tokenization • Analyze text into a sequence of discrete tokens (words). • Sometimes punctuation (e-mail), numbers (1999), and case (Republican vs. republican) can be a meaningful part of a token. – However, frequently they are not. • Simplest approach is to ignore all numbers and punctuation and use only case-insensitive
  • Constructing a Lexicon of Arabic-English Named Entity Using SMT and Semantic Linked Data

    Constructing a Lexicon of Arabic-English Named Entity Using SMT and Semantic Linked Data

    Constructing a Lexicon of Arabic-English Named Entity using SMT and Semantic Linked Data Emna Hkiri, Souheyl Mallat, and Mounir Zrigui LaTICE Laboratory, Faculty of Sciences of Monastir, Tunisia Abstract: Named entity recognition is the problem of locating and categorizing atomic entities in a given text. In this work, we used DBpedia Linked datasets and combined existing open source tools to generate from a parallel corpus a bilingual lexicon of Named Entities (NE). To annotate NE in the monolingual English corpus, we used linked data entities by mapping them to Gate Gazetteers. In order to translate entities identified by the gate tool from the English corpus, we used moses, a statistical machine translation system. The construction of the Arabic-English named entities lexicon is based on the results of moses translation. Our method is fully automatic and aims to help Natural Language Processing (NLP) tasks such as, machine translation information retrieval, text mining and question answering. Our lexicon contains 48753 pairs of Arabic-English NE, it is freely available for use by other researchers Keywords: Named Entity Recognition (NER), Named entity translation, Parallel Arabic-English lexicon, DBpedia, linked data entities, parallel corpus, SMT. Received April 1, 2015; accepted October 7, 2015 1. Introduction Section 5 concludes the paper with directions for future work. Named Entity Recognition (NER) consists in recognizing and categorizing all the Named Entities 2. State of the art (NE) in a given text, corresponding to two intuitive IAJIT First classes; proper names (persons, locations and Written and spoken Arabic is considered as difficult organizations), numeric expressions (time, date, money language to apprehend in the domain of Natural and percent).
  • Fasttext-Based Intent Detection for Inflected Languages †

    Fasttext-Based Intent Detection for Inflected Languages †

    information Article FastText-Based Intent Detection for Inflected Languages † Kaspars Balodis 1,2,* and Daiga Deksne 1 1 Tilde, Vien¯ıbas Gatve 75A, LV-1004 R¯ıga, Latvia; [email protected] 2 Faculty of Computing, University of Latvia, Rain, a blvd. 19, LV-1586 R¯ıga, Latvia * Correspondence: [email protected] † This paper is an extended version of our paper published in 18th International Conference AIMSA 2018, Varna, Bulgaria, 12–14 September 2018. Received: 15 January 2019; Accepted: 25 April 2019; Published: 1 May 2019 Abstract: Intent detection is one of the main tasks of a dialogue system. In this paper, we present our intent detection system that is based on fastText word embeddings and a neural network classifier. We find an improvement in fastText sentence vectorization, which, in some cases, shows a significant increase in intent detection accuracy. We evaluate the system on languages commonly spoken in Baltic countries—Estonian, Latvian, Lithuanian, English, and Russian. The results show that our intent detection system provides state-of-the-art results on three previously published datasets, outperforming many popular services. In addition to this, for Latvian, we explore how the accuracy of intent detection is affected if we normalize the text in advance. Keywords: intent detection; word embeddings; dialogue system 1. Introduction and Related Work Recent developments in deep learning have made neural networks the mainstream approach for a wide variety of tasks, ranging from image recognition to price forecasting to natural language processing. In natural language processing, neural networks are used for speech recognition and generation, machine translation, text classification, named entity recognition, text generation, and many other tasks.
  • Unsupervised Methods to Predict Example Difficulty in Word Sense

    Unsupervised Methods to Predict Example Difficulty in Word Sense

    Unsupervised Methods to Predict Example Difficulty in Word Sense Annotation Author: Cristina Aceta Moreno Advisors: Oier L´opez de Lacalle, Eneko Agirre and Izaskun Aldezabal hap/lap Hizkuntzaren Azterketa eta Prozesamendua Language Analysis and Processing Final Thesis June 2018 Departments: Computer Systems and Languages, Computational Architectures and Technologies, Computational Science and Artificial Intelligence, Basque Language and Communication, Communications Engineer. Unsupervised Prediction of Example Difficulty ii/103 Language Analysis and Processing Unsupervised Prediction of Example Difficulty iii/103 Laburpena Hitzen Adiera Desanbiguazioa (HAD) Hizkuntzaren Prozesamenduko (HP) erronkarik handienetakoa da. Frogatu denez, HAD sistema ahalik eta arrakastatsuenak entrenatzeko, oso garrantzitsua da entrenatze-datuetatik adibide (hitzen testuinguru) zailak kentzea, honela emaitzak asko hobetzen baitira. Lan honetan, lehenik, gainbegiratutako ereduak aztertzen ditugu, eta, ondoren, gainbegiratu gabeko bi neurri proposatzen ditugu. Gainbegiratutako ereduetan, adibideen zailtasuna definitzeko, anotatutako corpuseko datuak erabiltzen dira. Proposatzen ditugun bi gainbegiratu gabeko neurrietan, berriz, batetik, aztergai den hitzaren zailtasuna neurtzen da (hitzon Wordnet-eko datuak aztertuta), eta, bestetik, hitzaren agerpenarena (alegia, hitzaren testuinguruarena edo adibidearena). Biak konbinatuta, adibideen zailtasuna ezaugarritzeko eredu bat ere proposatzen da. Abstract Word Sense Disambiguation (WSD) is one of the major challenges in
  • Robust Prediction of Punctuation and Truecasing for Medical ASR

    Robust Prediction of Punctuation and Truecasing for Medical ASR

    Robust Prediction of Punctuation and Truecasing for Medical ASR Monica Sunkara Srikanth Ronanki Kalpit Dixit Sravan Bodapati Katrin Kirchhoff Amazon AWS AI, USA fsunkaral, [email protected] Abstract the accuracy of subsequent natural language under- standing algorithms (Peitz et al., 2011a; Makhoul Automatic speech recognition (ASR) systems et al., 2005) to identify information such as pa- in the medical domain that focus on transcrib- tient diagnosis, treatments, dosages, symptoms and ing clinical dictations and doctor-patient con- signs. Typically, clinicians explicitly dictate the versations often pose many challenges due to the complexity of the domain. ASR output punctuation commands like “period”, “add comma” typically undergoes automatic punctuation to etc., and a postprocessing component takes care enable users to speak naturally, without hav- of punctuation restoration. This process is usu- ing to vocalise awkward and explicit punc- ally error-prone as the clinicians may struggle with tuation commands, such as “period”, “add appropriate punctuation insertion during dictation. comma” or “exclamation point”, while true- Moreover, doctor-patient conversations lack ex- casing enhances user readability and improves plicit vocalization of punctuation marks motivating the performance of downstream NLP tasks. This paper proposes a conditional joint mod- the need for automatic prediction of punctuation eling framework for prediction of punctuation and truecasing. In this work, we aim to solve the and truecasing using pretrained masked lan- problem of automatic punctuation and truecasing guage models such as BERT, BioBERT and restoration to medical ASR system text outputs. RoBERTa. We also present techniques for Most recent approaches to punctuation and true- domain and task specific adaptation by fine- casing restoration problem rely on deep learning tuning masked language models with medical (Nguyen et al., 2019a; Salloum et al., 2017).
  • Evaluation of Machine Translation Methods Applied to Medical Terminologies

    Evaluation of Machine Translation Methods Applied to Medical Terminologies

    Evaluation of Machine Translation Methods applied to Medical Terminologies Konstantinos Skianis Yann Briand, Florent Desgrippes BLUAI Agence du Numerique´ en Sante´ Athens, Greece Paris, France [email protected] [email protected] [email protected] Abstract process can be expensive both in terms of time and resources, while the vocabulary and number of Medical terminologies resources and stan- medical terms can reach high numbers and require dards play vital roles in clinical data ex- changes, enabling significantly the services’ health professional efforts for evaluation. interoperability within healthcare national in- This work constitutes a generic, language- formation networks. Health and medical sci- independent and open methodology for medical ence are constantly evolving causing require- terminology translation. To illustrate our approach, ments to advance the terminologies editions. which is based on automated machine translation In this paper, we present our evaluation work methods, we will attempt to develop a first baseline of the latest machine translation techniques ad- translation from English to French for the ICD- dressing medical terminologies. Experiments 11 classification. We also test on the International have been conducted leveraging selected statis- tical and neural machine translation methods. Classification of Functioning, Disability and Health 2 The devised procedure is tested on a validated (ICF) terminology . sample of ICD-11 and ICF terminologies from First, we are going to investigate existing ma- English to French with promising results. chine translation research studies concerning medi- cal terms and documents, with a comparison of the 1 Introduction relative methods. Next, we present our proposed Medical terminologies are of essential importance methodology.

  • Copyright and Use of This Thesis This Thesis Must Be Used in Accordance with the Provisions of the Copyright Act 1968

    COPYRIGHT AND USE OF THIS THESIS This thesis must be used in accordance with the provisions of the Copyright Act 1968. Reproduction of material protected by copyright may be an infringement of copyright and copyright owners may be entitled to take legal action against persons who infringe their copyright. Section 51 (2) of the Copyright Act permits an authorized officer of a university library or archives to provide a copy (by communication or otherwise) of an unpublished thesis kept in the library or archives, to a person who satisfies the authorized officer that he or she requires the reproduction for the purposes of research or study. The Copyright Act grants the creator of a work a number of moral rights, specifically the right of attribution, the right against false attribution and the right of integrity. You may infringe the author’s moral rights if you: - fail to acknowledge the author of this thesis if you quote sections from the work - attribute this thesis to another author - subject this thesis to derogatory treatment which may prejudice the author’s reputation For further information contact the University’s Director of Copyright Services sydney.edu.au/copyright Structured Named Entities Nicky Ringland Supervisor: James Curran A thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy in the School of Information Technologies at The University of Sydney School of Information Technologies 2016 i Abstract The names of people, locations, and organisations play a central role in language, and named entity recognition (NER) has been widely studied, and successfully incorporated, into natural language processing (NLP) applications.
  • Using Named Entity Recognition for Relevance Detection in Social Network Messages

    Using Named Entity Recognition for Relevance Detection in Social Network Messages

    FACULDADE DE ENGENHARIA DA UNIVERSIDADE DO PORTO Using named entity recognition for relevance detection in social network messages Filipe Daniel da Gama Batista Mestrado Integrado em Engenharia Informática e Computação Supervisor: Álvaro Pedro de Barros Borges Reis Figueira July 23, 2017 Using named entity recognition for relevance detection in social network messages Filipe Daniel da Gama Batista Mestrado Integrado em Engenharia Informática e Computação July 23, 2017 Abstract The continuous growth of social networks in the past decade has led to massive amounts of in- formation being generated on a daily-basis. While a lot of this information is merely personal or simply irrelevant to a general audience, relevant news being transmitted through social networks is an increasingly common phenomenon, and therefore detecting such news automatically has become a field of interest and active research. The contribution of the present thesis consisted in studying the importance of named entities in the task of relevance detection. With that in mind, the goal of this work was twofold: 1) to implement or find the best named entity recognition tools for social media texts, and 2) to analyze the importance of extracted entities from posts as features for relevance detection with machine learning. There are already well-known named entity recognition tools, however, most state-of-the-art tools for named entity recognition show significant decrease of performance when tested on social media texts, in comparison to news media texts. This is mainly due to the informal character of so- cial media texts: the absence of context, the lack of proper punctuation, wrong capitalization, the use of characters to represent emoticons, spelling errors and even the use of different languages in the same text.
  • A Rule-Based Normalization System for Greek Noisy User-Generated Text

    A Rule-Based Normalization System for Greek Noisy User-Generated Text

    A Rule-Based Normalization System for Greek Noisy User-Generated Text Marsida Toska Uppsala University Department of Linguistics and Philology Master Programme in Language Technology Master’s Thesis in Language Technology, 30 ECTS credits November 9, 2020 Supervisor: Eva Pettersson Abstract The ever-growing usage of social media platforms generates daily vast amounts of textual data which could potentially serve as a great source of information. There- fore, mining user-generated data for commercial, academic, or other purposes has already attracted the interest of the research community. However, the informal writing which often characterizes online user-generated texts poses a challenge for automatic text processing with Natural Language Processing (NLP) tools. To mitigate the effect of noise in these texts, lexical normalization has been proposed as a preprocessing method which in short is the task of converting non-standard word forms into a canonical one. The present work aims to contribute to this field by developing a rule-based normalization system for Greek Tweets. We perform an analysis of the categories of the out-of-vocabulary (OOV) word forms identified in the dataset and define hand-crafted rules which we combine with edit distance (Levenshtein distance approach) to tackle noise in the cases under scope. To evaluate the performance of the system we perform both an intrinsic and an extrinsic evaluation in order to explore the effect of normalization on the part-of-speech-tagging. The results of the intrinsic evaluation suggest that our system has an accuracy of approx. 95% compared to approx. 81% for the baseline. In the extrinsic evaluation, it is observed a boost of approx.
  • Proceedings Chapter Reference

    Proceedings Chapter Reference

    Proceedings Chapter ResToRinG CaPitaLiZaTion in #TweeTs NEBHI, Kamel, BONTCHEVA, Kalina, GORRELL, Genevieve Abstract The rapid proliferation of microblogs such as Twitter has resulted in a vast quantity of written text becoming available that contains interesting information for NLP tasks. However, the noise level in tweets is so high that standard NLP tools perform poorly. In this paper, we present a statistical truecaser for tweets using a 3-gram language model built with truecased newswire texts and tweets. Our truecasing method shows an improvement in named entity recognition and part-of-speech tagging tasks. Reference NEBHI, Kamel, BONTCHEVA, Kalina, GORRELL, Genevieve. ResToRinG CaPitaLiZaTion in #TweeTs. In: 3rd International Workshop on Natural Language Processing for Social Media in conjunction with WWW 2015. 2015. p. 1111-1115 Available at: http://archive-ouverte.unige.ch/unige:72793 Disclaimer: layout of this document may differ from the published version. 1 / 1 ResToRinG CaPitaLiZaTion in #TweeTs Kamel Nebhi Kalina Bontcheva Genevieve Gorrell LATL-CUI University of Sheffield University of Sheffield University of Geneva 211 Portobello 211 Portobello 7, route de Drize Sheffield S1 4DP, UK Sheffield S1 4DP, UK 1227 Carouge, Switzerland [email protected] [email protected] [email protected] ABSTRACT In this paper, we show the overall impact of tweet truecasing The rapid proliferation of microblogs such as Twitter has resulted in Named Entity Recognition (NER) and part-of-speech (PoS) tag- in a vast quantity of written text becoming available that contains ging. We demonstrate that our statistical truecaser, which uses a interesting information for NLP tasks.
  • Proceedings of the ACL-IJCNLP 2015 System Demonstrations

    Proceedings of the ACL-IJCNLP 2015 System Demonstrations

    ACL-IJCNLP 2015 The 53rd Annual Meeting of the Association for Computational Linguistics and The 7th International Joint Conference on Natural Language Processing Proceedings of System Demonstrations July 26-31, 2015 Beijing, China c 2015 The Association for Computational Linguistics and The Asian Federation of Natural Language Processing Order copies of this and other ACL proceedings from: Association for Computational Linguistics (ACL) 209 N. Eighth Street Stroudsburg, PA 18360 USA Tel: +1-570-476-8006 Fax: +1-570-476-0860 [email protected] ISBN 978-1-941643-99-0 ii Preface Welcome to the proceedings of the system demonstrations session. This volume contains the papers of the system demonstrations presented at the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing, on July 26-31, 2015 in Beijing, China. The system demonstrations program offers the presentation of early research prototypes as well as interesting mature systems. We received 62 submissions, of which 25 were selected for inclusion in the program (acceptance rate of 40.32%) after review by three members of the program committee. We would like to thank the members of the program committee for their timely help in reviewing the submissions. System Demonstration Co-Chairs Hsin-Hsi Chen Katja Markert iii Organizers Co-Chairs: Hsin-Hsi Chen, National Taiwan University (Taiwan) Katja Markert, University of Hanover (Germany) and University of Leeds (UK) Program Committee: Johan Bos, University of Groningen (Netherlands) Miriam Butt, University of Konstanz (Germany) Wenliang Chen, Soochow University, Suzhou (China) Gao Cong, Nanyang Technological University (Singapore) Katja Filippova, Google Inc.