Essays about: "Levenshtein edit distance"
Showing result 1 - 5 of 6 essays containing the words Levenshtein edit distance.
-
1. A Rule-Based Normalization System for Greek Noisy User-Generated Text
University essay from Uppsala universitet/Institutionen för lingvistik och filologiAbstract : 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. Therefore, mining user-generated data for commercial, academic, or other purposes has already attracted the interest of the research community. READ MORE
-
2. Spell checker for a Java Application
University essay from Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)Abstract : Many text-editor users depend on spellcheckers to correct their typographical errors. The absence of a spellchecker can create a negative experience for the user. In today's advanced technological environment spellchecking is an expected feature. READ MORE
-
3. Spelling Normalization of English Student Writings
University essay from Uppsala universitet/Institutionen för lingvistik och filologiAbstract : Spelling normalization is the task to normalize non-standard words into standard words in texts, resulting in a decrease in out-of-vocabulary (OOV) words in texts for natural language processing (NLP) tasks such as information retrieval, machine translation, and opinion mining, improving the performance of various NLP applications on normalized texts. In this thesis, we explore different methods for spelling normalization of English student writings including traditional Levenshtein edit distance comparison, phonetic similarity comparison, character-based Statistical Machine Translation (SMT) and character-based Neural Machine Translation (NMT) methods. READ MORE
-
4. Weighting Edit Distance to Improve Spelling Correction in Music Entity Search
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : This master’s thesis project undertook investigation of whether the extant Damerau- Levenshtein edit distance measurement between two strings could be made more useful for detecting and adjusting misspellings in a search query. The idea was to use the knowledge that many users type their queries using the QWERTY keyboard layout, and weighting the edit distance in a manner that makes it cheaper to correct misspellings caused by confusion of nearer keys. READ MORE
-
5. Offline Approximate String Matching forInformation Retrieval : An experiment on technical documentation
University essay from JTH. Forskningsmiljö InformationsteknikAbstract : Approximate string matching consists in identifying strings as similar even ifthere is a number of mismatch between them. This technique is one of thesolutions to reduce the exact matching strictness in data comparison. In manycases it is useful to identify stream variation (e.g. READ MORE