On Sat, May 28, 2016 at 3:33 AM, Dawid Weiss wrote:
> > Point taken, but I wonder if there's an algorithmic shortcut to
> determinize
> > the union of Levenshtein DFAs...
>
> Levenshtein DFA is an automaton like any other; when you merge two
> such automata, they will very likely contain states t
28 May 2016, Apache Lucene™ 6.0.1 available
The Lucene PMC is pleased to announce the release of Apache Lucene 6.0.1
Apache Lucene is a high-performance, full-featured text search engine
library written entirely in Java. It is a technology suitable for nearly
any application that requires ful
> Point taken, but I wonder if there's an algorithmic shortcut to determinize
> the union of Levenshtein DFAs...
Levenshtein DFA is an automaton like any other; when you merge two
such automata, they will very likely contain states that need to be
merged (and their transition split) in order to be
