2015
DOI: 10.14445/22312803/ijctt-v27p123
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Levenshtein Distance Algorithm for ECommerce of Bravoisitees Distro

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 0 publications
0
7
0
1
Order By: Relevance
“…Levenshtein distance, also known as edit distance, is widely used for quantifying the dissimilarity of two text strings. This algorithm calculates the minimum amount of operations transforming a text string into another string, that includes replacement, deletion, and insertion [22] - [23]. For example, an optimal way to compare the two strings 'MONDAY' and 'SATURDAY', is to insert letters "S" and "A" and substitute "M", "O" and "N" with "T", "U" and "R", respectively, leading towards a Generalized Levenshtein Distance (GLD) of 5 [24].…”
Section: Levenshtein Distance For Text Similaritymentioning
confidence: 99%
“…Levenshtein distance, also known as edit distance, is widely used for quantifying the dissimilarity of two text strings. This algorithm calculates the minimum amount of operations transforming a text string into another string, that includes replacement, deletion, and insertion [22] - [23]. For example, an optimal way to compare the two strings 'MONDAY' and 'SATURDAY', is to insert letters "S" and "A" and substitute "M", "O" and "N" with "T", "U" and "R", respectively, leading towards a Generalized Levenshtein Distance (GLD) of 5 [24].…”
Section: Levenshtein Distance For Text Similaritymentioning
confidence: 99%
“…Levenshtein distance, also known as edit distance, is widely used for quantifying the dissimilarity of two text strings. This algorithm calculates the minimum amount of operations transforming a text string into another string, that includes replacement, deletion, and insertion [23] - [25]. For example, an optimal way to compare the two strings 'MONDAY' and 'SATURDAY', is to insert letters "S" and "A"…”
Section: Levenshtein Distance For Text Similaritymentioning
confidence: 99%
“…Levenshtein distance, also known as edit distance, is widely used for quantifying the dissimilarity of two text strings. This algorithm calculates the minimum amount of operations transforming a text string into another string, that includes replacement, deletion, and insertion [23] - [25]. For example, an optimal way to compare the two strings 'MONDAY' and 'SATURDAY', is to insert letters "S" and "A" and substitute "M", "O" and "N" with "T", "U" and "R", respectively, leading towards a Generalized Levenshtein Distance (GLD) of 5 [26].…”
Section: Levenshtein Distance For Text Similaritymentioning
confidence: 99%