Skip to Main content Skip to Navigation
Conference papers

INtersection Optimization is NP-Complete

Guillaume Bonfante 1 Joseph Le Roux 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Finite state methods for natural language processing often require the con- struction 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 gram- mars. We show that there is no efficient way to minimize the state complexity of these intersections.
Document type :
Conference papers
Complete list of metadata
Contributor : Joseph Le Roux Connect in order to contact the contributor
Submitted on : Monday, November 5, 2007 - 3:34:14 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Monday, April 12, 2010 - 1:21:20 AM


Publisher files allowed on an open archive


  • HAL Id : inria-00185232, version 1



Guillaume Bonfante, Joseph Le Roux. INtersection Optimization is NP-Complete. Sixth International Workshop on Finite-State Methods and Natural Language Processing - FSMNLP 2007, Sep 2007, Postdam, Germany. ⟨inria-00185232⟩



Record views


Files downloads