DOCSLIB.ORG

SPINOZAVU: an NLP Pipeline for Cross Document Timelines

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
SPINOZAVU: an NLP Pipeline for Cross Document Timelines SPINOZA VU: An NLP Pipeline for Cross Document TimeLines Tommaso Caselli Antske Fokkens Roser Morante Piek Vossen Computational Lexicology & Terminology Lab (CLTL) VU Amsterdam, De Boelelaan 1105 1081 HV Amsterdam Nederland t.caselli antske.fokkens r.morantevallejo p.t.j.m.vossen @vu.nl { }{ }{ }{ } Abstract event detection and ordering; event coreference (in- document and cross-document); and entity-based This paper describes the system temporal processing. SPINOZA VU developed for the SemEval The SPINOZA VU system is based on the News- 2015 Task 4: Cross Document TimeLines. Reader (NWR) NLP pipeline (Agerri et al., 2013; The system integrates output from the News- Beloki et al., 2014), which has been developed Reader Natural Language Processing pipeline 1 and is designed following an entity based within the context of the NWR project and pro- model. The poor performance of the submit- vides multi-layer annotations over raw texts from ted runs are mainly a consequence of error tokenization up to temporal relations. The goal of propagation. Nevertheless, the error analysis the NWR project is to build structured event in- has shown that the interpretation module dexes from large volumes of news data addressing behind the system performs correctly. An the same research issues as the task. Within this out of competition version of the system has framework, we are developing a storyline module fixed some errors and obtained competitive results. Therefore, we consider the system an which aims at providing more structured represen- important step towards a more complex task tation of events and their relations. Timeline extrac- such as storyline extraction. tion from raw text qualifies as the first component of this new module. This is why we participated in Track A and Subtrack A of the task, timeline extrac- 1 Introduction tion from raw text. Participating in Track B would This paper reports on a system (SPINOZA VU) for require a full re-engineering of the NWR pipeline timeline extraction developed at the CLTL Lab of and of our system. the VU Amsterdam in the context of the SemEval The remainder of the paper is structured as fol- 2015 Task 4: Cross Document TimeLines. In this lows: Section 2 provides an overview of the model task, a timeline is defined as a set of chronologically implemented in the two versions of our system. Sec- anchored and ordered events extracted from a corpus tion 3 presents the results and error analysis, and spanning over a (large) period of time with respect Section 4 puts forward some conclusions. to a target entity. 2 From Model to System Cross-document timeline extraction benefits from previous works and evaluation campaigns in Tem- Timeline extraction involves a number of indepen- poral Processing, such as the TempEval evaluation dent though highly connected subtasks, the most campaigns (Verhagen et al., 2007; Verhagen et al., relevant ones being: entity resolution, event detec- 2010; UzZaman et al., 2013) and aims at promoting tion, event-participant linking, coreference resolu- research in temporal processing by tackling the fol- lowing issues: cross-document and cross-temporal 1http://www.newsreader-project.eu 787 Proceedings of the 9th International Workshop on Semantic Evaluation (SemEval 2015), pages 787–791, Denver, Colorado, June 4-5, 2015. c 2015 Association for Computational Linguistics tion, factuality profiling, and temporal relation pro- • SPINOZA VU 1 uses the output of a state of cessing (ordering and anchoring). the art system, TIPSem (Llorens et al., 2010), We designed a system that addresses these sub- for event detection and temporal relations; tasks, first at document level, and then, at cross- • SPINOZA VU 2 is entirely based on data document level. We diverted from the general NWR from the NWR pipeline including the temporal approach and adopted an entity based model and (TLINKs) and causal relation (CLINKs) layers. representation rather than an event based one in or- der to fit the task. This means that we used entities The final output is based on a dedicated rule- as hub of information for timelines. Using an entity based module, the TimeLine (TML) module. We driven representation allows us to better model the will describe in the following paragraphs how each following aspects: subtask has been tackled with respect to each ver- sion of the system. • Event co-participation: the data collected Entity identification Entity identification relies with this method facilitates the analysis of the on the entity detection and disambiguation layer interactions between the participants involved (NERD) of the NWR pipeline. Each detected en- in an event individually; tity is associated with a URI (a unique identifier), • Event relations: in an entity based representa- either from DBpedia or a specifically created one tion, event mentions with more than one entity based on the strings describing the entity. We ex- as their participants will be repeated in the final tracted the entities by merging information from the representation (both at in-document at cross- NERD layer with that from the semantic role la- document levels); such a representation can be belling (SRL) layer. We retained only those en- further used to explore and discover additional tity mentions which fulfil the argument positions event relations2; of proto-agent (Arg0) or proto-patient (Arg1) in the • Event coreference: we assume that two event SRL layer. mentions (either in the same document or in Event detection and classification The different documents) are coreferential if they SPINOZA VU 1 event module is based on share the same participant set (i.e., entities) and TIPSem, which provides TimeML compliant data. occur at the same time and place (Chen et al., We developed post processing rules to convert the 2011; Cybulska and Vossen, 2013); TimeML event classes (OCCURRENCE, STATE, • Temporal relations: temporal relation pro- I ACTION, I STATE, ASPECTUAL, REPORT- cessing can benefit from an entity driven ap- ING and PERCEPTION) to specific FrameNet proach as sequences of events sharing the same frames (e.g., Communication, Being in operation, entities (i.e., co-participant events) can be as- Body movement) and/or Event Situation Ontology sumed to stand in precedence relation (Cham- (ESO) types (Segers et al., 2015) (e.g., contextual), bers and Jurafsky, 2009; Chambers and Juraf- which correspond to the event types specified in the sky, 2010). task guidelines. For instance, not all mentions of TimeML I STATE, I ACTION, OCCURRENCE 2.1 The SPINOZA VU System and STATE events can enter a timeline. The The NWR pipeline which forms the basis of the alignment with FrameNet and ESO is made by SPINOZA VU system consists of 15 modules car- combining the data from the Word Sense Dis- rying out various NLP tasks and outputs the results ambiguation (WSD) layer of the pipeline with in NLP Annotation Format (Fokkens et al., 2014), Predicate Matrix (version 1.1) (Lacalle et al., 2014). a layered standoff representation format. Two ver- As for the SPINOZA VU 2, we have used the sions of the system have been developed, namely: NWR SRL layer to identify and retain the eligi- 2 ble events. In this case the access to the Predi- We are referring to a broader set of relations that we la- cate Matrix is not necessary as each predicate in beled as “bridging relations” among events which involve co- participation, primary and secondary causal relations, temporal the SRL layer is also associated with corresponding relations, and entailment relations. FrameNet frames and ESO types. Only the pred- 788 icates matching specific FrameNet frames and/or TimeLine Extraction The TimeLine Extrac- ESO types were retained as candidate events. tion (TML) module3 harmonizes and orders cross- Factuality The factuality filter consists of a col- document temporal relations (anchoring and order- lection of rules in order to determine whether an ing). It provides a method for selecting the initial event is within the scope of a factuality marker (relevant) temporal relations (namely, all anchoring negating an event or indicating that it is uncertain, in relations) and enhance an updating mechanism of in- which case the event is excluded from the set of el- formation so that additional temporal relations (both igible events. Factuality markers are different types anchoring and ordering relations) can be inferred. of modality and negation cues (adverbs, adjectives, Timelines are first created at a document level and prepositions, modal auxiliaries, pronouns and deter- subsequently merged. The cross-document timeline miners). For instance, if a verb has a dependency model is event-based and aims at building a global relation of type AM-MOD with a modal auxiliary is timeline between all events and temporal expres- excluded from the candidate event in the timeline. sions regardless of the target entities. This approach Coreference relations Two levels of corefer- allows us to also make use of temporal information ence need to be addressed: in-document and cross- provided by events that are not part of the final time- document. As for the former, both versions of the lines. Finally, the target entities for the timelines are system rely on the coreference layer (COREF layer) extracted using two strategies: i) a perfect match be- of the pipeline. Concerning the cross-document tween the target entities and the DBpedia URIs, and level, two strategies have been implemented: ii) the Levenshtein distance (Levenshtein, 1966) be- tween the target entities and the URIs. For this latter • Cross-document entity mentions are identified strategy, an empirical threshold was set to maximize using the URI links associated with entity men- precision on the basis of the trial data. tions; all entity mentions from different doc- uments sharing the same URIs are associated 3 Results and Error Analysis with the same entity instance; • Cross-document event coreference is obtained In Table 1 we report the results of both versions of during a post-processing step of the timeline the system for Track A - Main.
Load more

