On Sat, Jan 10, 2015 at 8:23 AM, Olivier Binda wrote:
> On 01/10/2015 11:00 AM, Michael McCandless wrote:
>>
>> On Fri, Jan 9, 2015 at 6:42 AM, Olivier Binda
>> wrote:
>>>
>>> Hello.
>>>
>>> 1) What is the best way to check if an automaton (from a regex or a
>>> string
>>> with a wildcard)
>>> ha
On 01/10/2015 11:00 AM, Michael McCandless wrote:
On Fri, Jan 9, 2015 at 6:42 AM, Olivier Binda 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 "i
On Fri, Jan 9, 2015 at 6:42 AM, Olivier Binda 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
