English
Related papers

Related papers: Combining Hand-crafted Rules and Unsupervised Lear…

200 papers

We propose to cast the task of morphological inflection - mapping a lemma to an indicated inflected form - for resource-poor languages as a meta-learning problem. Treating each language as a separate task, we use data from high-resource…

Computation and Language · Computer Science 2020-04-29 Katharina Kann , Samuel R. Bowman , Kyunghyun Cho

Recognizing shallow linguistic patterns, such as basic syntactic relationships between words, is a common task in applied natural language and text processing. The common practice for approaching this task is by tedious manual definition of…

cmp-lg · Computer Science 2007-05-23 Shlomo Argamon , Ido Dagan , Yuval Krymolowski

We propose a new unsupervised method for lexical substitution using pre-trained language models. Compared to previous approaches that use the generative capability of language models to predict substitutes, our method retrieves substitutes…

Computation and Language · Computer Science 2022-09-20 Takashi Wada , Timothy Baldwin , Yuji Matsumoto , Jey Han Lau

In the last few years, neural networks have been intensively used to develop meaningful distributed representations of words and contexts around them. When these representations, also known as "embeddings", are learned from unsupervised…

Computation and Language · Computer Science 2019-08-07 Giuseppe Marra , Andrea Zugarini , Stefano Melacci , Marco Maggini

We present a novel incremental learning approach for unsupervised word segmentation that combines features from probabilistic modeling and model selection. This includes super-additive penalties for addressing the cognitive burden imposed…

Computation and Language · Computer Science 2016-09-26 Ruey-Cheng Chen

In this paper, we focus on the challenge of learning controllable text simplifications in unsupervised settings. While this problem has been previously discussed for supervised learning algorithms, the literature on the analogies in…

Computation and Language · Computer Science 2020-12-04 Oleg Kariuk , Dima Karamshuk

Unsupervised learning methods have a soft inspiration in cognition models. To this day, the most successful unsupervised learning methods revolve around clustering samples in a mathematical space. In this paper we propose a primitive-based,…

Artificial Intelligence · Computer Science 2025-07-04 Alfredo Ibias , Hector Antona , Guillem Ramirez-Miranda , Enric Guinovart , Eduard Alarcon

This paper presents a joint model for performing unsupervised morphological analysis on words, and learning a character-level composition function from morphemes to word embeddings. Our model splits individual words into segments, and…

Computation and Language · Computer Science 2016-06-09 Kris Cao , Marek Rei

In this paper, we introduce a trie-structured Bayesian model for unsupervised morphological segmentation. We adopt prior information from different sources in the model. We use neural word embeddings to discover words that are…

Computation and Language · Computer Science 2017-04-25 Murathan Kurfalı , Ahmet Üstün , Burcu Can

We present a system for bottom-up cumulative learning of myriad concepts corresponding to meaningful character strings, and their part-related and prediction edges. The learning is self-supervised in that the concepts discovered are used as…

Machine Learning · Computer Science 2021-12-20 Omid Madani

We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disambiguation. We view this problem as that of estimating a…

cmp-lg · Computer Science 2007-05-23 Hang Li , Naoki Abe

Offline handwriting recognition (HWR) has improved significantly with the advent of deep learning architectures in recent years. Nevertheless, it remains a challenging problem and practical applications often rely on post-processing…

Computer Vision and Pattern Recognition · Computer Science 2023-09-20 Andrey Totev , Tomas Ward

Data-driven subword segmentation has become the default strategy for open-vocabulary machine translation and other NLP tasks, but may not be sufficiently generic for optimal learning of non-concatenative morphology. We design a test suite…

Computation and Language · Computer Science 2021-09-03 Chantal Amrhein , Rico Sennrich

This study addresses a series of methodological questions that arise when modeling inflectional morphology with Linear Discriminative Learning. Taking the semi-productive German noun system as example, we illustrate how decisions made about…

Computation and Language · Computer Science 2021-11-19 Maria Heitmeier , Yu-Ying Chuang , R. Harald Baayen

Memorization in large language models has been studied almost exclusively through prefix-conditioned extraction, a natural choice for autoregressive models. However, diffusion language models (DLMs) can denoise masked tokens at arbitrary…

Computation and Language · Computer Science 2026-05-26 Yihan Wang , N. Asokan

We develop a representation suitable for the unconstrained recognition of words in natural images: the general case of no fixed lexicon and unknown length. To this end we propose a convolutional neural network (CNN) based architecture which…

Computer Vision and Pattern Recognition · Computer Science 2015-04-13 Max Jaderberg , Karen Simonyan , Andrea Vedaldi , Andrew Zisserman

The data drawn from biological, economic, and social systems are often confounded due to the presence of unmeasured variables. Prior work in causal discovery has focused on discrete search procedures for selecting acyclic directed mixed…

Machine Learning · Computer Science 2021-02-26 Rohit Bhattacharya , Tushar Nagarajan , Daniel Malinsky , Ilya Shpitser

We propose a novel approach to translating from a morphologically complex language. Unlike previous research, which has targeted word inflections and concatenations, we focus on the pairwise relationship between morphologically related…

Computation and Language · Computer Science 2021-09-29 Preslav Nakov , Hwee Tou Ng

We consider the problem of disambiguating the lemma and part of speech of ambiguous words in morphologically rich languages. We propose a method for disambiguating ambiguous words in context, using a large un-annotated corpus of text, and a…

Computation and Language · Computer Science 2020-07-14 José María Hoya Quecedo , Maximilian W. Koppatz , Giacomo Furlan , Roman Yangarber

Conditional text generation often requires lexical constraints, i.e., which words should or shouldn't be included in the output text. While the dominant recipe for conditional text generation has been large-scale pretrained language models…

Computation and Language · Computer Science 2021-04-22 Ximing Lu , Peter West , Rowan Zellers , Ronan Le Bras , Chandra Bhagavatula , Yejin Choi