3 ms·

This presentation talks about using N-grams to make an regex searchable index http://www.informatik.hu-berlin.de/forschung/gebiete/wbi/teaching/archive/sose08/

• fizx 17y ago
  No complexity analysis. Random student results. It's viable to build an index with n-grams, but I don't think you'd get any benefit over suffix-tree search. There might be a way to select n-grams cleverly some of the time, but you can also easily run into pathological cases.