Polynomial Time
metric
ID: polynomialtime
Related Papers
Computational Complexity of Statistical Machine Translation
In this paper we study a set of prob- lems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satis- factorily by the …...
Convertir des grammaires d’arbres adjoints à composantes multiples avec tuples d’arbres (TT-MCTAG) en grammaires à concaténation d’intervalles (RCG) [Converting tree tuple multicomponent tree adjoining grammars (TT-MCTAGs) into range concatenation grammars (RCGs)]
. This paper investigates the relation between TT-MCTAG, and RCG. RCG is known to describe exactly the class PTIME. TT-MCTAG has been proposed to model free word order languages. We …...