Thanks Zach!
I'll also write some stuff about that, albeit higher level design ideas
that I've been playing with, I don't have the bandwidth to do more
than that at the moment,
but Hopefully Zach and I can combine efforts.

My feeling is that for us to make significant strides in the 26 cycles we
will need as many collaborators as we can get.
Note that, I've found that it's fairly repetitive, ie a fair number of
Unicode algorithms are N-M codepoints transformations so
normalization/casing/folding/ are similar, segmentation is basically split
with fancy boundary conditions, with the exception of if and/how we
represent a cluster as a type,
requirements are more or less the same across the board, etc

So... it is somewhat realistic to get somewhere :)


On Tue, Nov 22, 2022 at 7:22 PM Zach Laine via SG16 <sg16_at_[hidden]>
wrote:

> I'm officially done with the Boost review process as it relates to
> Boost.Text. It has never gotten a second review, but I'm tired of
> waiting, so I'm giving up on that. I've gotten the best feedback I'm
> probably going to get from the first review anyway.
>
> So, time to start writing papers.
>
> I've already submitted one:
>
> https://isocpp.org/files/papers/P2728R0.html
>
> There might be some small edits to it before SG-16 sees it properly,
> but it's basically finished already.
>
> Another one, about normalization, will be ready in the next couple of days.
>
> Please feel free to comment here, or via private email.
>
> Corentin and I have discussed a paper about the text segmentation
> algorithms too, but no work has begun yet.
>
> Zach
> --
> SG16 mailing list
> SG16_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg16
>