Daniel Swanson

Also, it occurs to me that this is tricky because `lt-comp` minimizes each pardef separately in addition to each section.

Another alternative is that 0493630 added the ability to compile dictionaries in several pieces, which should alleviate the burden of frequently recompiling the regex sections.

In fact, we could have globally shared regex sections, as proposed in https://github.com/apertium/apertium/pull/161

I believe the issue here is that `Transducer::closure()` disregards weight and as a result `determinize()` and `minimize()` lose any weights which are on epsilon transitions.

The issue is that FST minimization was written for unweighted automata and when weight support for added, `closure()` and/or `minimize()` were updated incorrectly and my first attempt at fixing it...

While we're in the business of speeding things up and breaking internal backwards compatibility, it would probably be a good idea to switch the datatype of `Transducer` from `map` to...

> > ...states are always added sequentially from `0` anyway. > > And they are never removed out-of-order, leaving holes? There isn't any mechanism for removing states. Any operation that...

This was previously suggested in https://github.com/apertium/apertium-lex-tools/pull/84 and while there are still several open PRs, most of them are mine and have a fair amount of changes that need to be...

The implementation that comes to mind for what @xavivars describes is to have some way of specifying in the bidix that a particular word-bound blank should be attached to a...

I have no idea - I just copied the report here; I don't generally do much with the web interface.