DOCSLIB.ORG

Applying SVM with Multiple Linguistic Features for Cross-Level Semantic Similarity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Applying SVM with Multiple Linguistic Features for Cross-Level Semantic Similarity FBK-TR: Applying SVM with Multiple Linguistic Features for Cross-Level Semantic Similarity Ngoc Phuoc An Vo Tommaso Caselli Octavian Popescu Fondazione Bruno Kessler TrentoRISE Fondazione Bruno Kessler University of Trento Trento, Italy Trento, Italy Trento, Italy [email protected] [email protected] [email protected] Abstract word similarity of the resulting pairs" (Mihalcea et al., 2006). In contrast, the third approach uses Recently, the task of measuring seman- machine learning techniques to learn models built tic similarity between given texts has from different lexical, semantic and syntactic fea- drawn much attention from the Natural tures and then give predictions on degree of simi- Language Processing community. Espe- larity between given texts (Šaric´ et al., 2012). cially, the task becomes more interesting when it comes to measuring the seman- At SemEval 2014, the Task 3 "Cross-Level Se- tic similarity between different-sized texts, mantic Similarity" (Jurgens et al., 2014) is to eval- e.g paragraph-sentence, sentence-phrase, uate the semantic similarity across different sizes phrase-word, etc. In this paper, we, the of texts, in particular, a larger-sized text is com- FBK-TR team, describe our system par- pared to a smaller-sized one. The task consists ticipating in Task 3 "Cross-Level Seman- of four types of semantic similarity comparison: tic Similarity", at SemEval 2014. We also paragraph to sentence, sentence to phrase, phrase report the results obtained by our system, to word, and word to sense. The degree of similar- compared to the baseline and other partic- ity ranges from 0 (different meanings) to 4 (simi- ipating systems in this task. lar meanings). For evaluation, systems were eval- 1 Introduction uated, first, within comparison type and second, across all comparison types. Two methods are Measuring semantic text similarity has become a used to evaluate between system outputs and gold hot trend in NLP as it can be applied to other standard (human annotation), which are Pearson tasks, e.g. Information Retrieval, Paraphrasing, correlation and Spearman’s rank correlation (rho). Machine Translation Evaluation, Text Summariza- tion, Question and Answering, and others. Several The FBK-TR team participated in this task with approaches proposed to measure the semantic sim- three different runs. In this paper, we present a ilarity between given texts. The first approach is clear and comprehensive description of our sys- based on vector space models (VSMs) (Meadow, tem which obtained competitive results. Our main 1992). A VSM transforms given texts into "bag- approach is using machine learning technique to of-words" and presents them as vectors. Then, it learn models from different lexical and semantic deploys different distance metrics to compute the features from train corpora to make prediction on closeness between vectors, which will return as the test corpora. We used support vector machine the distance or similarity between given texts. The (SVM) regression model to solve the task. next well-known approach is using text-alignment. By assuming that two given texts are semantically The remainder of the paper is organized as fol- similar, they could be aligned on word or phrase lows. Section 2 presents the system overview. levels. The alignment quality can serve as a simi- Sections 3, 4 and 5 describe the Semantic Word larity measure. "It typically pairs words from the Similarity, String Similarity and other features, re- two texts by maximizing the summation of the spectively. Section 6 discusses about SVM ap- This work is licensed under a Creative Commons At- proach. Section 7 presents the experiment settings tribution 4.0 International Licence. Page numbers and pro- ceedings footer are added by the organisers. Licence details: for each subtask. Finally, Sections 8 and 9 present http://creativecommons.org/licenses/by/4.0/ the evaluation and conclusion. 284 Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014), pages 284–288, Dublin, Ireland, August 23-24, 2014. each expressing a distinct concept) to provide short, general definitions, and record the vari- ous semantic relations between synsets. We used Perdersen’s package WordNet:Similarity (Peder- sen et al., 2004) to obtain similarity scores for the lexical items covered in WordNet. Similarity scores have been computed by means of the Lin measure (Lin, 1998). The Lin measure is built on Resnik’s measure of similarity (Resnik, 1995): 2 IC(LCS) Simlin = ∗ (1) IC(concept1) + IC(concept2) where IC(LCS) is the information content (IC) of the least common subsumer (LCS) of two con- Figure 1: System Overview. cepts. To overcome the limit in coverage of WordNet, we applied the Levenshtein distance (Levenshtein, 2 System Overview 1966). The distance between two words is defined Our system was built on different linguistic fea- by the minimum number of operations (insertions, tures as shown in Figure 1. By constructing a deletions and substitutions) needed to transform pipeline system, each linguistic feature can be one word into the other. used independently or together with others to mea- 3.3 Wikipedia Relatedness sure the semantic similarity of given texts as well as to evaluate the significance of each feature to Wikipedia Miner (Milne and Witten, 2013) is a the accuracy of system’s predictions. On top of Java-based package developed for extracting se- this, the system is expandable and scalable for mantic information from Wikipedia. Through our adopting more useful features aiming for improv- experiments, we observed that Wikipedia related- ing the accuracy. ness plays an important role for providing extra information to measure the semantic similarity be- 3 Semantic Word Similarity Measures tween words. We used the package Wikipedia Miner from University of Waikato (New Zealand) At the lexical level, we built a simple, yet effec- to extract additional relatedness scores between tive Semantic Word Similarity model consisting of words. three components: WordNet similarity, Wikipedia relatedness and Latent Semantic Analysis (LSA). 3.4 Latent Semantic Analysis (LSA) These components played important and compli- We also took advantage from corpus-based ap- mentary roles to each other. proaches to measure the semantic similarity be- tween words by using Latent Semantic Analysis 3.1 Data Processing (LSA) technique (Landauer et al., 1998). LSA as- We used the TreeTagger tool (Schmid, 1994) to sumes that similar and/or related words in terms extract Part-of-Speech (POS) from each given of meaning will occur in similar text contexts. In text, then tokenize and lemmatize it. On the basis general, a LSA matrix is built from a large cor- of the POS tags, we only picked lemmas of con- pus. Rows in the matrix represent unique words tent words (Nouns and Verbs) from the given texts and columns represent paragraphs or documents. and then paired them up regarding to similar POS The content of the matrix corresponds to the word tags. count per paragraph/document. Matrix size is then reduced by means of Single Value Decomposition 3.2 WordNet Similarity and Levenshtein (SVD) technique. Once the matrix has been ob- Distance tained, similarity and/or relatedness between the WordNet (Fellbaum, 1999) is a lexical database words is computed by means of cosine values for the English language in which words are (scaled between 0 and 1) for each word vector grouped into sets of synonyms (namely synsets, in the matrix. Values close to 1 are assumed to 285 be very similar/related, otherwise dissimilar. We maximum 500 topics (20, 50, 100, 150, 200, 250, trained our LSA model on the British National 300, 350, 400, 450 and 500). From the proportion Corpus (BNC) 1 and Wikipedia 2 corpora. vectors (distribution of documents over topics) of given texts, we applied three different measures to 4 String Similarity Measures compute the distance between each pair of texts, The Longest Common Substring (LCS) is the which are Cosine similarity, Kullback-Leibler and longest string in common between two or more Jensen-Shannon divergences (Gella et al., 2013). strings. Two given texts are considered similar if they are overlapping/covering each other (e.g sen- 5.2 Named-Entity Recognition (NER) tence 1 covers a part of sentence 2, or otherwise). NER aims at identifying and classifying entities We implemented a simple algorithm to extract the in a text with respect to a predefined set of cate- LCS between two given texts. Then we divided the gories such as person names, organizations, loca- LCS length by the product of normalized lengths tions, time expressions, quantities, monetary val- of two given texts and used it as a feature. ues, percentages, etc. By exploring the training set, we observed that there are lot of texts in this 4.1 Analysis Before and After LCS task containing named entities. We deployed the After extracting the LCS between two given texts, Stanford Named Entity Recognizer tool (Finkel et we also considered the similarity for the parts be- al., 2005) to extract the similar and overlapping fore and after the LCS. The similarity between the named entities between two given texts. Then we text portions before and after the LSC has been ob- divided the number of similar/overlapping named tained by means of the Lin measure and the Lev- entities by the sum length of two given texts. enshtein distance. 6 Support Vector Machines (SVMs) 5 Other Features Support vector machine (SVM) (Cortes and Vap- To take into account other levels of analysis for se- nik, 1995) is a type of supervised learning ap- mantic similarity between texts, we extended our proaches. We used the LibSVM package (Chang features by means of topic modeling and Named and Lin, 2011) to learn models from the different Entities. linguistic features described above. However, in 5.1 Topic Modeling (Latent Dirichlet SVM the problem of finding optimal kernel pa- Allocation - LDA) rameters is critical and important for the learning process.
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]