Piotr Bojanowski, Édouard Grave, Armand Joulin, Tomáš Mikolov · Transactions of the Association for Computational Linguistics 2017 · 2017
DOI: 10.1162/tacl_a_00051
Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).
Continuous word representations, trained on large unlabeled corpora are useful for many natural language processing tasks. Popular models that learn such representations ignore the morphology of words, by assigning a distinct vector to each word. This is a limitation, especially for languages with large vocabularies and many rare words. In this paper, we propose a new approach based on the skipgram model, where each word is represented as a bag of character n-grams. A vector representation is associated to each character n-gram; words being represented as the sum of these representations. Our method is fast, allowing to train models on large corpora quickly and allows us to compute word representations for words that did not appear in the training data. We evaluate our word representations on nine different languages, both on word similarity and analogy tasks. By comparing to recently proposed morphological word representations, we show that our vectors achieve state-of-the-art performance on these tasks.
Last synced
Electronics 2026 · 0 citations
Computers 2026 · 0 citations
International Journal of Testing 2026 · 0 citations
Engineering Technology & Applied Science Research 2026 · 0 citations
Engineering Technology & Applied Science Research 2026 · 0 citations
ACM Transactions on Asian and Low-Resource Language Information Processing 2026 · 0 citations
電腦學刊 2026 · 0 citations
No comments yet — start the discussion below.