A webapp for the syntax-prosody analyst working in Optimality Theory, with automated Gen, Con and Eval. Download build files from syntax-prosody-ot/build
I changed the algorithm last-minute, which is probably for the best. I think it much more intuitively initializes all of the minimal nodes as left-headed, then progressively changes them to right-headed.
If L is a left-headed minimal node and R is a right-headed minimal node, the returned list will have the order LLL, RLL, LRL, RRL, LLR, RLR, RRR
I changed the algorithm last-minute, which is probably for the best. I think it much more intuitively initializes all of the minimal nodes as left-headed, then progressively changes them to right-headed.
If L is a left-headed minimal node and R is a right-headed minimal node, the returned list will have the order
LLL, RLL, LRL, RRL, LLR, RLR, RRR