mohammedalduraidi/opensooq-task

it's a task given by OpenSooq company

OpenSooq-Task

it's a task given by OpenSooq company

Table of Contents

1. task description
2. Usage
3. References

Task description

1. 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.

2. The Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other. In a more general context, the Hamming distance is one of several string metrics for measuring the edit distance between two sequences.

Usage

• Make sure you're in the file directory and run php _S localhost: 8000
• Then open your browser in localhost: 8000 .

References

• Levenshtein Distance Wikipedia
• Edit Distance YouTube
• Hamming Wikipedia