Welcome to Levenshtein’s documentation!

A C extension module for fast computation of:

• Levenshtein (edit) distance and edit sequence manipulation

• string similarity

• approximate median strings, and generally string averaging

• string sequence and set similarity

Levenshtein has a some overlap with difflib (SequenceMatcher). It supports only strings, not arbitrary sequence types, but on the other hand it’s much faster.

It supports both normal and Unicode strings, but can’t mix them, all arguments to a function (method) have to be of the same type (or its subclasses).

Installation:

• Installation
  • using pip
  • from git

Usage:

• Levenshtein module
  • distance
  • ratio
  • hamming
  • jaro
  • jaro_winkler
  • median
  • median_improve
  • quickmedian
  • setmedian
  • seqratio
  • setratio
  • editops
  • opcodes
  • inverse
  • apply_edit
  • matching_blocks
  • subtract_edit

Indices and tables

• Index

• Module Index

• Search Page