Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,023,189 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Computer science
Delta encoding
Edit distance
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structured diff of C programs
Pierre-Évariste Dagand
2016
Corpus ID: 26640089
This internship offers to design and implement a structure-aware diff tool for C programs. It will take place in the Whisper team…
Expand
2010
2010
The coupling between eye movements and cognition
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…
Expand
2008
2008
Efficient FPGA-based Hardware Algorithms for Approximate String Matching
S. Mikami
,
Yosuke Kawanaka
,
S. Wakabayashi
,
S. Nagayama
2008
Corpus ID: 61904962
In this paper, an efficient FPGA-based hardware algorithm and its extensions are proposed for calculating the edit distance as a…
Expand
2008
2008
Pf Marteau, September 2006 "time Warp Edit Distances with Stiffness Adjustment for Time Series Matching" 1
2008
Corpus ID: 15684895
In a way similar to the string-to-string correction problem we address time series similarity in light of a time-series-to-time…
Expand
2007
2007
An Algorithm for Generating a Dictionary ofJapanese Scienti c
Yun-Sun Kang
,
A. Maciejewski
2007
Corpus ID: 17953607
This article describes the implementation of algorithms for generating a dictionary of Japanese scienti c terms originating from…
Expand