string2string Studio: An Interactive, In-Browser Platform for String-to-String Algorithms

• URL: http://arxiv.org/abs/2608.03984v1
• Date: Tue, 04 Aug 2026 17:48:15 GMT
• Title: string2string Studio: An Interactive, In-Browser Platform for String-to-String Algorithms
• Abstract summary: string2string Studio is an interactive in-browser platform for string-to-string analysis.<n>System integrates six main modules, operating at character, word, token, line, and residue levels.<n>Core operations run locally by default without any installation or data upload.
• Score: 53.57099780847477
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present string2string Studio, an interactive in-browser platform for string-to-string analysis across natural language processing, computational biology, and the digital humanities. The system integrates six main modules (alignment, distance, similarity, search, generation metrics, and BLAST homology search), operating at character, word, token, line, and residue levels. Its C++-based algorithms compile to WebAssembly, so core operations run locally by default without any installation or data upload. The interface reports scores with their "evidence" (alignments, edit paths, metric matches, search hits, and homology traces), making methods inspectable, debuggable, and comparable on shared inputs. Internal benchmarks show speedups of up to 2,500x over the Python predecessor, faster global/local alignment than a general-purpose native C aligner, and exact agreement with independent references under declared settings. For homology search, the scoped client-side blastn path closely matches NCBI BLAST+ rankings and statistics under matched parameters. A curated showcase and Learn mode present canonical algorithms and metrics as reusable demonstrations. string2string Studio is open-source and freely available at string2string.org.

Related papers

• Boolean queries are all you need? [10.637635718179075]
  We search the MS MARCO V2.1 deduped segment collection used by the TREC 2024 RAG track.<n>Over a standard track subset of 86 topics, and operating under a budget of 100 model calls/topic, the agent achieved an NDCG@10 of 0.6863.<n> Ranking is based solely on the density of corpuss matching a query, with no requirement for supervised learning, global statistics, or term weights.
  arXiv  Detail & Related papers  (2026-07-13T10:25:46Z)
• SimpleWikiSearch: A Clean Offline Wikipedia Environment for Agentic Search [2.1542644686007173]
  We present SimpleWikiSearch, whose corpus construction, retrieval stack, tool contract, and evaluation protocol are explicit and runnable.<n>The environment starts from a full English Wikipedia dump, cleans and chunks the corpus, builds keyword and dense retrieval indexes, and exposes a minimal tool interface.<n>We report baseline results on six QA datasets using open-source LLMs and provide a random-300 subset for comparisons with closed-source commercial models.
  arXiv  Detail & Related papers  (2026-07-10T13:05:10Z)
• GrepSeek: Training Search Agents for Direct Corpus Interaction [66.69568141699311]
  GrepSeek is an optimized direct corpus interaction (DCI) search agent that trains a compact search agent to find, filter, and compose evidence from large text corpora.<n>To make DCI practical at scale, we further use a semantics-preserving sharded-parallel execution engine that accelerates shell-based retrieval by up to $7.6times$ while preserving byte-exact equivalence with sequential execution of the shell command.
  arXiv  Detail & Related papers  (2026-05-28T03:37:33Z)
• STRABLE: Benchmarking Tabular Machine Learning with Strings [53.03295517218137]
  STRABLE is a benchmarking corpus of 108 tables, all real-world learning problems with strings and numbers across diverse application fields.<n>We run the first large-scale empirical study of tabular learning with strings, evaluating 445 pipelines.<n>We find that, because most tables in the wild are categorical-dominant, advanced tabular learners paired with simple string embeddings achieve good predictions at low computational cost.
  arXiv  Detail & Related papers  (2026-05-12T15:47:50Z)
• Beyond Semantic Similarity: Rethinking Retrieval for Agentic Search via Direct Corpus Interaction [127.64173950476702]
  We study direct corpus interaction (DCI), where an agent searches the raw corpus directly with general-purpose terminal tools.<n>This approach requires no offline indexing and adapts naturally to evolving local corpora.<n>Across IR benchmarks and end-to-end agentic search tasks, this simple setup substantially outperforms strong sparse, dense, and reranking baselines.
  arXiv  Detail & Related papers  (2026-05-03T19:13:11Z)
• CLARC: C/C++ Benchmark for Robust Code Search [2.225731679677886]
  We present CLARC, a C/C++ benchmark built from real-world GitHub repositories.<n>Clarc contains 1,245 query-code pairs for evaluation and 5,472 pairs for training.
  arXiv  Detail & Related papers  (2026-03-04T18:57:37Z)
• Prompt Stability Scoring for Text Annotation with Large Language Models [0.0]
  Researchers are increasingly using language models (LMs) for text annotation.<n>These approaches rely only on a prompt telling the model to return a given output according to a set of instructions.<n>The diagnose of LM outputs may nonetheless be vulnerable to small changes in the prompt design.
  arXiv  Detail & Related papers  (2024-07-02T08:11:18Z)
• Context Perception Parallel Decoder for Scene Text Recognition [52.620841341333524]
  Scene text recognition methods have struggled to attain high accuracy and fast inference speed. We present an empirical study of AR decoding in STR, and discover that the AR decoder not only models linguistic context, but also provides guidance on visual context perception. We construct a series of CPPD models and also plug the proposed modules into existing STR decoders. Experiments on both English and Chinese benchmarks demonstrate that the CPPD models achieve highly competitive accuracy while running approximately 8x faster than their AR-based counterparts.
  arXiv  Detail & Related papers  (2023-07-23T09:04:13Z)
• string2string: A Modern Python Library for String-to-String Algorithms [24.167017445129105]
  string2string is an open-source library that offers a comprehensive suite of efficient algorithms for string-to-string problems. It includes traditional algorithmic solutions as well as recent advanced neural approaches to tackle various problems in string alignment, distance measurement, lexical and semantic search, and similarity analysis. It is implemented in Python, easily installable via pip, and accessible through a simple API.
  arXiv  Detail & Related papers  (2023-04-27T17:57:19Z)
• AutoSTR: Efficient Backbone Search for Scene Text Recognition [80.7290173000068]
  Scene text recognition (STR) is very challenging due to the diversity of text instances and the complexity of scenes. We propose automated STR (AutoSTR) to search data-dependent backbones to boost text recognition performance. Experiments demonstrate that, by searching data-dependent backbones, AutoSTR can outperform the state-of-the-art approaches on standard benchmarks.
  arXiv  Detail & Related papers  (2020-03-14T06:51:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.