For tractability, probabilistic graphical models are typically constrained by making conditional independence assumptions, thus imposing structure and locality on X ∪ Y.
in our models, we postulate that the following conditional independence assumptions hold: the label y i for the i th token directly depends only on the label y prev (i) of some previous token at position prev(i) and potentially on all input tokens.