Faster Algorithm for Bounded Damerau-Levenshtein Distance.
| Anthology ID: | DBLP:conf/spire/YamanoS25 |
|---|---|
| Volume: | String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings |
| Year: | 2025 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 291-303 |
| URL: | https://doi.org/10.1007/978-3-032-05228-5_23 |
| DOI: | https://doi.org/10.1007/978-3-032-05228-5_23 |
| DBLP: | conf/spire/YamanoS25 |
| BibTeX: |
@inproceedings{yamano-2025-faster,
author = {Ryosuke Yamano and
Tetsuo Shibuya},
editor = {Golnaz Badkobeh and
Jakub Radoszewski and
Nicola Tonellotto and
Ricardo Baeza-Yates},
title = {{Faster Algorithm for Bounded Damerau-Levenshtein Distance}},
booktitle = {{String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {16073},
pages = {291--303},
publisher = {Springer},
year = {2025},
url = {https://doi.org/10.1007/978-3-032-05228-5_23},
doi = {https://doi.org/10.1007/978-3-032-05228-5_23}
}