Intersection Optimization is NP Complete

Guillaume Bonfante (1) , Joseph Le Roux (2)

1 CARTE - Theoretical adverse computations, and safety
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars

We propose a method for lexical disambiguation based on polarities found in several grammatical formalisms which require multi- ples intersection of finite state automata. We then prove that there is no efficient technique to minimize the state complexity of these intersec- tions.

Domaines: Traitement du texte et du document

Guillaume Bonfante, Joseph Le Roux. Intersection Optimization is NP Complete. 2007. ⟨hal-00146671⟩