https://github.com/samuellucas97/best-matching
Implementation serial of Levenshtein distance algorithm.
https://github.com/samuellucas97/best-matching
algorithm automated-testing junit levenshtein-distance maven serial-version
Last synced: 2 months ago
JSON representation
Implementation serial of Levenshtein distance algorithm.
- Host: GitHub
- URL: https://github.com/samuellucas97/best-matching
- Owner: Samuellucas97
- Created: 2020-02-27T18:27:34.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2020-10-13T19:57:27.000Z (over 5 years ago)
- Last Synced: 2025-06-28T14:43:26.216Z (about 1 year ago)
- Topics: algorithm, automated-testing, junit, levenshtein-distance, maven, serial-version
- Language: Java
- Homepage:
- Size: 27.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Best-matching
## Introduction
This folder contains the implementation of the Big Data algorithm, Levenshtein distance. Given this, it refers to one of the activities of the _Concurrency Programming_ discipline taught by dr. Nélio Cacho Bachelor of Information Technology at the Federal University of Rio Grande do Norte (__UFRN__).
- [Prerequisites](#prerequisites) - Project prerequisites
- [About the algorithm](#about-the-algorithm) - Informations about the algorithm.
- [Author](#author) - Project author.
## Prerequisites
You need the following programs to use this repository:
- Maven
- JDK 11
_This project was loaded on Eclipse using above configurations_
## About the algorithm
In resume, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.
## Author
| Name: | Email: |
| ---------- | ------------- |
|`Samuel Lucas de Moura Ferino` | _samuellucas97@ufrn.edu.br_