Skip to search formSkip to main contentSkip to account menu

String-to-string correction problem

In computer science, the string-to-string correction problem refers to the minimum number of edit operations necessary to change one string into… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We compare the efficiency of seven modern SMT-solvers for several decision and combinatorial problems: the bounded Post… 
2010
2010
  • 2010
  • Corpus ID: 30916399
varies with the task at hand. In tasks like reading, the eyes are “the window to the soul,” moving with each step of the… 
2008
2008
In this paper, an efficient FPGA-based hardware algorithm and its extensions are proposed for calculating the edit distance as a… 
2007
2007
This article describes the implementation of algorithms for generating a dictionary of Japanese scienti c terms originating from… 
1998
1998
In this work we present a new algorithm to generate the texture print of a region in an image. For this texture analysis, a… 
1994
1994
Software growth always starts from a set of incomplete, imprecise, and sometimes selfcontradicting requirements, and endures a… 
1987
1987
Optimal linear-time algorithms for solving recurrence equations on simple systolic arrays are presented. The systolic arrays use… 
1981
1981
The string merging problem is to determine a merged string from a given set of strings. The distinguishing property of a solution…