Using fuzzy string matching for automated assessment of listener transcripts in speech intelligibility studies. [PDF]
Behav Res Methods, 2021 Many studies of speech perception assess the intelligibility of spoken sentence stimuli by means of transcription tasks (‘type out what you hear’). The intelligibility of a given stimulus is then often expressed in terms of percentage of words correctly ...
Bosker HR.
europepmc +2 more sources
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations. [PDF]
PLoS One, 2017 Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k ...
Ho T, Oh SR, Kim H.
europepmc +2 more sources
A Pipelined Non-Deterministic Finite Automaton-Based String Matching Scheme Using Merged State Transitions in an FPGA. [PDF]
PLoS One, 2016 This paper proposes a pipelined non-deterministic finite automaton (NFA)-based string matching scheme using field programmable gate array (FPGA) implementation.
Kim H, Choi KI.
europepmc +2 more sources
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
IEEE Access, 2019 String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing.
Saqib Håkak +2 more
exaly +2 more sources
Fast algorithms for approximate circular string matching. [PDF]
Algorithms Mol Biol, 2014 Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n.
Barton C, Iliopoulos CS, Pissis SP.
europepmc +2 more sources
A memory-efficient deterministic finite automaton-based bit-split string matching scheme using pattern uniqueness in deep packet inspection. [PDF]
PLoS One, 2015 This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string
Kim H, Choi KI, Choi SI.
europepmc +2 more sources
GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis [PDF]
Micro, 2020 Genome sequence analysis has enabled significant advancements in medical and scientific areas such as personalized medicine, outbreak tracing, and the understanding of evolution.
Damla Senol Cali +15 more
semanticscholar +1 more source
On the Complexity of String Matching for Graphs
International Colloquium on Automata, Languages and Programming, 2023 Exact string matching in labeled graphs is the problem of searching paths of a graph G=(V, E) such that the concatenation of their node labels is equal to a given pattern string P[1.m].
Massimo Equi +3 more
semanticscholar +1 more source
A quantum algorithm for string matching
npj Quantum Information, 2021 Algorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of ...
Pradeep Niroula, Y. Nam
semanticscholar +1 more source