INtersection Optimization is NP-Complete
Guillaume Bonfante, Joseph Le Roux, Inria Loria, Nancy Universités Loria · publish.UP (University of Potsdam) · 2007
Finite state methods for natural language processing often require the construction and the intersection of several automata. In this paper we investigate the question of determining the best order in which these intersections should be performed. We take as an example lexical disambiguation in polarity grammars. We show that there is no efficient way to minimize the state complexity of these intersections. 1