Binary codes capable of correcting deletions, insertions and reversals.
V. Levenshtein. Soviet Physics Doklady., 10 (8):
707--710(February 1966)
Abstract
Seems to be the first person to define what became known as the (simple) edit-distance and show it to be a metric. Paper mostly about constructing optimal codes to transmit such corrections.
%0 Journal Article
%1 Levenshtein66
%A Levenshtein, V. I.
%D 1966
%J Soviet Physics Doklady.
%K imported
%N 8
%P 707--710
%T Binary codes capable of correcting deletions, insertions and reversals.
%V 10
%X Seems to be the first person to define what became known as the (simple) edit-distance and show it to be a metric. Paper mostly about constructing optimal codes to transmit such corrections.
@article{Levenshtein66,
abstract = {Seems to be the first person to define what became known as the (simple) edit-distance and show it to be a metric. Paper mostly about constructing optimal codes to transmit such corrections.},
added-at = {2005-12-22T17:20:58.000+0100},
author = {Levenshtein, V. I.},
biburl = {https://www.bibsonomy.org/bibtex/209f1292aba15dcaafea19038f1408bbf/xamde},
citeulike-article-id = {332880},
comment = {Doklady Akademii Nauk SSSR, V163 No4 845-848 1965},
interhash = {55f7ad93fcb9ae3ed999afaa6e24937d},
intrahash = {09f1292aba15dcaafea19038f1408bbf},
journal = {Soviet Physics Doklady.},
keywords = {imported},
month = {February},
number = 8,
pages = {707--710},
priority = {1},
timestamp = {2005-12-22T17:20:58.000+0100},
title = {Binary codes capable of correcting deletions, insertions and reversals.},
volume = 10,
year = 1966
}