English
Related papers

Related papers: Efficient Induction of Language Models Via Probabi…

200 papers

Words unknown to the lexicon present a substantial problem to part-of-speech tagging. In this paper we present a technique for fully unsupervised statistical acquisition of rules which guess possible parts-of-speech for unknown words. Three…

cmp-lg · Computer Science 2008-02-03 Andrei Mikheev

In the present paper we show that distributional information is particularly important when considering concept availability under implicit language learning conditions. Based on results from different behavioural experiments we argue that…

Computation and Language · Computer Science 2016-06-30 Dimitrios Alikaniotis , John N. Williams

This article introduces a novel and fast method for refining pre-trained static word or, more generally, token embeddings. By incorporating the embeddings of neighboring tokens in text corpora, it continuously updates the representation of…

Computation and Language · Computer Science 2025-04-22 Mario M. Kubek , Shiraj Pokharel , Thomas Böhme , Emma L. McDaniel , Herwig Unger , Armin R. Mikler

Document classification tasks were primarily tackled at word level. Recent research that works with character-level inputs shows several benefits over word-level approaches such as natural incorporation of morphemes and better handling of…

Computation and Language · Computer Science 2016-02-02 Yijun Xiao , Kyunghyun Cho

In this paper, we address the task of learning novel visual concepts, and their interactions with other concepts, from a few images with sentence descriptions. Using linguistic context and visual features, our method is able to efficiently…

Computer Vision and Pattern Recognition · Computer Science 2015-10-05 Junhua Mao , Wei Xu , Yi Yang , Jiang Wang , Zhiheng Huang , Alan Yuille

Word embeddings are a fixed, distributional representation of the context of words in a corpus learned from word co-occurrences. Despite their proven utility in machine learning tasks, word embedding models may capture uneven semantic and…

Computation and Language · Computer Science 2021-10-07 James Powell , Kari Sentz , Martin Klein

Topic models such as LDA, DocNADE, iDocNADEe have been popular in document analysis. However, the traditional topic models have several limitations including: (1) Bag-of-words (BoW) assumption, where they ignore word ordering, (2) Data…

Information Retrieval · Computer Science 2019-10-01 Yatin Chaudhary , Pankaj Gupta , Thomas Runkler

Low dimensional representations of words allow accurate NLP models to be trained on limited annotated data. While most representations ignore words' local context, a natural way to induce context-dependent representations is to perform…

Machine Learning · Statistics 2015-06-02 David Belanger , Sham Kakade

We present a simple yet effective approach for learning word sense embeddings. In contrast to existing techniques, which either directly learn sense representations from corpora or rely on sense inventories from lexical resources, our…

Computation and Language · Computer Science 2017-08-14 Maria Pelevina , Nikolay Arefyev , Chris Biemann , Alexander Panchenko

Sentence embedding tasks are important in natural language processing (NLP), but improving their performance while keeping them reliable is still hard. This paper presents a framework that combines pseudo-label generation and model ensemble…

Computation and Language · Computer Science 2025-01-28 Ziwei Liu , Qi Zhang , Lifu Gao

We propose a new model for learning bilingual word representations from non-parallel document-aligned data. Following the recent advances in word representation learning, our model learns dense real-valued word vectors, that is, bilingual…

Computation and Language · Computer Science 2016-03-01 Ivan Vulić , Marie-Francine Moens

Using attention weights to identify information that is important for models' decision-making is a popular approach to interpret attention-based neural networks. This is commonly realized in practice through the generation of a heat-map for…

Information Retrieval · Computer Science 2021-06-01 Tian Shi , Xuchao Zhang , Ping Wang , Chandan K. Reddy

Word embeddings are trained to predict word cooccurrence statistics, which leads them to possess different lexical properties (syntactic, semantic, etc.) depending on the notion of context defined at training time. These properties manifest…

Computation and Language · Computer Science 2020-11-06 Jingyi He , KC Tsiolis , Kian Kenyon-Dean , Jackie Chi Kit Cheung

We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our…

Computation and Language · Computer Science 2020-03-31 Yoon Kim , Chris Dyer , Alexander M. Rush

Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collection such as the Internet, there has also been great interest…

Information Retrieval · Computer Science 2012-06-18 Amit Gruber , Michal Rosen-Zvi , Yair Weiss

This article contains a proposal to add coinduction to the computational apparatus of natural language understanding. This, we argue, will provide a basis for more realistic, computationally sound, and scalable models of natural language…

Computation and Language · Computer Science 2020-12-11 Wlodek W. Zadrozny

This thesis presents a language-independent text classification model by introduced two new encoding methods "BUNOW" and "BUNOC" used for feeding the raw text data into a new CNN spatial architecture with vertical and horizontal…

Computation and Language · Computer Science 2019-03-19 Amr Adel Helmy

Word embeddings are a powerful approach for unsupervised analysis of language. Recently, Rudolph et al. (2016) developed exponential family embeddings, which cast word embeddings in a probabilistic framework. Here, we develop dynamic…

Machine Learning · Statistics 2017-03-24 Maja Rudolph , David Blei

Structured language models for speech recognition have been shown to remedy the weaknesses of n-gram models. All current structured language models are, however, limited in that they do not take into account dependencies between…

Computation and Language · Computer Science 2007-05-23 Rens Bod

Current state-of-the-art models for natural language understanding require a preprocessing step to convert raw text into discrete tokens. This process known as tokenization relies on a pre-built vocabulary of words or sub-word morphemes.…

Computation and Language · Computer Science 2023-05-31 Li Sun , Florian Luisier , Kayhan Batmanghelich , Dinei Florencio , Cha Zhang