> I wonder if in-word camelcase boundaries would be doable as well Theoretically yes. But in practice most possibly no. OpenType tables just feature fixed len

> I wonder if in-word camelcase boundaries would be doable as well Theoretically yes. But in practice most possibly no. OpenType tables just feature fixed length strings matching. It can't match to more powerful regular expressions. You would need an infinite number of OT rules. [0] If you'd have a well defined set, maybe it could work, but it would still be overwhelming fast. [0] http://pfaedit.sourceforge.net/gposgsub.html http://pfaedit.sourceforge.net/gposgsub.html