We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned version of the approximate Boyer– Moore algorithm utilizing the Four-Russians technique. Our experiments show that the alphabet reduction makes the algorithm faster. Especially in the k-mismatch case, the new variation is faster tha...

In this paper we address the problem of fuzzy search over encrypted data that supports misspelled search terms. We advance prior work by using a bit vector for bigrams directly instead of hashing bigrams into a Bloom filter. We show that we improve both index building performance as well as retrieval ratio of matching documents while providing the same security guarantees. We also compare fuzzy...

Comparison to traditionally accurate computing, approximate computing focuses on the rapidity of the satisfactory solution, but not the unnecessary accuracy of the solution. Approximate bisimularity is the approximate one corresponding to traditionally accurate bisimilarity. Based on the work of distances between basic processes, we propose an algebraic approach for distances between processes ...

This study investigated the complexity of the electromyography (EMG) of lower limb muscles when performing obstacle crossing tasks at different heights in poststroke subjects versus healthy controls. Five poststroke subjects and eight healthy controls were recruited to perform different obstacle crossing tasks at various heights (randomly set at 10, 20, and 30% of the leg's length). EMG signals...

The paper presents a novel approach to exploring similarities in music performances. Based on simple measurements of timing and intensity in 12 recordings of a Schubert piano piece, short ‘performance archetypes’ are calculated using a SOM algorithm and labelled with letters. Approximate string matching done by an evolutionary algorithm is applied to find similarities in the performances repres...

Until now infrequent terms have been neglected in searching in order to save time and memory. With the help of a cascaded index and the introduced algorithms, such considerations are no longer necessary. A fast and efficient method was developed in order to find all terms in the largest freely available corpus of texts in the German language by exact search, part-word-search and fuzzy search. T...

 We study the notion of bounded approximate Connes-amenability for‎ ‎dual Banach algebras and characterize this type of algebras in terms‎ ‎of approximate diagonals‎. ‎We show that bounded approximate‎ ‎Connes-amenability of dual Banach algebras forces them to be unital‎. ‎For a separable dual Banach algebra‎, ‎we prove that bounded‎ ‎approximate Connes-amenability implies sequential approximat...

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...