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
The interface should also have:
Match(pcat, any scat) as a possible Match constraint.
Definition: "Assign a violation for every node of category k in the prosodic tree that lacks a syntactic correspondent (of any category) in the syntactic tree, where two nodes correspond if they contain all and only the same set of terminal ids."
Function: matchPSAny(stree, ptree, pcat) = matchPS(stree, ptree, pcat, {anyPCat: true})
Need to write the wrapper function and double-check that anyPCat will work properly in reverse (PS rather than SP).
The interface should also have: Match(pcat, any scat) as a possible Match constraint.
Definition: "Assign a violation for every node of category k in the prosodic tree that lacks a syntactic correspondent (of any category) in the syntactic tree, where two nodes correspond if they contain all and only the same set of terminal ids."
Function: matchPSAny(stree, ptree, pcat) = matchPS(stree, ptree, pcat, {anyPCat: true}) Need to write the wrapper function and double-check that anyPCat will work properly in reverse (PS rather than SP).