Exact Decoding for Jointly Labeling and Chunking Sequences

There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is the CKY algorithm for probabilistic context free grammars. However, tasks such as noun phrase chunking and relation extraction seem to fall between the two, neither of them being the best fit. Ideally we would like to model entities and relations, with two layers of labels. We present a tractable algorithm for exact inference over two layers of labels and chunks with time complexity O(n2), and provide empirical results comparing our model with linear-chain models.

• Type: Conference
• Year: 2006
• Where: ACL
• Authors: Nobuyuki Shimizu, Andrew R. Haas
• Keywords: ACL 2006, ACL 2007, Algorithm, Linear-chain Models, Viterbi Algorithm