Research map / Label-efficient and robust learning / Recognition and long-tail
Harry: A Tool for Measuring String Similarity
Konrad Rieck, Christian Wressnegger
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| increase number of CPU cores for Levenshtein distance and Subsequence kernel | Harry · ARTS, SPROT, TWEETS, WEBFP | comparisons per second: scale perfectly linear | Improved |
| increase CPU cores beyond 8 for compression distance | Harry · ARTS, SPROT, TWEETS, WEBFP | comparisons per second: almost linear, slight overhead when more than 8 cores are used | Mixed |
Closest papers by meaning
- StringLLM: Understanding the String Processing Capability of Large Language Models (ICLR 2025 · similarity 0.82)
- Statistical Model-driven Similarity Hashing: Bridging Modalities for Efficient Unsupervised Retrieval (AAAI 2025 · similarity 0.80)
- Anchor-based Maximum Discrepancy for Relative Similarity Testing (NeurIPS 2025 · similarity 0.80)
- DOCS: Quantifying Weight Similarity for Deeper Insights into Large Language Models (ICLR 2025 · similarity 0.80)
- STRABLE: Benchmarking Tabular Machine Learning with Strings (NeurIPS 2026 · similarity 0.80)
- UltraTWD: Optimizing Ultrametric Trees for Tree-Wasserstein Distance (ICML 2025 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