Recommended publications
  • Intelligent Chat Bot
    INTELLIGENT CHAT BOT A. Mohamed Rasvi, V.V. Sabareesh, V. Suthajebakumari Computer Science and Engineering, Kamaraj College of Engineering and Technology, India ABSTRACT This paper discusses the workflow of intelligent chat bot powered by various artificial intelligence algorithms. The replies for messages in chats are trained against set of predefined questions and chat messages. These trained data sets are stored in database. Relying on one machine-learning algorithm showed inaccurate performance, so this bot is powered by four different machine-learning algorithms to make a decision. The inference engine pre-processes the received message then matches it against the trained datasets based on the AI algorithms. The AIML provides similar way of replying to a message in online chat bots using simple XML based mechanism but the method of employing AI provides accurate replies than the widely used AIML in the Internet. This Intelligent chat bot can be used to provide assistance for individual like answering simple queries to booking a ticket for a trip and also when trained properly this can be used as a replacement for a teacher which teaches a subject or even to teach programming. Keywords : AIML, Artificial Intelligence, Chat bot, Machine-learning, String Matching. I. INTRODUCTION Social networks are attracting masses and gaining huge momentum. They allow instant messaging and sharing features. Guides and technical help desks provide on demand tech support through chat services or voice call. Queries are taken to technical support team from customer to clear their doubts. But this process needs a dedicated support team to answer user‟s query which is a lot of man power.
    [Show full text]
  • An Ensemble Regression Approach for Ocr Error Correction
    AN ENSEMBLE REGRESSION APPROACH FOR OCR ERROR CORRECTION by Jie Mei Submitted in partial fulfillment of the requirements for the degree of Master of Computer Science at Dalhousie University Halifax, Nova Scotia March 2017 © Copyright by Jie Mei, 2017 Table of Contents List of Tables ................................... iv List of Figures .................................. v Abstract ...................................... vi List of Symbols Used .............................. vii Acknowledgements ............................... viii Chapter 1 Introduction .......................... 1 1.1 Problem Statement............................ 1 1.2 Proposed Model .............................. 2 1.3 Contributions ............................... 2 1.4 Outline ................................... 3 Chapter 2 Background ........................... 5 2.1 OCR Procedure .............................. 5 2.2 OCR-Error Characteristics ........................ 6 2.3 Modern Post-Processing Models ..................... 7 Chapter 3 Compositional Correction Frameworks .......... 9 3.1 Noisy Channel ............................... 11 3.1.1 Error Correction Models ..................... 12 3.1.2 Correction Inferences ....................... 13 3.2 Confidence Analysis ............................ 16 3.2.1 Error Correction Models ..................... 16 3.2.2 Correction Inferences ....................... 17 3.3 Framework Comparison ......................... 18 ii Chapter 4 Proposed Model ........................ 21 4.1 Error Detection .............................. 22
    [Show full text]
  • Practice with Python
    CSI4108-01 ARTIFICIAL INTELLIGENCE 1 Word Embedding / Text Processing Practice with Python 2018. 5. 11. Lee, Gyeongbok Practice with Python 2 Contents • Word Embedding – Libraries: gensim, fastText – Embedding alignment (with two languages) • Text/Language Processing – POS Tagging with NLTK/koNLPy – Text similarity (jellyfish) Practice with Python 3 Gensim • Open-source vector space modeling and topic modeling toolkit implemented in Python – designed to handle large text collections, using data streaming and efficient incremental algorithms – Usually used to make word vector from corpus • Tutorial is available here: – https://github.com/RaRe-Technologies/gensim/blob/develop/tutorials.md#tutorials – https://rare-technologies.com/word2vec-tutorial/ • Install – pip install gensim Practice with Python 4 Gensim for Word Embedding • Logging • Input Data: list of word’s list – Example: I have a car , I like the cat → – For list of the sentences, you can make this by: Practice with Python 5 Gensim for Word Embedding • If your data is already preprocessed… – One sentence per line, separated by whitespace → LineSentence (just load the file) – Try with this: • http://an.yonsei.ac.kr/corpus/example_corpus.txt From https://radimrehurek.com/gensim/models/word2vec.html Practice with Python 6 Gensim for Word Embedding • If the input is in multiple files or file size is large: – Use custom iterator and yield From https://rare-technologies.com/word2vec-tutorial/ Practice with Python 7 Gensim for Word Embedding • gensim.models.Word2Vec Parameters – min_count:
    [Show full text]
  • NLP - Assignment 2
    NLP - Assignment 2 Week 2 December 27th, 2016 1. A 5-gram model is a order Markov Model: (a) Six (b) Five (c) Four (d) Constant Ans : c) Four 2. For the following corpus C1 of 3 sentences, what is the total count of unique bi- grams for which the likelihood will be estimated? Assume we do not perform any pre-processing, and we are using the corpus as given. (i) ice cream tastes better than any other food (ii) ice cream is generally served after the meal (iii) many of us have happy childhood memories linked to ice cream (a) 22 (b) 27 (c) 30 (d) 34 Ans : b) 27 3. Arrange the words \curry, oil and tea" in descending order, based on the frequency of their occurrence in the Google Books n-grams. The Google Books n-gram viewer is available at https://books.google.com/ngrams: (a) tea, oil, curry (c) curry, tea, oil (b) curry, oil, tea (d) oil, tea, curry Ans: d) oil, tea, curry 4. Given a corpus C2, The Maximum Likelihood Estimation (MLE) for the bigram \ice cream" is 0.4 and the count of occurrence of the word \ice" is 310. The likelihood of \ice cream" after applying add-one smoothing is 0:025, for the same corpus C2. What is the vocabulary size of C2: 1 (a) 4390 (b) 4690 (c) 5270 (d) 5550 Ans: b)4690 The Questions from 5 to 10 require you to analyse the data given in the corpus C3, using a programming language of your choice.
    [Show full text]
  • 3 Dictionaries and Tolerant Retrieval
    Online edition (c)2009 Cambridge UP DRAFT! © April 1, 2009 Cambridge University Press. Feedback welcome. 49 Dictionaries and tolerant 3 retrieval In Chapters 1 and 2 we developed the ideas underlying inverted indexes for handling Boolean and proximity queries. Here, we develop techniques that are robust to typographical errors in the query, as well as alternative spellings. In Section 3.1 we develop data structures that help the search for terms in the vocabulary in an inverted index. In Section 3.2 we study WILDCARD QUERY the idea of a wildcard query: a query such as *a*e*i*o*u*, which seeks doc- uments containing any term that includes all the five vowels in sequence. The * symbol indicates any (possibly empty) string of characters. Users pose such queries to a search engine when they are uncertain about how to spell a query term, or seek documents containing variants of a query term; for in- stance, the query automat* would seek documents containing any of the terms automatic, automation and automated. We then turn to other forms of imprecisely posed queries, focusing on spelling errors in Section 3.3. Users make spelling errors either by accident, or because the term they are searching for (e.g., Herman) has no unambiguous spelling in the collection. We detail a number of techniques for correcting spelling errors in queries, one term at a time as well as for an entire string of query terms. Finally, in Section 3.4 we study a method for seeking vo- cabulary terms that are phonetically close to the query term(s).
    [Show full text]
  • Use of Word Embedding to Generate Similar Words and Misspellings for Training Purpose in Chatbot Development
    USE OF WORD EMBEDDING TO GENERATE SIMILAR WORDS AND MISSPELLINGS FOR TRAINING PURPOSE IN CHATBOT DEVELOPMENT by SANJAY THAPA THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science at The University of Texas at Arlington December, 2019 Arlington, Texas Supervising Committee: Deokgun Park, Supervising Professor Manfred Huber Vassilis Athitsos Copyright © by Sanjay Thapa 2019 ACKNOWLEDGEMENTS I would like to thank Dr. Deokgun Park for allowing me to work and conduct the research in the Human Data Interaction (HDI) Lab in the College of Engineering at the University of Texas at Arlington. Dr. Park's guidance on the procedure to solve problems using different approaches has helped me to grow personally and intellectually. I am also very thankful to Dr. Manfred Huber and Dr. Vassilis Athitsos for their constant guidance and support in my research. I would like to thank all the members of the HDI Lab for their generosity and company during my time in the lab. I also would like to thank Peace Ossom Williamson, the director of Research Data Services at the library of the University of Texas at Arlington (UTA) for giving me the opportunity to work as a Graduate Research Assistant (GRA) in the dataCAVE. i DEDICATION I would like to dedicate my thesis especially to my mom and dad who have always been very supportive of me with my educational and personal endeavors. Furthermore, my sister and my brother played an indispensable role to provide emotional and other supports during my graduate school and research. ii LIST OF ILLUSTRATIONS Fig: 2.3: Rasa Architecture ……………………………………………………………….7 Fig 2.4: Chatbot Conversation without misspelling and with misspelling error.
    [Show full text]
  • Feature Combination for Measuring Sentence Similarity
    FEATURE COMBINATION FOR MEASURING SENTENCE SIMILARITY Ehsan Shareghi Nojehdeh A thesis in The Department of Computer Science and Software Engineering Presented in Partial Fulfillment of the Requirements For the Degree of Master of Computer Science Concordia University Montreal,´ Quebec,´ Canada April 2013 c Ehsan Shareghi Nojehdeh, 2013 Concordia University School of Graduate Studies This is to certify that the thesis prepared By: Ehsan Shareghi Nojehdeh Entitled: Feature Combination for Measuring Sentence Similarity and submitted in partial fulfillment of the requirements for the degree of Master of Computer Science complies with the regulations of this University and meets the accepted standards with respect to originality and quality. Signed by the final examining commitee: Chair Dr. Peter C. Rigby Examiner Dr. Leila Kosseim Examiner Dr. Adam Krzyzak Supervisor Dr. Sabine Bergler Approved Chair of Department or Graduate Program Director 20 Dr. Robin A. L. Drew, Dean Faculty of Engineering and Computer Science Abstract Feature Combination for Measuring Sentence Similarity Ehsan Shareghi Nojehdeh Sentence similarity is one of the core elements of Natural Language Processing (NLP) tasks such as Recognizing Textual Entailment, and Paraphrase Recognition. Over the years, different systems have been proposed to measure similarity between fragments of texts. In this research, we propose a new two phase supervised learning method which uses a combination of lexical features to train a model for predicting similarity between sentences. Each of these features, covers an aspect of the text on implicit or explicit level. The two phase method uses all combinations of the features in the feature space and trains separate models based on each combination.
    [Show full text]
  • The Research of Weighted Community Partition Based on Simhash
    Available online at www.sciencedirect.com Procedia Computer Science 17 ( 2013 ) 797 – 802 Information Technology and Quantitative Management (ITQM2013) The Research of Weighted Community Partition based on SimHash Li Yanga,b,c, **, Sha Yingc, Shan Jixic, Xu Kaic aInstitute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190 bGraduate School of Chinese Academy of Sciences, Beijing, 100049 cNational Engineering Laboratory for Information Security Technologies, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093 Abstract The methods of community partition in nowadays mainly focus on using the topological links, and consider little of the content-based information between users. In the paper we analyze the content similarity between users by the SimHash method, and compute the content-based weight of edges so as to attain a more reasonable community partition. The dataset adopt the real data from twitter for testing, which verify the effectiveness of the proposed method. © 2013 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of the organizers of the 2013 International Conference on Information Technology and Quantitative Management Keywords: Social Network, Community Partition, Content-based Weight, SimHash, Information Entropy; 1. Introduction The important characteristic of social network is the community structure, but the current methods mainly focus on the topological links, the research on the content is very less. The reason is that we can t effectively utilize content-based information from the abundant short text. So in the paper we hope to make full use of content-based information between users based on the topological links, so as to find the more reasonable communities.
    [Show full text]
  • Hybrid Algorithm for Approximate String Matching to Be Used for Information Retrieval Surbhi Arora, Ira Pandey
    International Journal of Scientific & Engineering Research Volume 9, Issue 11, November-2018 396 ISSN 2229-5518 Hybrid Algorithm for Approximate String Matching to be used for Information Retrieval Surbhi Arora, Ira Pandey Abstract— Conventional database searches require the user to hit a complete, correct query denying the possibility that any legitimate typographical variation or spelling error in the query will simply fail the search procedure. An approximate string matching engine, often colloquially referred to as fuzzy keyword search engine, could be a potential solution for all such search breakdowns. A fuzzy matching program can be summarized as the Google's 'Did you mean: ...' or Yahoo's 'Including results for ...'. These programs are entitled to be fuzzy since they don't employ strict checking and hence, confining the results to 0 or 1, i.e. no match or exact match. Rather, are designed to handle the concept of partial truth; be it DNA mapping, record screening, or simply web browsing. With the help of a 0.4 million English words dictionary acting as the underlying data source, thereby qualifying as Big Data, the study involves use of Apache Hadoop's MapReduce programming paradigm to perform approximate string matching. Aim is to design a system prototype to demonstrate the practicality of our solution. Index Terms— Approximate String Matching, Fuzzy, Information Retrieval, Jaro-Winkler, Levenshtein, MapReduce, N-Gram, Edit Distance —————————— —————————— 1 INTRODUCTION UZZY keyword search engine employs approximate Fig. 1. Fuzzy Search results for query string, “noting”. F search matching algorithms for Information Retrieval (IR). Approximate string matching involves spotting all text The fuzzy logic behind approximate string searching can matching the text pattern of given search query but with be described by considering a fuzzy set F over a referential limited number of errors [1].
    [Show full text]
  • Levenshtein Distance Based Information Retrieval Veena G, Jalaja G BNM Institute of Technology, Visvesvaraya Technological University
    International Journal of Scientific & Engineering Research, Volume 6, Issue 5, May-2015 112 ISSN 2229-5518 Levenshtein Distance based Information Retrieval Veena G, Jalaja G BNM Institute of Technology, Visvesvaraya Technological University Abstract— In today’s web based applications information retrieval is gaining popularity. There are many advances in information retrieval such as fuzzy search and proximity ranking. Fuzzy search retrieves relevant results containing words which are similar to query keywords. Even if there are few typographical errors in query keywords the system will retrieve relevant results. A query keyword can have many similar words, the words which are very similar to query keywords will be considered in fuzzy search. Ranking plays an important role in web search; user expects to see relevant documents in first few results. Proximity ranking is arranging search results based on the distance between query keywords. In current research information retrieval system is built to search contents of text files which have the feature of fuzzy search and proximity ranking. Indexing the contents of html or pdf files are performed for fast retrieval of search results. Combination of indexes like inverted index and trie index is used. Fuzzy search is implemented using Levenshtein’s Distance or edit distance concept. Proximity ranking is done using binning concept. Search engine system evaluation is done using average interpolated precision at eleven recall points i.e. at 0, 0.1, 0.2…..0.9, 1.0. Precision Recall graph is plotted to evaluate the system. Index Terms— stemming, stop words, fuzzy search, proximity ranking, dictionary, inverted index, trie index and binning.
    [Show full text]
  • Thesis Submitted in Partial Fulfilment for the Degree of Master of Computing (Advanced) at Research School of Computer Science the Australian National University
    How to tell Real From Fake? Understanding how to classify human-authored and machine-generated text Debashish Chakraborty A thesis submitted in partial fulfilment for the degree of Master of Computing (Advanced) at Research School of Computer Science The Australian National University May 2019 c Debashish Chakraborty 2019 Except where otherwise indicated, this thesis is my own original work. Debashish Chakraborty 30 May 2019 Acknowledgments First, I would like to express my gratitude to Dr Patrik Haslum for his support and guidance throughout the thesis, and for the useful feedback from my late drafts. Thank you to my parents and Sandra for their continuous support and patience. A special thanks to Sandra for reading my very "drafty" drafts. v Abstract Natural Language Generation (NLG) using Generative Adversarial Networks (GANs) has been an active field of research as it alleviates restrictions in conventional Lan- guage Modelling based text generators e.g. Long-Short Term Memory (LSTM) net- works. The adequacy of a GAN-based text generator depends on its capacity to classify human-written (real) and machine-generated (synthetic) text. However, tra- ditional evaluation metrics used by these generators cannot effectively capture clas- sification features in NLG tasks, such as creative writing. We prove this by using an LSTM network to almost perfectly classify sentences generated by a LeakGAN, a state-of-the-art GAN for long text generation. This thesis attempts a rare approach to understand real and synthetic sentences using meaningful and interpretable features of long sentences (with at least 20 words). We analyse novelty and diversity features of real and synthetic sentences, generate by a LeakGAN, using three meaningful text dissimilarity functions: Jaccard Distance (JD), Normalised Levenshtein Distance (NLD) and Word Mover’s Distance (WMD).
    [Show full text]
  • Effective Search Space Reduction for Spell Correction Using Character Neural Embeddings
    Effective search space reduction for spell correction using character neural embeddings Harshit Pande Smart Equipment Solutions Group Samsung Semiconductor India R&D Bengaluru, India [email protected] Abstract of distance computations blows up the time com- plexity, thus hindering real-time spell correction. We present a novel, unsupervised, and dis- For Damerau-Levenshtein distance or similar edit tance measure agnostic method for search distance-based measures, some approaches have space reduction in spell correction using been tried to reduce the time complexity of spell neural character embeddings. The embed- correction. Norvig (2007) does not check against dings are learned by skip-gram word2vec all dictionary words, instead generates all possi- training on sequences generated from dic- ble words till a certain edit distance threshold from tionary words in a phonetic information- the misspelled word. Then each of such generated retentive manner. We report a very high words is checked in the dictionary for existence, performance in terms of both success rates and if it is found in the dictionary, it becomes a and reduction of search space on the Birk- potentially correct spelling. There are two short- beck spelling error corpus. To the best of comings of this approach. First, such search space our knowledge, this is the first application reduction works only for edit distance-based mea- of word2vec to spell correction. sures. Second, this approach too leads to high time complexity when the edit distance threshold is 1 Introduction greater than 2 and the possible characters are large. Spell correction is now a pervasive feature, with Large character set is real for Unicode characters presence in a wide range of applications such used in may Asian languages.
    [Show full text]