“Abstract: In this talk, I will introduce a method to reduce constituent parsing to sequence labeling. For each word w_t, it generates a label that encodes: (1) the number of ancestors in the tree that the words w_t and w_{t+1} have in common, and (2) the nonterminal symbol at the lowest common ancestor. The proposed encoding function is injective for any tree without unary branches. In practice, the approach is made extensible to all constituency trees by collapsing unary branches. I will also present a set of fast baselines and results on the PTB and CTB treebanks. These models outperform the Vinyals et al. (2015) sequence-to-…”

Price: Free

Link: https://www.meetup.com/Natural-Language-Processing-Copenhagen-Meetup/events/254439100/