Papers by Diego Roca
4 and 7-bit Labeling for Projective and Non-Projective Dependency Trees (2023.emnlp-main)
Copied to clipboard
| Challenge: | encodings that map trees into sequences of one discrete label per word have been proposed for constituency parsing and dependency parse. |
| Approach: | They propose an encoding that can represent any projective dependency tree as a sequence of 4-bit labels, one per word. |
| Outcome: | The proposed encoding achieves substantial accuracy gains over the previously best-performing sequence labeling encoders. |