The String-to-String Correction Problem

Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).

The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol from a string, or inserting a single symbol into a string. An algorithm is presented which solves this problem in time proportional to the product of the lengths of the two strings. Possible applications are to the problems of automatic spelling correction and determining the longest subsequence of characters common to two strings.

Last synced 2026-08-22 14:19 UTC

• BlueEdge: Edge computing-based framework for efficient text matching and duplicate detection

  Array 2026 · 0 citations

• Semantic Segment Alignment and Granular ASR Performance Evaluation with Segment- and Word-Level WER

  Computers 2026 · 0 citations