Tag #edit distance
46 papers:
PADL-2020-ChanC #distance #flexibility #graph #programming #set #using- Flexible Graph Matching and Graph Edit Distance Using Answer Set Programming (SCC, JC), pp. 20–36.
DLT-2019-GeffertBS #automaton #distance- Input-Driven Pushdown Automata for Edit Distance Neighborhood (VG, ZB, AS), pp. 113–126.
ICML-2018-PaassenGMH #adaptation #distance #learning- Tree Edit Distance Learning via Adaptive Symbol Embeddings (BP, CG, AM, BH), pp. 3973–3982.
ICPR-2018-BlumenthalDBBG #distance #graph #polynomial #problem- Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem (DBB, ÉD, SB, LB, JG), pp. 934–939.
- ICPR-2018-PucherK #distance #segmentation
- Segmentation Edit Distance (DP, WGK), pp. 1175–1180.
- ICPR-2018-SantacruzS #distance #generative #graph #testing
- Graph Edit Distance Testing through Synthetic Graphs Generation (PS, FS), pp. 572–577.
CIAA-2016-Calvo-ZaragozaH #distance #string- Computing the Expected Edit Distance from a String to a PFA (JCZ, CdlH, JO), pp. 39–50.
- ICPR-2016-BougleuxGB #distance #graph #polynomial
- Graph edit distance as a quadratic program (SB, BG, LB), pp. 1701–1706.
ICALP-v2-2015-ChatterjeeHIO #automaton #distance- Edit Distance for Pushdown Automata (KC, TAH, RIJ, JO), pp. 121–133.
MLDM-2015-FerrerSR #approximate #distance #graph #heuristic #learning- Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation (MF, FS, KR), pp. 17–31.
- MLDM-2015-RiesenFDB #distance #graph
- Greedy Graph Edit Distance (KR, MF, RD, HB), pp. 3–16.
STOC-2015-BackursI #distance- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) (AB, PI), pp. 51–58.
CHI-2014-ZadeAGDC #bisimulation #distance #evolution #modelling- Edit distance modulo bisimulation: a quantitative measure to study evolution of user models (HZ, SAA, SG, AKD, VC), pp. 1757–1766.
- ICPR-2014-RiesenBF #approximate #distance #graph #metric
- Improving Graph Edit Distance Approximation by Centrality Measures (KR, HB, AF), pp. 3910–3914.
- ICPR-2014-WangEGLLF #approach #distance #documentation #graph #word
- A Coarse-to-Fine Word Spotting Approach for Historical Handwritten Documents Based on Graph Embedding and Graph Edit Distance (PW, VE, CG, CL, JL, AF), pp. 3074–3079.
KDIR-2014-Nguyen0 #distance #similarity- Applying Information-theoretic and Edit Distance Approaches to Flexibly Measure Lexical Similarity (TTAN, SC), pp. 505–511.
SIGMOD-2013-Cohen #distance #using- Indexing for subtree similarity-search using edit distance (SC), pp. 49–60.
ECIR-2013-ChattopadhyayaSS #distance #generative #performance- A Fast Generative Spell Corrector Based on Edit Distance (IC, KS, KS), pp. 404–410.
- ECIR-2013-LaitangPB #distance #information retrieval
- DTD Based Costs for Tree-Edit Distance in Structured Information Retrieval (CL, KPS, MB), pp. 158–170.
- ICPR-2012-RebagliatiSPS #distance #graph #set #using
- Computing the graph edit distance using dominant sets (NR, ASR, MP, FS), pp. 1080–1083.
ICDAR-2011-HassanCG #distance #documentation #image #using- Document Image Indexing Using Edit Distance Based Hashing (EH, SC, MG), pp. 1200–1204.
VLDB-2012-PawlikA11 #algorithm #distance #named #robust- RTED: A Robust Algorithm for the Tree Edit Distance (MP, NA), pp. 334–345.
- SIGMOD-2010-ZhangHOS #distance #named #similarity #string
- Bed-tree: an all-purpose index structure for string similarity search based on edit distance (ZZ, MH, BCO, DS), pp. 915–926.
- ICPR-2010-BardajiFS #distance #graph
- Computing the Barycenter Graph by Means of the Graph Edit Distance (IB, MF, AS), pp. 962–965.
- ICPR-2010-DiezFSS #normalisation
- Normalized Sum-over-Paths Edit Distances (SGD, FF, MS, MS), pp. 1044–1047.
ICMT-2010-VoigtH #distance #graph #metamodelling- Metamodel Matching Based on Planar Graph Edit Distance (KV, TH), pp. 245–259.
- SIGMOD-2009-WangXLZ #approximate #constraints #distance #performance
- Efficient approximate entity extraction with edit distance constraints (WW, CX, XL, CZ), pp. 759–770.
- VLDB-2009-ZengTWFZ #approximate #distance #graph
- Comparing Stars: On Approximating Graph Edit Distance (ZZ, AKHT, JW, JF, LZ), pp. 25–36.
CIKM-2009-DaiZ #constraints #distance #incremental #similarity- Incremental similarity joins with edit distance constraints (DD, GZ), pp. 1449–1452.
- STOC-2009-AndoniO #approximate #distance
- Approximating edit distance in near-linear time (AA, KO), pp. 199–204.
- VLDB-2008-XiaoWL #algorithm #constraints #distance #named #performance #similarity
- Ed-Join: an efficient algorithm for similarity joins with edit distance constraints (CX, WW, XL), pp. 933–944.
- ICALP-A-2008-AndoniK #complexity #distance
- The Smoothed Complexity of Edit Distance (AA, RK), pp. 357–369.
- VLDB-2007-LeeNS #distance #string
- Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance (HL, RTN, KS), pp. 195–206.
- ICALP-2007-DemaineMRW #algorithm #composition #distance
- An Optimal Decomposition Algorithm for Tree Edit Distance (EDD, SM, BR, OW), pp. 146–157.
- ICPR-v3-2006-ChairunnandaGC #distance #sequence #using
- Enhancing Edit Distance on Real Sequences Filters using Histogram Distance on Fixed Reference Ordering (PC, VG, LC), pp. 582–585.
SAC-2006-XingMXV #classification #documentation #xml- Computing edit distances between an XML document and a schema and its application in document classification (GX, CRM, ZX, SDV), pp. 831–835.
- STOC-2005-OstrovskyR #distance
- Low distortion embeddings for edit distance (RO, YR), pp. 218–224.
- VLDB-2004-ChenN #distance #on the
- On The Marriage of Lp-norms and Edit Distance (LC, RTN), pp. 792–803.
- ICPR-v3-2004-NeuhausB #approach #distance #graph #learning #probability
- A Probabilistic Approach to Learning Costs for Graph Edit Distance (MN, HB), pp. 389–393.
PODS-2003-GarofalakisK #correlation #data type #distance #using #xml- Correlating XML data streams using tree-edit distance embeddings (MNG, AK), pp. 143–154.
- STOC-2003-BatuEKMRRS #algorithm #approximate #distance #sublinear
- A sublinear algorithm for weakly approximating edit distance (TB, FE, JK, AM, SR, RR, RS), pp. 316–324.
- ICPR-v4-2002-PerisM #classification #distance #performance
- Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification (GP, AM), pp. 184–187.
- ICPR-v2-2000-JuanV #classification #normalisation #on the #performance #string #using
- On the Use of Normalized Edit Distances and an Efficient k-NN Search Technique (k-AESA) for Fast and Accurate String Classification (AJ, EV), pp. 2676–2679.
- ICPR-v2-2000-MarzalB #distance #string
- Speeding Up the Computation of the Edit Distance for Cyclic Strings (AM, SB), pp. 2891–2894.
- ICPR-1998-MyersWH #distance #performance #relational
- Efficient relational matching with local edit distance (RM, RCW, ERH), pp. 1711–1714.
- ICML-1997-RistadY #distance #learning #string
- Learning String Edit Distance (ESR, PNY), pp. 287–295.
