Current speech recognition systems with fixed vocabularies have difficulties recognizing Out-of-Vocabulary words (OOVs) such as proper nouns and new words. This leads to misunderstandings or even failures in dialog systems. Ensuring effective is crucial for the functioning of robot assistants. Non-native accents, vocabulary, aging voices can cause malfunctions a system. If this task not execute...

We study the problem of similarity between phrases. To do so, we study three similarity methods. The first one considers the commonalities and differences of the two phrases. The second one is an extension of the well-known Levenshtein-Damerau distance in a word oriented fashion. The third one considers the sequentiality of the phrases and is resistant to phrases with repeated words. Finally, w...

One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius t with respect to the Levenshtĕın distance may be of different sizes. There is interest, therefore, in determining all possible sizes of a perfect t-deletion-correcting code, given the length n a...

The quality of the data in core electronic registers has constantly decreased as a result numerous errors that were made and inconsistencies these databases due to growing number created with intention providing services for public administration lack harmonization or interoperability between databases.Evaluating improving by matching linking records from multiple sources becomes exceedingly di...

Mixed Integer Programming (MIP) models are known to be sensitive to slight changes. In this study, we measure the perturbation to a production plan that occurs when re-planning is carried-on due to new orders arrival. Perturbation level is measured using well known metrics: (1) the Hamming distance, (2) the edit distance, and (3) the Damerau-Levenshtein distance. We propose three alternative fo...

The study being presented is a continuation of the previous studies that consisted in the adaptation and use of the Levenshtein method in a signature recognition process. Three methods based on the normalized Levenshtein measure were taken into consideration. The studies included an analysis and selection of appropriate signature features, on the basis of which the authenticity of a signature w...

Computational approaches for dialectometry employed Levenshtein distance to compute an aggregate similarity between two dialects belonging to a single language group. In this paper, we apply a sequence-to-sequence autoencoder to learn a deep representation for words that can be used for meaningful comparison across dialects. In contrast to the alignment-based methods, our method does not requir...

We present a new simulation method for the reduced nondeterministic nite automata (NFAs) for the approximate string and sequence matching using the Levenshtein and generalized Levenshtein distances. These reduced NFAs are used in case that we are interested only in all occurrences of a pattern in an input text such that the edit distance between the pattern and the found strings is less or equa...

Micron’s Automata Processor is an innovative reconfigurable hardware accelerator for parallel finite-automatabased regular-expression matching. While the Automata Processor has demonstrated potential for many pattern matching applications, other applications receive reduced benefit from the architecture due to capacity limitations or routing limitations. In this paper, we present an efficient i...

With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein’s bound, and so also Elias’s.