Peter Schneider-Kamp. Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata. In Hans-Georg Fill, Marten van Sinderen, Leszek A. Maciaszek, editors, Proceedings of the 17th International Conference on Software Technologies, ICSOFT 2022, Lisbon, Portugal, July 11-13, 2022. pages 657-662, SCITEPRESS, 2022. [doi]
@inproceedings{Schneider-Kamp22,
title = {Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata},
author = {Peter Schneider-Kamp},
year = {2022},
doi = {10.5220/0011312300003266},
url = {https://doi.org/10.5220/0011312300003266},
researchr = {https://researchr.org/publication/Schneider-Kamp22},
cites = {0},
citedby = {0},
pages = {657-662},
booktitle = {Proceedings of the 17th International Conference on Software Technologies, ICSOFT 2022, Lisbon, Portugal, July 11-13, 2022},
editor = {Hans-Georg Fill and Marten van Sinderen and Leszek A. Maciaszek},
publisher = {SCITEPRESS},
isbn = {978-989-758-588-3},
}