12. The computing device of claim 11 , wherein the one or more processors are configured to solve the ILP further by performing coarse-to-fine pruning to increase a speed of determining the most-likely parse and its corresponding sequence of the POS tags for the tokens.
12. The computing device of claim 11 , wherein the one or more processors are configured to solve the ILP further by performing coarse-to-fine pruning to increase a speed of determining the most-likely parse and its corresponding sequence of the POS tags for the tokens. 13. The computing device of claim 12 , wherein the one or more processors are configured to solve the ILP utilizing relaxed parsing with independent contextual tagging by solving the ILP as a Lagrangian dual decomposition defined as follows: min λ , β ⁢ max x ∈ X ⁢ ( θ T T ⁢ F + β T ) ⁢ x + max z ∈ Z ⁢ ( θ P T ⁢ H + λ T ) ⁢ z - max ( x ′ , z ′ ) ∈ C ⁢ ⁢ β T ⁢ x ′ + λ T ⁢ z ′ , where Z represents a set of all z, λ T and β T represent transforms of matrices λεR |B| and β=R |J| , R represents parameters of the tagger θ T εR′ and the parser θ P εR p , x=x′, and z=z′, and where C represents a set defined as: C = { x ∈ { 0 , 1 }  B  , z ∈ { 0 , 1 }  J  : ∀ b ∈ B , m ∈ [ n ] ∑ t ∈ T ⁢ ⁢ x ⁡ ( m , t ) = 1 , ∑ j ∈ J : j mt = b ⁢ ⁢ z ⁡ ( j ) = x ⁡ ( b ) ∑ j ∈ J : j mod = m ⁢ ⁢ z ⁡ ( j ) = 1 , ∑ j ∈ J : j ht = b , j mod = m ⁢ ⁢ z ⁡ ( j ) ≤ x ⁡ ( b ) } .