1.6 KiB
title: Levenshtein Distance algorithm: Levenshtein Distance trees: eucaliptus + found species in Spanish on the internet humans: Julio Cortázar Gijs de Heij An Mertens language: Spanish English published: 2021 license: Collective Conditions for (re-)use (CC4r), June 2021 repository: https://gitlab.constantvzw.org/anais_berck/levenshtein-distance-lee-a-cortazar publication_url: http://anaisberck.tabakalera.eus/ support: This book is a creation for ÁGORA / CEMENT / CÓDIGO, an online exhibition curated by Lekutan, within the programme of Komisario Berriak supported by Tabakalera in Donostia/San Sebastián, Spain. thanks: Andrea Estankona, Jaime Munárriz, Esther Berdión
The author of this book is the Levenhstein Distance algorithm, the subject is the eucalyptus tree in "Fama y eucalipto", an excerpt from Historias de Cronopios y de Famas by Julio Cortázar, published in 1962 by Editorial Minotauro. Levenshtein distance, edit distance or word distance is an algorithm that operates in spell checkers. It is the minimum number of operations required to transform one word into another. An operation can be an insertion, deletion or substitution of a character. The algorithm was an invention of Russian scientist Vladimir Levenshtein in 1965.