Masked Part-Of-Speech Model: Does Modeling Long Context Help Unsupervised POS-tagging?
June 30, 2022 ยท Entered Twilight ยท ๐ North American Chapter of the Association for Computational Linguistics
Repo contents: .gitignore, LICENSE, README.md, data, get_rechunked_data.py, modules, nlp_commons, order_train.py, rechunk_and_concat_data.sh, requirements.txt, scripts
Authors
Xiang Zhou, Shiyue Zhang, Mohit Bansal
arXiv ID
2206.14969
Category
cs.CL: Computation & Language
Cross-listed
cs.AI,
cs.LG
Citations
1
Venue
North American Chapter of the Association for Computational Linguistics
Repository
https://github.com/owenzx/MPoSM
โญ 4
Last Checked
1 month ago
Abstract
Previous Part-Of-Speech (POS) induction models usually assume certain independence assumptions (e.g., Markov, unidirectional, local dependency) that do not hold in real languages. For example, the subject-verb agreement can be both long-term and bidirectional. To facilitate flexible dependency modeling, we propose a Masked Part-of-Speech Model (MPoSM), inspired by the recent success of Masked Language Models (MLM). MPoSM can model arbitrary tag dependency and perform POS induction through the objective of masked POS reconstruction. We achieve competitive results on both the English Penn WSJ dataset as well as the universal treebank containing 10 diverse languages. Though modeling the long-term dependency should ideally help this task, our ablation study shows mixed trends in different languages. To better understand this phenomenon, we design a novel synthetic experiment that can specifically diagnose the model's ability to learn tag agreement. Surprisingly, we find that even strong baselines fail to solve this problem consistently in a very simplified setting: the agreement between adjacent words. Nonetheless, MPoSM achieves overall better performance. Lastly, we conduct a detailed error analysis to shed light on other remaining challenges. Our code is available at https://github.com/owenzx/MPoSM
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Computation & Language
๐
๐
Old Age
๐
๐
Old Age
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
RoBERTa: A Robustly Optimized BERT Pretraining Approach
R.I.P.
๐ป
Ghosted
BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension
R.I.P.
๐ป
Ghosted