The size of this chart is O(n2 n ) in the number of ETs-still exponential in the worst case.
as with the more general features, the ENUM algorithm, memoizing recursive calls with the chart, can take advantage of the hard constraints of the UG to lower the time complexity in practice.