So, in OT-LFG it is not sufficient to apply just the ¡ £ ¢ construction; I use an additional step: prior to application of ¡ £ ¢ , the LFG grammar (depending on the constraint set ¡ ), which is still an LFG grammar but has category symbols which reflect local constraint violations.
a similar construction as the one presented here can be devised for parsing-based optimization (even for an LFG-style grammar that does not obey the offline parsability condition).