On Fri, Jan 9, 2015 at 6:42 AM, Olivier Binda <olivier.bi...@wanadoo.fr> wrote: > Hello. > > 1) What is the best way to check if an automaton (from a regex or a string > with a wildcard) > has at least 1 match against a FST (from a WFSTCompletionLookup) ?
You need to implement "intersect". We already have this method for two automata (Operations.java); maybe you can start from that but cutover to the FST APIs instead for the 2nd automaton? > 2) Also, is there a simple/efficient way to find the lowest and the highest > arcs of a FST that match against an automaton ? Hmm arcs leaving which state? The initial state? You could simply walk all arcs leaving the initial state from the FST and check if the automaton accepts them leaving its initial state (assuming the automaton has no dead states)? Or, if you are already doing an intersection here, just save this information as a side effect since you will have already computed it. Mike McCandless http://blog.mikemccandless.com --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
