Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 63 for “"Levenshtein"”.
-
The Systematic Design and Application of Robust DNA Barcodes
… codes are Hamming codes and codes based on the Levenshtein distance. Levenshtein-based codes operate only on words of known length. Since a DNA sequence with an embedded barcode is essentially one continuous long word, application of the classical Levenshtein algorithm is problematic. In this …
-
Arquiteturas em hardware para o alinhamento local de sequências biológicas
… de sequências Smith- Waterman e distância Levenshtein demonstraram ser computacionalmente intensivas e, portanto, propícias para aceleração em hardware. Este trabalho descreve arquiteturas em hardware dedicado prototipadas para FPGA e ASIC para acelerar os algoritmos Smith- Waterman e …
-
Java exception matching in real time using fuzzy logic
… matching algorithms where examined including "Levenshtein", "Damerau-Levenshtein", "Needleman-Wunch", "Jaro-Winkler", "Bitap", "Boyer-Moore" and in some degree "Ukkonen". In the end, a modified version of the original Levenshtein algorithm - utilizing lazy evaluation and thresholding - was …
-
Character recognition using string matching
… procedure for classification is the well known Levenshtein distance or weighted Levenshtein distance (Wanger 1974; Hall and Dowling 1980), the cost of a transformation is specially estimated, and typical elements of the sample set are chosen and a well known statistical decision--nearest …
-
Estructura y esquemas de búsqueda por similitud de cadenas de caracteres. Una aplicación para peticiones complejas de localización de palabras en archivos documentales
… de similitud es en el sentido de la distancia de Levenshtein, Dl. El objetivo que se persigue es la optimización de los recursos de tiempo y espacio de los esquemas de búsqueda y de la estructura de datos que los soporta.
-
Decoding of non-binary multiple insertion/deletion error correcting codes
… errors have been investigated. Levenshtein codes are the foundation of this thesis. His codes, first constructed by Varshamov-Tenengol’ts, are capable of correcting one insertion/deletion error. Helberg codes are based on Levenshtein codes and are able to correct multiple …
-
The Automatic Grouping of Sensor Data Layers Using Semantic Clustering and Classification to Group Semantically Similar Sensor Data Layers
… Approximate string matching techniques include Levenshtein Distance, a Length Adjusted Levenshtein Dissimilarity, Jaro Dissimilarity, JaroWinkler Dissimilarity, Jaccard Dissimilarity, and Cosine Dissimilarity. For semantic string matching, we use WordNet as a lexical database to compute word …
-
An Empirical Study on the Trade-off of Diversity Types and Measures on Test Visualisation
… different diversity measures (e.g., Jaccard, Levenshtein, NCD) and types of test artefacts (e.g., input, output), ii) what are the visual and structural differences on the clusters after using different dimensionality reduction techniques (e.g., MDS, t-SNE, UMAP) and iii) to what extent do …
-
Using Recurrent Neural Networks to Code Interviewer Question-Asking Behaviors: A Proof of Concept
… transcripts using two string-based methods: 1) Levenshtein distance (i.e., the number of characters in the question-asking transcript that need to be changed to match the questionnaire text exactly); and 2) exact string matching (i.e., whether the question-asking transcript matches the …
-
A. Mickevičiaus epinės poemos "Ponas Tadas" analizė taikant natūralios kalbos apdorojimą /
… analysis of word similarity was done by applying Levenshtein and Hamming distances, data were clustered by semantic relationships between words. Data were clustered with the help of K-means clustering. Similar words were found by setting an upper limit of the distance between words that can be …
-
Design and implementation of two text recognition algorithms
… to stable states. Another approach is to use the Levenshtein algorithm for string matching following the application of rules to recognise a given character. Both these methods are discussed and the results are presented.</p>
-
Improving the interpretation of metabolic pathfinding results with clustering and compound hubs
… along with three pair-wise distance measures (Levenshtein, Jaccard, and n-gram) were used to group lysine, isoleucine, and 3-hydroxypropanoic acid (3-HP) biosynthesis pathways produced by a recent metabolic finding algorithm. The quality of the resulting clusters were quantitatively evaluated …
-
Edukacinio turinio konstravimas naudojant dirbtinį intelektą /
… evaluated using two GPT‑4o and Gemini models and Levenshtein distance. The RNN model showed the best results. The real‑world performance of the GPT‑4o and Gemini models was tested using self‑developed datasets: one with handwritten tasks, the other with tasks written in a virtual environment.
-
Modelling Human Behaviour Based on Similarity Measurements Between Event Sequences
… the existing sequence comparison method, Damerau-levenshtein distance, this work develops a pipeline of steps that can be used to transform the metadata and integrate this weighted format into the sequence comparison calculation. In this pipeline, one of the most significant transformations that …
-
Construction of I-Deletion-Correcting Ternary Codes
… the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary one-deletion correcting codes in 1992. Tenegolts constructed T codes to handle the non-binary cases. However the T codes are neither optimal nor perfect, which means some progress …
-
Sign language word list comparisons: Toward a replicable coding and scoring methodology
… items. Similarities are calculated using the Levenshtein distance metric which measures the number of differences between signs. In this study, the methodology was refined for optimal efficiency through an analysis of: which parameters of a sign should be compared, which values should be …
-
Kintamo ilgio kodai /
… variable-length codes such as: Elias delta and Levenshtein as well as we are comparing every four of the codes with each other based on some criteria and possibilities of file compression using different coding algorithms with different variable-length codes. We have made comparisons of all …
-
Construction of few-angular spherical codes and line systems in Euclidean spaces
… systems which achieve equality in the second Levenshtein bound from irreducible representations of finite groups SL(2,q). We also construct several low-dimensional spherical codes with prescribed automorphisms and large minimum angular distances between the vectors and obtain new lower bounds …
-
Approximate pattern matching and its applications.
… matching problems. Our study is based on the Levenshtein distance model, where errors considered are 'insertions', 'deletions', and 'substitutions'. In general, given a text string, a pattern, and an integer k, we want to find substrings in the text that match the pattern with no more than k …
-
MENTAL WORKLOAD AND PERFORMANCE DYNAMICS UNDERLYING HIERARCHICAL PLANNING PROCESSES DURING COMPLEX ACTION SEQUENCE EXECUTION UNDER VARIOUS DEMANDS
… task completion time and sequence structure (Levenshtein distance). Regional EEG power activity along with functional connectivity between the dlPFC, PMC, and SMC were used to evaluate cortical effort and cortico-cortical communication in the theta, low-alpha, and high-alpha bands. …
Page 1 of 4