Results 41 to 50 of about 272,414 (271)
Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time
, 2018 Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other.
Chakraborty, Diptarka +4 more
core +1 more source
Fifty years of spellchecking [PDF]
, 2010 A short history of spellchecking from the late 1950s to the present day, describing its development through dictionary lookup, affix stripping, correction, confusion sets, and edit distance to the use of gigantic ...
Blair CR +27 more
core +1 more source
Graph Edit Distance or Graph Edit Pseudo-Distance? [PDF]
, 2016 Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes of the involved graphs.
Francesc Serratosa +2 more
openaire +1 more source
Penilaian Kesamaan Entity Relationship Diagram dengan Algoritme Tree Edit Distance
Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 2017 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
Learning Stochastic Tree Edit Distance [PDF]
, 2006 pages 42-53International audienceTrees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured documents.
A. Dempster +7 more
core +2 more sources
Needleman-Wunsch Attention: A Framework for Enhancing DNA Sequence Embedding
IEEE AccessIn 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
Edit Distance: Sketching, Streaming and Document Exchange
, 2016 We show that in the document exchange problem, where Alice holds $x \in \{0,1\}^n$ and Bob holds $y \in \{0,1\}^n$, Alice can send Bob a message of size $O(K(\log^2 K+\log n))$ bits such that Bob can recover $x$ using the message and his input $y$ if the
Belazzougui, Djamal, Zhang, Qin
core +1 more source
CoRRWe define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ>0$, we seek the minimum number of edits to $σ$ such that the Fréchet distance between the edited $σ$ and $π$ is at most $δ$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices,
Emily Fox +3 more
openaire +3 more sources
Efficient top-k string similarity query algorithms
Tongxin xuebao, 2014 Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources
The Reeb Graph Edit Distance is Universal [PDF]
Foundations of Computational Mathematics, 2020 AbstractWe consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it provides an upper bound to ...
Ulrich Bauer +2 more
openaire +5 more sources