Spontaneous speech produced in sober and intoxicated conditions has been compared in information theoretic terms on the phoneme and word level to examine phonological and lexical aspects of intoxication. Word level entropy has been calculated to capture roughly the effect of alcohol on cognitive lexical creativity. Phoneme level entropy is intended to reflect heavy tongue influences on phoneme ...

This article presents a new method for analyzing Automatic Speech Recognition (ASR) results at the phonological feature level. To this end the Levenshtein distance algorithm is refined in order to take into account the distinctive features opposing substituted phonemes. This method allows to survey features additions or deletions, providing microscopic qualitative information as a complement to...

Edit distance metrics are widely used for many applications such as string comparison and spelling error corrections. Hamming distance is a metric for two equal length strings and Damerau-Levenshtein distance is a well-known metrics for making spelling corrections through string-to-string comparison. Previous distance metrics seems to be appropriate for alphabetic languages like English and Eur...

This paper proposes a method of ranking XML documents with respect to an Information Retrieval query by means of fuzzy logic. The proposed method allows imprecise queries to be evaluated against an XML document collection and it provides a model of ranking XML documents. In addition the proposed method enables sophisticated ranking of documents by employing proximity measures and the concept of...

We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and...

We address the problem of approximate pattern matching using the Levenshtein distance. Given a text T and a pattern P , find all locations in T that differ by at most k errors from P . For that purpose, we propose a filtration algorithm that is based on a novel type of seeds, combining exact parts and parts with a fixed number of errors. Experimental tests show that the method is specifically w...

The number of correctable/uncorrectable errors of weight half the minimum distance plus one for the first-order Reed-Muller codes is determined. From a cryptographic viewpoint, this result immediately leads to the exact number of Boolean functions of m variables with nonlinearity 2m−2 + 1. The notion of larger half and trial set , which is introduced by Helleseth, Kløve, and Levenshtein to desc...

A new recursive universal code of the positive integers is proposed, in which any given sequence can be used as a delimiter of codeword while bit “0” is used as a delimiter in known universal codes, e.g., Levenshtein code, Elias code, Even–Rodeh code, Stout code, Bentley–Yao code, etc. The codeword length of the proposed code is shorter than log in almost all of sufficiently large positive inte...

The three West-Germanic languages Dutch, Frisian and Afrikaans are so closely related that they can be expected to be mutually intelligible to a large extent. In the present investigation, we established the intelligibility of written Afrikaans and Frisian by Dutch-speaking subjects. It appeared that it is easier for speakers of Dutch to understand Afrikaans than Frisian. In order to explain th...

Finding large numbers of target items for phonetic and phonological experiments can be a time-consuming and error-prone task. Using freely available tools and data, we have generated a bilingual corpus with the specific aim of investigating the processing and perception of stress in second-language (L2) words. Normalized Levenshtein distances between orthographic and phonemic transcriptions of ...