Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Відстань Левенштейна× | Динамічне вирівнювання часу (Dynamic Time Warping, DTW)× | |
|---|---|---|
| Галузь | Прийняття рішень | Прийняття рішень |
| Родина | MCDM | MCDM |
| Рік появи≠ | 1966 | 1978 |
| Автор методу≠ | Vladimir Levenshtein | Hideki Sakoe and Seibi Chiba |
| Тип≠ | Edit distance metric | Elastic sequence alignment metric |
| Основоположне джерело≠ | Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10, 707-710. link ↗ | Sakoe, H., & Chiba, S. (1978). Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 26(1), 43-49. DOI ↗ |
| Інші назви≠ | edit distance, Damerau-Levenshtein distance | DTW, dynamic programming time warping, elastic distance |
| Пов'язані | 1 | 1 |
| Підсумок≠ | Levenshtein distance, also called edit distance, measures the minimum number of single-character edits (insertions, deletions, substitutions) needed to transform one string into another. Introduced by Vladimir Levenshtein in 1966, this metric is a true metric (satisfying all distance properties) and is fundamental in computational linguistics, spell checking, DNA sequence comparison, and record linkage. It ranges from 0 (identical strings) to the length of the longer string. | Dynamic Time Warping is a distance metric for comparing time series or sequential data that may vary in length or speed. Introduced by Hideki Sakoe and Seibi Chiba in 1978 for speech recognition, DTW measures the minimal cumulative distance needed to align two sequences using dynamic programming. Unlike fixed-distance metrics, DTW allows flexible time warping, making it ideal for sequences that are similar in shape but offset or scaled differently in time. |
| ScholarGateНабір даних ↗ |
|
|