With the amount of data available on social networks, new methodologies for the analysis of information are needed. Some methods allow the users to combine different types of data in order to extract relevant information. In this context, the present paper shows the application of a model via a platform in order to group together information generated by Twitter users, thus facilitating the det...

Being able to automatically correct spelling errors is useful in cases where the set of documents is too vast to involve human interaction. In this bachelor's thesis, we investigate an implementation that attempts to perform such corrections using a lexicon and edit distance measure. We compare the familiar Levenshtein and Damerau-Levenshtein distances to modi cations where each edit operation ...

The current study focuses on optimization of Levenshtein algorithm for the purpose of computing the optimal alignment between two phoneme transcriptions of spoken utterance containing sequences of phonetic symbols. The alignment is computed with the help of a confusion matrix in which costs for phonetic symbol deletion, insertion and substitution are defined taking into account various phonolog...

Many important functions over strings can be represented as finite-state string transducers. In this paper, we present an automatatheoretic technique for algorithmically verifying that such a function is robust to uncertainty. A function encoded as a transducer is defined to be robust if for each small (i.e., bounded) change to any input string, the change in the transducer’s output is proporti...

Research on the mutual intelligibility of closely related Germanic languages has shown that several linguistic and extra-linguistic factors determine intelligibility scores to a high degree. In this paper, we aim to pinpoint the precise role of the determinant phonetic distance. As for example Gooskens (2007) shows, aggregate Levenshtein distances turn out to be good predictors of the intelligi...

This paper proposes SCHEMA, an algorithm for automated mapping between heterogeneous product taxonomies in the e-commerce domain. SCHEMA utilises word sense disambiguation techniques, based on the ideas from the algorithm proposed by Lesk, in combination with the semantic lexicon WordNet. For finding candidate map categories and determining the path-similarity we propose a node matching functio...

Language variations are generally known to have a severe impact on the performance of Human Language Technology Systems. In order to predict or improve system performance, a thorough investigation into these variations, similarities and dissimilarities, is required. Distance measures have been used in several applications of speech processing to analyze different varying speech attributes. Howe...

We aim to speed up approximate keyword matching by storing a lightweight, fixed-size block of data for each string, called a fingerprint. These work in a similar way to hash values; however, they can be also used for matching with errors. They store information regarding symbol occurrences using individual bits, and they can be compared against each other with a constant number of bitwise opera...

The present study has examined the similarity and the mutual intelligibility between Amharic and two Tigrigna varities using three tools; namely Levenshtein distance, intelligibility test and questionnaires. The study has shown that both Tigrigna varieties have almost equal phonetic and lexical distances from Amharic. The study also indicated that Amharic speakers understand less than 50% of th...

Bu çalışmanın temel amacı İran’da konuşulan ve yok olma tehlikesi altında bulunan Halaç Türkçesi ağızlarını niceliksel ağız ölçüm tekniklerinden Levenshtein Uzaklık Algoritması (LUA) temelinde incelemektir. Bilgisayar programlamasında sıklıkla kullanılan bir algoritma olan LUA olarak ikili kodların (binary codes) silme, ekleme tersinim ile birbirlerine uzaklığının saptanabilmesi için geliştiril...