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 44 for “"Edit distance"”.
-
A Feature-Based Call Graph Distance Measure for Program Similarity Analysis
… a graph problem. Previously, static call graph distance measures have been largely based on graph matching techniques, e.g. graph edit distance or maximum common subgraph, which are known to be costly. We propose a call graph distance measure based on features that preserve some structural …
-
New sublinear methods in the struggle against classical problems
… a more efficient approximation algorithm for edit distance and distributed algorithms for combinatorial problems on graphs that run in a constant number of communication rounds. Combinatorial Graph Optimization Problems: The graph optimization problems considered by us include vertex cover, …
-
Fast Algorithms for Bounded-Range LIS Approximation
… approaches can also be applied to estimating edit distance to monotonicity in 2-dimenstional array and 𝐿₁ edit distance of a sequence within sublinear time using 𝑝𝑜𝑙𝑦(𝑟, 𝜖⁻¹) queries.
-
Temporal Graph Record Linkage and k-Safe Approximate Match
… this multi-data without redundancy and use edit-distance for approximate string matching. However, due to high computational complexity, edit-distance will not scale well with big data problems. We developed two methodologies for resolving the aforementioned issues: PSH and ALIM. PSH – The …
-
Effects of OCR errors on text categorization
… process. This algorithm is based on edit distance techniques and information from highly weighted words in the categorizers.
-
USE OF LANGUAGE TECHNOLOGY TO IMPROVE MATCHING AND RETRIEVAL IN TRANSLATION MEMORY
… did not retrieve better matches than simple edit-distance. Two approaches for retrieving segments from a TM using deep learning are investigated. The first one is based on Long Short Term Memory (LSTM) networks, while the other one is based on Tree Structured Long Short Term Memory …
-
Shakespeare in the Eighteenth Century: Algorithm for Quotation Identification
… to identifying modified quotes by adapting the Edit Distance metric, which is character based, to a word based approach. This paper offers an introduction to previous uses of this metric within a multitude of fields, describes the implementation of the different methodologies used for quote …
-
Dynamic Programming meets Fine-grained Complexity
… a sub-cubic time algorithm for unweighted tree edit distance (TED), the second application is an improved FPTAS (Fully Polynomial-Time Approximation Scheme) for Partition, and the third application is an improved FPTAS for Knapsack.
-
Automated Care Pathway Modeling Using Agentic and Knowledge-Aware LLMs
… similarity (after Dijkman et al.) with graph-edit distance; a clinician provides fidelity ratings with qualitative annotations. We then investigate knowledge-aware modeling via a categorization of recurrent errors and curated clinical statements, testing prompt-only injections versus a …
-
Exploiting syntactic relations for question answering
… manner. Specifically, SMARTQA uses a tree edit-distance algorithm to calculate the similarity between unordered, unrooted syntactic trees. The general case of this problem is NP-complete; in practice, SMARTQA demonstrates that an optimized implementation of the algorithm can be feasibly …
-
Efficient structure search in large data sets
… search problem in string data sets with edit distance similarity, which retrieves all strings in a string data set that are similar to a query string with respect to a given edit distance threshold. We propose a cross pivotal based approach to fully exploiting the pruning power of …
-
Efficient processing of advanced structural queries in graph databases
… threshold. Particularly, we incorporate graph edit distance as similarity measure. Inspired by the q-gram idea for string similarity queries, we introduce path-based q-grams on graphs, and establish a count filtering lower bound for generating candidates. An efficient algorithm is proposed to …
-
Self-supervision strategies for post-ASR error correction in clinical domain.
… introduces self-supervision strategies and an edit distance operations-based noising algorithm to optimise error correction processes based on error distributions. The contributions of this research include the creation of a domain-specific ASR dataset alongside a comprehensive error analysis, …
-
Approximate string matching methods for duplicate detection and clustering tasks
… of resulting sets at a glance. The Shortest Path Edit Distance (SPED) outperformed all evaluated similarity functions and gained the highest possible values of the average precision and maximum F_1 measures on the bioinformatics datasets. The SPED design was inspired by the preceding work on the …
-
A Distance-Based Clustering Framework for Categorical Time Series: A Case Study in Episodes of Care Healthcare Delivery System
… clustering as it accommodates string-based distance measures commonly used by categorical sequences while meeting the expectations of physicians that the method returns an existing pathway as the central point and produces clusters of pathways that are edge-connected. Additionally, the …
-
Rule based learning of word pronunciations from training corpora
… pronunciations are scored using a weighed string edit distance. Optimizations were made to make the learner and the rule applier fast. The system achieves 73.9% exact word accuracy with multiple pronunciations, 82.3% word accuracy with one correct pronunciation, and 95.3% phoneme accuracy for …
-
Tree pattern inference and matching for wrapper induction on the World Wide Web
… To construct patterns, we use the notion of the edit distance between the subtrees represented by these examples to distill them into a more general pattern. This pattern may then be used to retrieve other instances of the selected data from the same page or other similar pages. By linking …
-
Bounds on edit metric codes with combinatorial DNA constraints
… DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and …
-
Efficient Similarity Search in Structured Data
… adaption of the measure. Consequently, the edit distance, well-known from string processing, is a common similarity measure for graph structured objects. Its feature to allow a visualization of corresponding substructures and the possibility to weight single operations are the reason for …
-
Below P vs NP : fine-grained hardness for big data problems
… and machine learning tasks: ** Lower bounds for edit distance, regular expression matching and other pattern matching and string processing problems. ** Lower bounds for empirical risk minimization such as kernel support vectors machines and other kernel machine learning problems. All of these …
Page 1 of 3