.. blogpost::
    :title: Distance entre chaînes de caractères
    :keywords: distance d'édition
    :date: 2016-03-23
    :categories: algorithme

    La distance d'édition ou
    `distance de Levenshtein <https://en.wikipedia.org/wiki/Levenshtein_distance>`_
    est celle qui vient en premier quand on pense à comparer deux chaînes de caractères.
    La `distance de Jaccard <https://en.wikipedia.org/wiki/Jaccard_index>`_ vient en second.
    Mais il en existe bien d'autres que cite l'article :
    `Harry: A Tool for Measuring String Similarity <http://jmlr.org/papers/v17/rieck16a.html>`_.

    * Bag distance
    * `Hamming distance <https://en.wikipedia.org/wiki/Hamming_distance>`_
    * `Kernel-substitution distance <http://www.jmlr.org/papers/v5/leslie04a.html>`_
    * `String alignment distance <http://math.mit.edu/classes/18.417/Slides/alignment.pdf>`_
    * `Compression distance <https://en.wikipedia.org/wiki/Normalized_compression_distance>`_
    * Jaro distance
    * `Lee distance <https://en.wikipedia.org/wiki/Lee_distance>`_
    * `Damerau-Levenshtein distance <https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance>`_
    * `Jaro-Winkler distance <https://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance>`_
    * `Levenshtein distance <https://en.wikipedia.org/wiki/Levenshtein_distance>`_
    * `Distance-substitution kernel <http://www.mathematik.uni-stuttgart.de/fak8/ians/publications/files/HB04.pdf>`_
    * `Spectrum kernel <http://www.ics.uci.edu/~welling/teatimetalks/kernelclub04/spectrum.pdf>`_
    * Subsequence kernel
    * `Weighted-degree kernel <http://sonnenburgs.de/soeren/publications/SonRaeRie07.pdf>`_
    * `Braun-Blanquet coefficient <http://papers.nips.cc/paper/2999-computation-of-similarity-measures-for-sequential-data-using-generalized-suffix-trees.pdf>`_
    * `Kulczynski coefficient <http://papers.nips.cc/paper/2999-computation-of-similarity-measures-for-sequential-data-using-generalized-suffix-trees.pdf>`_
    * `Simpson coefficient <http://papers.nips.cc/paper/2999-computation-of-similarity-measures-for-sequential-data-using-generalized-suffix-trees.pdf>`_
    * `Sokal-Sneath coefficient <http://papers.nips.cc/paper/2999-computation-of-similarity-measures-for-sequential-data-using-generalized-suffix-trees.pdf>`_
    * `Jaccard coefficient <https://en.wikipedia.org/wiki/Jaccard_index>`_
    * `Otsuka coefficient <http://papers.nips.cc/paper/2999-computation-of-similarity-measures-for-sequential-data-using-generalized-suffix-trees.pdf>`_
    * `Soerensen-Dice coefficient <https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient>`_