EnFilter is a Proactive Password Checking System, designed to avoid password guessing attacks. It is made of a set of configurable filters, each one based on a specific pattern recognition measure that can be tuned by the system administrator depending on the adopted password policy. Filters use decision trees, lexical analysers, as well as Levenshtein distance based techniques. EnFilter is imp...

We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.

Saat ini, banyak orang tidak bisa hidup tanpa musik. Musik merupakan bagian yang sangat berguna bagi kehidupan manusia untuk bersantai, menghilangkan stres, ataupun mengubah suasana hati. mudah ditemukan di website saat ini. Namun orang-orang menyukai musik terkadang lupa atau salah paham dengan judul lagu sering didengarkan dan dinyanyikan khususnya melayu berbagai website. Sehingga membuat ke...

Phonological distance can be measured computationally using formally specified algorithms. This work investigates two such measures, one developed by Nerbonne and Heeringa (1997) based on Levenshtein distance (Levenshtein, 1965) and the other an adaptation of Dunning’s (1994) language classifier that uses maximum likelihood distance. These two measures are compared against näıve transcriptions ...

In the world of education today really need a search engine that makes it easier for students to information related book data. One them is in library SMP N 2 SOOKO, process finding number and stock books at SOOKO can take lot money time because needs be recorded manually. With this web-based system, save costs carried out using computer. This study aims create data system searching as well arc...

Group testing algorithms are very useful tools for DNA library screening. Building on recent work by Levenshtein (2003) and Tonchev (2008), we construct in this paper new infinite classes of combinatorial structures, the existence of which are essential for attaining the minimum number of individual tests at the second stage of a two-stage disjunctive testing algorithm.

Hiermit versichere ich, daß ich die Arbeit selbständig verfaßt und keine anderen als die angegebenen Quellen und Hilfsmittel benutzt, sowie Zitate kenntlich gemacht habe. Zufälliger Cluster aus der Transkription der deutschen Wettervorhersage. Die 10 Sätze haben den geringsten Levenshtein-Abstand zur¨Uberschrift.

In this article, an automated system is proposed for essay scoring in Arabic language for online exams based on stemming techniques and Levenshtein edit operations. An online exam has been developed on the proposed mechanisms, exploiting the capabilities of light and heavy stemming. The implemented online grading system has shown to be an efficient tool for automated scoring of essay questions.

We extend the de nition of Hamming and Levenshtein distance between two strings used in approximate string matching so that these two distances can be used also in approximate regular expression matching. Next, the methods of construction of nondeterministic nite automata for approximate regular expression matching considering both mentioned distances are presented.