On the one hand, it is highly expressive to cover a majority of semantic analysis.
the corresponding Maximum Subgraph problem with an arc-factored disambiguation model can be solved in low-degree polynomial time.