7 citations · 10 across the 3 of their papers we have counts for
1 paper · 1 filter
Daniel Karch, Dennis Luxen, Peter Sanders
We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words W, maximum distance d fixed at preprocessing time and a query wor…