Intersection Optimization is NP Complete
Résumé
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 documentOrigine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...