Abstract
Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU–well-nested CU – and present a new unification algorithm that solves well-nested context equations in non-deterministic polynomial time. We show that minimal well-nested solutions of context equations can be composed from the material present in the equation (see Theorem[1]). This property is wishful when modeling natural language ellipsis in CU.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call