About: String-to-string correction problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia-live.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia-live.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FString-to-string_correction_problem

In computer science, the string-to-string correction problem refers to determining the minimum number of edit operations necessary to change one string into another (i.e., computing the shortest edit distance). A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol. The length of the edit sequence provides a measure of the distance between the two strings.

AttributesValues
rdf:type
sameAs
foaf:isPrimaryTopicOf
rdfs:comment
  • In computer science, the string-to-string correction problem refers to determining the minimum number of edit operations necessary to change one string into another (i.e., computing the shortest edit distance). A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol. The length of the edit sequence provides a measure of the distance between the two strings.
rdfs:label
  • String-to-string correction problem
has abstract
  • In computer science, the string-to-string correction problem refers to determining the minimum number of edit operations necessary to change one string into another (i.e., computing the shortest edit distance). A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol. The length of the edit sequence provides a measure of the distance between the two strings. Several algorithms exist to provide an efficient way to determine string distance and specify the minimum number of transformation operations required. Such algorithms are particularly useful for delta creation operations where something is stored as a set of differences relative to a base version. This allows several versions of a single object to be stored much more efficiently than storing them separately. This holds true even for single versions of several objects if they do not differ greatly, or anything in between. Notably, such difference algorithms are used in molecular biology to provide some measure of kinship between different kinds of organisms based on the similarities of their macromolecules (such as proteins or DNA).
Link to the Wikipage edit URL
Link from a Wikipage to an external page
extraction datetime
Link to the Wikipage history URL
Wikipage page ID
page length (characters) of wiki page
Wikipage modification datetime
Wiki page out degree
Wikipage revision ID
Link to the Wikipage revision URL
dbp:wikiPageUsesTemplate
dct:subject
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git39 as of Aug 10 2019


Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3319 as of Sep 1 2020, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2020 OpenLink Software