Skip to content

pablofaalves/levenshtein

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Levenshtein algorithm implementation

This small java application calculates the levenshtein distance between two strings with optimized memory allocation.

Requirements

For building and running the application you need:

Compiling

run javac com/quoori/levenshtein/*.java on your shell inside the 'src' folder

Running the application

run java com.quoori.levenshtein.Main arg0 arg1 on your shell, where arg0 and arg1 are the words which you'd like know the levenshtein distance.

If you don't use any arguments, it will run a default test case.

About

Levenshtein algorithm implementation

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages