Results 41 to 50 of about 1,791,230 (278)
Fast suboptimal algorithms for the computation of graph edit distance [PDF]
Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of ...
Michel Neuhaus +5 more
core +1 more source
Discovering Lexical Similarity Using Articulatory Feature-Based Phonetic Edit Distance
Lexical Similarity (LS) between two languages uncovers many interesting linguistic insights such as phylogenetic relationship, mutual intelligibility, common etymology, and loan words. There are various methods through which LS is evaluated.
Tafseer Ahmed +3 more
doaj +1 more source
On the edit distance of powers of cycles
21 pages, 1 ...
Zhanar Berikkyzy +2 more
openaire +4 more sources
Convolutional Embedding for Edit Distance [PDF]
Edit-distance-based string similarity search has many applications such as spell correction, data de-duplication, and sequence alignment. However, computing edit distance is known to have high complexity, which makes string similarity search challenging for large datasets.
Xinyan Dai +5 more
openaire +2 more sources
Japanese medical device adverse events terminology, published by the Japan Federation of Medical Devices Associations (JFMDA terminology), contains entries for 89 terminology items, with each of the terminology entries created independently.
Ayako Yagahara +2 more
doaj +1 more source
Needleman-Wunsch Attention: A Framework for Enhancing DNA Sequence Embedding
In many biological research studies that rely on DNA sequence data, calculating the edit distance between two sequences is a vital component. However, computing the edit distance involves dynamic programming, which can be computationally intensive.
Kyelim Lee, Albert No
doaj +1 more source
Penilaian Kesamaan Entity Relationship Diagram dengan Algoritme Tree Edit Distance
Main competency in database learning is ability to design Entity Relationship Diagram (ERD). Generally, lecturer gives task to students to design an ERD with some requirements. These ERDs are then assessed by comparing them with the answers. In practice,
Humasak Simanjuntak +5 more
doaj +1 more source
The Edit Distance Function and Symmetrization [PDF]
The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, G, and a hereditary property, ℋ, is the minimum of the distance between G and each G'∈ℋ. The edit distance function of ℋ is a function of p∈[0,1] and is the limit of the maximum normalized ...
openaire +3 more sources
Edit distance measure for graphs [PDF]
The edit number \(s(G,F)\) of two graphs \(G,F\) of order \(n\) is the minimum number of edges needed to be added/deleted from the graph \(G\) to obtain a graph isomorphic to \(F\). In this paper, the author provides values and bounds for \(g(n,l)\), the maximum number \(k\) for which there are \(l\) graphs of order \(n\), each two having edit distance
Tomasz Dzido, Krzywdziński, Krzysztof
openaire +2 more sources
We propose the neural string edit distance model for string-pair matching and string transduction based on learnable string edit distance. We modify the original expectation-maximization learned edit distance algorithm into a differentiable loss function, allowing us to integrate it into a neural network providing a contextual representation of the ...
Libovický, Jindřich, Fraser, Alexander
openaire +4 more sources

