作者: Zhemin Zhu , Djoerd Hiemstra , Peter Apers
DOI: 10.1007/978-3-319-11397-5_14
关键词:
摘要: Sequence labeling has wide applications in natural language processing and speech processing. Popular sequence models suffer from some known problems. Hidden Markov (HMMs) are generative they cannot encode transition features; Conditional (CMMs) the label bias problem; And training of conditional random fields (CRFs) can be expensive. In this paper, we propose Linear Co-occurrence Rate Networks (L-CRNs) for which avoid mentioned problems with existing models. The factors L-CRNs locally normalized trained separately, leads to a simple efficient method. Experimental results on real-world data sets show that reduce time by orders magnitudes while achieve very competitive CRFs.