Generalizing Word Embeddings using Bag of Subwords
Open accessThe DOI matches its Crossref record; the references it cites are not checked yet.
Abstract
We approach the problem of generalizing pretrained word embeddings beyond fixed-size vocabularies without using additional contextual information.We propose a subwordlevel word vector generation model that views words as bags of character n-grams.The model is simple, fast to train and provides good vectors for rare or unseen words.Experiments show that our model achieves stateof-the-art performances in English word similarity task and in joint prediction of part-ofspeech tag and morphosyntactic attributes in 23 languages, suggesting our model's ability in capturing the relationship between words' textual representations and their embeddings.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The main reason is that LogRobust utilizes the Drain log parser [24] to obtain log templates. As aforementioned in Section III-C, the Drain parser could inaccurately parse a noticeable number of log messages on BGL and Thunderbird datasets.”
From Log-based Anomaly Detection Without Log Parsing (2021) · cites this paper as [24]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“They found that Drain [24] is the most accurate log parser, which attains high accuracy on 9 out of 16 datasets.”
From Log-based Anomaly Detection Without Log Parsing (2021) · cites this paper as [24]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
The citation lists are queued
They are fetched later and appear here then.
References 22 · Cited by 53
Research works printed but not linked: 6
- Andrei Alexandrescu and Katrin Kirchhoff. 2006. Fac- tored neural language models. In NAACL-HLT, pages 1-4.
- Ryan Cotterell and Hinrich Schütze. 2015. Morpho- logical word-embeddings. In NAACL-HLT, pages 1287-1292.
- Thang Luong, Richard Socher, and Christopher Man- ning. 2013a. Better word representations with re- cursive neural networks for morphology. In Pro- ceedings of the Seventeenth Conference on Com- putational Natural Language Learning, pages 104- 113.
- Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Cor- rado, and Jeff Dean. 2013. Distributed representa- tions of words and phrases and their compositional- ity. In NIPS, pages 3111-3119.
- Barbara Plank, Anders Søgaard, and Yoav Goldberg. 2016. Multilingual part-of-speech tagging with bidirectional long short-term memory models and auxiliary loss. In ACL, page 412.
- Hinrich Schütze. 1993. Word space. In NIPS, pages 895-902.
Metadata
- Authors
- Zhao, J., Mudgal, S., & Liang, Y.
- Affiliations
- University of Wisconsin–Madison (US)
- Venue
- Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
- Published
- 2018
- Pages
- 601-606
- OpenAlex
- W2891680269
- Cited by
- 53
- References
- 22
- Citations by year
- 2025: 4 · 2024: 1 · 2023: 4 · 2022: 4 · 2021: 10 · 2020: 15 · 2019: 14 · 2018: 1
- FWCI
- 3.98
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- Locations
- Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Wisconsin Alumni Research Foundation
- University of Wisconsin-Madison
- Division of Graduate Education
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Sentiment Analysis and Opinion Mining
- Keywords
- word embeddings, character n-grams, out-of-vocabulary words, rare words, word similarity, part-of-speech tagging, multilingual word representation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalizing Word Embeddings using Bag of Subwords. https://app.cochat.ai/papers/10.18653/v1/d18-1059
- The paper
- Zhao, J., Mudgal, S., & Liang, Y. (2018). Generalizing Word Embeddings using Bag of Subwords. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/d18-1059
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.