Task-Specific Dependency-based Word Embedding Methods
Not on the map. Why?
Abstract (arXiv)
Two task-specific dependency-based word embedding methods are proposed for text classification in this work. In contrast with universal word embedding methods that work for generic tasks, we design task-specific word embedding methods to offer better performance in a specific task. Our methods follow the PPMI matrix factorization framework and derive word contexts from the dependency parse tree. The first one, called the dependency-based word embedding (DWE), chooses keywords and neighbor words of a target word in the dependency parse tree as contexts to build the word-context matrix. The second method, named class-enhanced dependency-based word embedding (CEDWE), learns from word-context as well as word-class co-occurrence statistics. DWE and CEDWE are evaluated on popular text classification datasets to demonstrate their effectiveness. It is shown by experimental results they outperform several state-of-the-art word embedding methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 9 of its 27 references that are in the map. First posted on arXiv 26 Oct 2021.
Builds on
9 of 27 references.
References · 9
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2018Deep contextualized word representationscited by 2,285
- 2020Stanza: A Python Natural Language Processing Toolkit for Many Human Languagescited by 719
- 2020SBERT-WK: A Sentence Embedding Method by Dissecting BERT-based Word Modelscited by 55
- 2016Representation learning for very short texts using weighted word embedding aggregationcited by 12
- 2020Efficient Sentence Embedding via Semantic Subspace Analysiscited by 4
Built on by
Citing papers per year: 2022: 2; 2023: 1.
3 papers.