Suffix Trees for text indexing


I would like to implement a suffix tree, to index text for interactive searches. The idea is that the user will start typing, and a list of results will be filtered down based on exact sub-string matches as they type. The wikipedia page for suffix trees is

Just wondering if there are any packages already available for this? The terms ‘suffix’, ‘PAT’ or ‘position’ don’t turn up anything obvious on Elm package search. There is however, a trie implementation which I could base this on:

Also, any other suggestions as to how to implement this kind of search are welcome. For example, can such a search be made more fuzzy?

1 Like

This topic was automatically closed 10 days after the last reply. New replies are no longer allowed.