BCEUO Tag Set
Jump to navigation
Jump to search
An BCEUO Tag Set is a tag set composed of {B, C, E, U, O} tags that is used by a BCEUO Tagging Task.
- AKA: Begin-Continue-End-Unique-Other Tag Set.
- …
- Counter-Example(s):
- an IOB Tag Set.
- See: POS Tag Set.
References
2006
- (Sarawagi, 2006) ⇒ Sunita Sarawagi. (2006). “Efficient Inference on Sequence Segmentation Models.” In: Proceedings of the 23rd International Conference on Machine Learning (ICML 2006). doi:10.1145/1143844.1143944
- QUOTE: This limitation is partly addressed by expanding the label set — for example, a popular choice in named entity recognition tasks (NER) is the Begin-Continue-End-Unique-other (BCEUO) encoding of entity labels (Borthwick et al., 1998)
1998
- (Borthwick et al., 1998) ⇒ Andrew Borthwick, John Sterling, Eugene Agichtein, and Ralph Grishman. (1998). “Exploiting Diverse Knowledge Sources via Maximum Entropy in Named Entity Recognition.” In: Proceedings of the Sixth Workshop on Very Large Corpora.
- QUOTE: Given a tokenization of a test corpus and a set of n (for MUC-7, n = 7) tags which define the name categories of the task at hand, the problem of named entity recognition can be reduced to the problem of assigning one of 4n + l tags to each token. For any particular tag x from the set of n tags, we could be in one of 4 states: x_start, x_continue, x_end, and x_unique. In addition, a token could be tagged as "other" to indicate that it is not part of a named entity. For instance, we would tag the phrase [Jerry Lee Lewis flew to Paris] as [person_start, person_continue, person_end, other, other, location_unique I. This approach is essentially the same as (Sekine et al., 1998).
- (Sekine et al., 1998) ⇒ Satoshi Sekine, Ralph Grishman, and Hiroyuki Shinnou. (1998). “A Decision Tree Method for Finding and Classifying Names in Japanese Texts.” In: Proceedings of the Sixth Workshop on Very Large Corpora.