Daniel Swanson

Each time you step by an uppercase letter, it also steps by the lowercase version, so for an N-letter word, you have 2^N states when you reach the end.

Another thing we could do is within `State::step()` record each `(src, trg)` pair for the main symbol and then skip any alt step that would be between the same pair....

I have added `-D_GLIBCXX_ASSERTIONS` to my local build (and verified that I can produce crashes from assertions) but I'm still not able to reproduce this one.

```xml ``` ```bash $ apertium/apertium-compile-caps tests/data/basic.crx crx.bin $ cat blah.txt [[c:AA/AA]]^xyz/XyZ$ ^qry/Qry$ ^iPhone/iPhone$ ^Daniel/Daniel$ $ cat blah.txt | apertium/apertium-restore-caps crx.bin [[c:AA/AA]]xyz[[/]] qry iPhone Daniel ``` Available attributes for `` are...

I think that this module will require more features to be used at the scale of an entire pair, but I'm not confident of what those features are, so I'm...

Processor added in [7e7004d](https://github.com/apertium/apertium/commit/7e7004d29d3a2dbaa9e3c941fb7f5a33e8ba04c3)

No one is currently working on this, you're welcome to give it a shot.

So there's 5 taggers, and we need to handle each one a little differently. - the 3 unigram taggers are easy since we just need to output the count directly...

One question, which has a larger impact on how I implement this than might be expected, is whether the lookahead should count towards the rule length. That is, if you...

The one problem that occurs to me is that I'm not sure what happens if you create a chunk and then reject the rule - the result would be the...