Our Approach | 2.4 Time Complexity Analysis |
Our Approach | In this subsection, we discuss the time complexity of our proposed method. |
Our Approach | Similarly, the time complexity of optimization V,- using Algorithm 3 is 0(MpK2 + MpNK). |
Experiments | The time complexity of our inference algorithm is 0(n6), which can be prohibitive for large scale machine translation tasks. |
Experiments | The average time complexity for the latter is roughly 0(l4), as plotted in green 75 = 2 X 10—7l4. |
Experiments | However, the time complexity is still high, so we set the maximum sentence length to 30 to keep our experiments practicable. |