Hi there, I'd like to construct an Automaton to prefix match against a large set of strings. I gather a RunAutomation is immutable, thread safe and faster than Automaton. Are there any other differences between the three Automaton classes, for example, in memory usage?
Would the general approach for such a problem be to use DaciukMihovAutomatonBuilder to create an Automaton from the sorted list of my string set, set all the states to accept (to enable prefix matching), then pass the Automaton into the constructor of a CharacterRunAutomaton, and use the run method on the CharacterRunAutomaton to match any queries? As it seems like I'm building up the Automaton at least three times, and keeping a reference to the Automaton in the CharacterRunAutomaton, is this the most memory efficient way of building such an Automaton? Thanks in advance, Oliver
