search

Ayu-hack / Hacktoberfest-Contributions

This repository helps beginners contribute to open source and participate in Hacktoberfest. We welcome all pull requests (Python & Java), prioritize genuine contributions, and promote good first issues! #hacktoberfest2022 #hacktoberfest2023 #hacktoberfest2024
20 stars 51 forks source link

Added Java Program to Calculate the Levenshtein Distance Between Two Strings #103

Closed Rekklessss closed 1 month ago

Rekklessss commented 1 month ago

Solved #100 This pull request introduces a Java implementation of the Levenshtein distance calculation, a fundamental string similarity metric widely used in natural language processing, spell checking, and DNA sequence analysis. The program calculates the minimum number of single-character edits (insertions, deletions, substitutions) required to transform one string into another.

Usage:

User Input: The program prompts the user to input two strings and then calculates their Levenshtein distance using both methods.

Testing:

Both methods have been tested with a variety of string inputs, including identical strings, completely different strings, strings with differing lengths, and mixed cases, to ensure correctness.

Attachments:

image
Ayu-hack commented 1 month ago

Great Work ! Merged. More repos are available for pull requests, and they’re part of Hacktoberfest 2024. Feel free to tag me in your Hacktoberfest certificate or badges LinkedIn post! 😄

👉 Follow my GitHub and connect with me on LinkedIn! ⭐ Star these repos to stay updated for next year’s Hacktoberfest!