RE: Building FST-like automaton queries

2012-03-02 Thread Paul Hill
> > Wow, that was quick!  Thanks! > > The power of open source and coffee break, combined... 12 minutes! Wow, that is fast turnaround or a lot of coffee. -Paul

Re: Building FST-like automaton queries

2012-02-28 Thread Dawid Weiss
> Wow, that was quick!  Thanks! The power of open source and coffee break, combined... > I don't think we'll have too many terms per query term - as I said earlier, > we're restricting the expansions to those with an edit distance of 1.  But > this looks cool anyway. Shouldn't make much of a d

Re: Building FST-like automaton queries

2012-02-28 Thread Alan Woodward
Wow, that was quick! Thanks! I don't think we'll have too many terms per query term - as I said earlier, we're restricting the expansions to those with an edit distance of 1. But this looks cool anyway. On 28 Feb 2012, at 16:01, Dawid Weiss wrote: > The issue has a patch -- feel free to try

Re: Building FST-like automaton queries

2012-02-28 Thread Dawid Weiss
The issue has a patch -- feel free to try it out. Dawid On Tue, Feb 28, 2012 at 4:48 PM, Dawid Weiss wrote: > I filed an issue for that. > https://issues.apache.org/jira/browse/LUCENE-3832 > > I'll try to port it myself actually. It shouldn't be a big problem. > > Dawid > > On Tue, Feb 28, 2012

Re: Building FST-like automaton queries

2012-02-28 Thread Dawid Weiss
I filed an issue for that. https://issues.apache.org/jira/browse/LUCENE-3832 I'll try to port it myself actually. It shouldn't be a big problem. Dawid On Tue, Feb 28, 2012 at 2:31 PM, Michael McCandless wrote: > Neat :)  It's like a FuzzyQuery w/ a custom (binary?) cost matrix for > the insert/

Re: Building FST-like automaton queries

2012-02-28 Thread Dawid Weiss
> For steps 2 and 3 you shouldn't use FST at all.  Instead, for 2) use > BasicAutomata.makeString(String) on each of your expanded terms, then > BasicOperations.union on all of those automata to make a single How many input strings do you have? The API Mike mentioned in from a port of the Brics li

Re: Building FST-like automaton queries

2012-02-28 Thread Alan Woodward
>> >> We're only allowing expansions within an edit distance of 1, which should >> keep the numbers of terms down. > > Ahh, ok. So even if the term has two occurrences of cl, only one of > them is allowed to substitute d? Yes, exactly - "cloocl" will be expanded to "doocl" and "clood" only. I

Re: Building FST-like automaton queries

2012-02-28 Thread Michael McCandless
On Tue, Feb 28, 2012 at 8:42 AM, Alan Woodward wrote: > > On 28 Feb 2012, at 13:31, Michael McCandless wrote: > >> Neat :)  It's like a FuzzyQuery w/ a custom (binary?) cost matrix for >> the insert/delete/transposition changes... >> >> Is the number of edits smallish?  Ie you're not concerned abo

Re: Building FST-like automaton queries

2012-02-28 Thread Alan Woodward
On 28 Feb 2012, at 13:31, Michael McCandless wrote: > Neat :) It's like a FuzzyQuery w/ a custom (binary?) cost matrix for > the insert/delete/transposition changes... > > Is the number of edits smallish? Ie you're not concerned about > combinatoric explosion of step 1? We're only allowing ex

Re: Building FST-like automaton queries

2012-02-28 Thread Michael McCandless
Neat :) It's like a FuzzyQuery w/ a custom (binary?) cost matrix for the insert/delete/transposition changes... Is the number of edits smallish? Ie you're not concerned about combinatoric explosion of step 1? For steps 2 and 3 you shouldn't use FST at all. Instead, for 2) use BasicAutomata.mak