Named Entity Recognition can be posited as a standard sequence classification problem where consists of example label pairs where both the examples and the labels are themselves sequences of word vectors and entity types, respectively.
an input example is a equal-length sequence of entity-type labels y i,j ∈ Y where Y is the set of all entity type labels and includes a special other 'O'-label with which all words that are not entities are labeled.