Transition models iteratively build the detected spans by chaining different actions. [1]} employs a set of three actions types (SHIFT, REDUCE-X, UNARY-X) that build a forest of binary word trees. [2]} adds a new action (OUT) to allow building multiple mentions for a given span, especially fine-grained entity classes according to a predefined semantic hierarchy.
