# Levenshtein.jl

**Repository Path**: Julialang/Levenshtein.jl

## Basic Information

- **Project Name**: Levenshtein.jl
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2018-03-12
- **Last Updated**: 2022-03-03

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Levenshtein

[![Build Status](https://travis-ci.org/venkr/Levenshtein.jl.svg?branch=master)](https://travis-ci.org/venkr/Levenshtein.jl)
[![Coverage Status](https://coveralls.io/repos/venkr/Levenshtein.jl/badge.svg?branch=master)](https://coveralls.io/r/venkr/Levenshtein.jl)
[![GitHub license](https://img.shields.io/badge/license-MIT-blue.svg)](https://raw.githubusercontent.com/venkr/Levenshtein.jl/master/LICENSE.md)


Levenshtein distance between two strings in [julia](http://julialang.org/)

This module provides a simple, but generic implementation of the Levenshtein distance function.

## Installation
```julia
julia> Pkg.add("Levenshtein")
```

## Usage
Standard Levenshtein distance
```julia
julia> levenshtein("polynomial", "exponential")
6
```

Levenshtein distance with custom insertion, deletion, substitution costs
```julia
julia> ins, del, sub = 3, 2, 1
(3,2,1)

julia> levenshtein("polynomial", "exponential", ins, del, sub)
8
```