English
Related papers

Related papers: An Unsupervised Method for Uncovering Morphologica…

200 papers

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 build morphological chains for agglutinative languages by using a log-linear model for the morphological segmentation task. The model is based on the unsupervised morphological segmentation system called MorphoChains. We…

Computation and Language · Computer Science 2017-05-08 Serkan Ozen , Burcu Can

We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to discover morphologically related pairs by looking for pairs…

Computation and Language · Computer Science 2007-05-23 Marco Baroni , Johannes Matiasek , Harald Trost

We propose the task of unsupervised morphological paradigm completion. Given only raw text and a lemma list, the task consists of generating the morphological paradigms, i.e., all inflected forms, of the lemmas. From a natural language…

Computation and Language · Computer Science 2020-05-22 Huiming Jin , Liwei Cai , Yihui Peng , Chen Xia , Arya D. McCarthy , Katharina Kann

We propose an unsupervised method for detecting loanwords i.e., words borrowed from one language into another. While prior work has primarily relied on language-external information to identify loanwords, such approaches can introduce…

Computation and Language · Computer Science 2025-08-26 Promise Dodzi Kpoglu

We present a state-of-the-art neural approach to the unsupervised reconstruction of ancient word forms. Previous work in this domain used expectation-maximization to predict simple phonological changes between ancient word forms and their…

Computation and Language · Computer Science 2022-11-17 Andre He , Nicholas Tomlin , Dan Klein

Word alignment is an important natural language processing task that indicates the correspondence between natural languages. Recently, unsupervised learning of log-linear models for word alignment has received considerable attention as it…

Computation and Language · Computer Science 2014-10-13 Yang Liu , Maosong Sun

This paper focuses on unsupervised modeling of morphological families, collectively comprising a forest over the language vocabulary. This formulation enables us to capture edgewise properties reflecting single-step morphological…

Computation and Language · Computer Science 2017-02-24 Jiaming Luo , Karthik Narasimhan , Regina Barzilay

This thesis investigates how the sub-structure of words can be accounted for in probabilistic models of language. Such models play an important role in natural language processing tasks such as translation or speech recognition, but often…

Computation and Language · Computer Science 2015-08-19 Jan A. Botha

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

Learning representations for semantic relations is important for various tasks such as analogy detection, relational search, and relation classification. Although there have been several proposals for learning representations for individual…

Computation and Language · Computer Science 2015-05-04 Danushka Bollegala , Takanori Maehara , Ken-ichi Kawarabayashi

We propose an unsupervised method for the reconstruction of protoforms i.e., ancestral word forms from which modern language forms are derived. While prior work has primarily relied on probabilistic models of phonological edits to infer…

Computation and Language · Computer Science 2025-06-13 Promise Dodzi Kpoglu

Fully data-driven, deep learning-based models are usually designed as language-independent and have been shown to be successful for many natural language processing tasks. However, when the studied language is low-resourced and the amount…

Computation and Language · Computer Science 2022-09-21 Şaziye Betül Özateş , Arzucan Özgür , Tunga Güngör , Balkız Öztürk

As a cornerstone in language modeling, tokenization involves segmenting text inputs into pre-defined atomic units. Conventional statistical tokenizers often disrupt constituent boundaries within words, thereby corrupting semantic…

Computation and Language · Computer Science 2025-07-11 Qingyang Zhu , Xiang Hu , Pengyu Ji , Wei Wu , Kewei Tu

We explore semantic correspondence estimation through the lens of unsupervised learning. We thoroughly evaluate several recently proposed unsupervised methods across multiple challenging datasets using a standardized evaluation protocol…

Computer Vision and Pattern Recognition · Computer Science 2022-07-12 Mehmet Aygün , Oisin Mac Aodha

When looking at the structure of natural language, "phrases" and "words" are central notions. We consider the problem of identifying such "meaningful subparts" of language of any length and underlying composition principles in a completely…

Computation and Language · Computer Science 2016-02-19 Stefan Gerdjikov , Klaus U. Schulz

Neural dependency parsing has achieved remarkable performance for low resource morphologically rich languages. It has also been well-studied that morphologically rich languages exhibit relatively free word order. This prompts a fundamental…

Computation and Language · Computer Science 2025-07-22 Pretam Ray , Jivnesh Sandhan , Amrith Krishna , Pawan Goyal

We propose an unsupervised method to obtain cross-lingual embeddings without any parallel data or pre-trained word embeddings. The proposed model, which we call multilingual neural language models, takes sentences of multiple languages as…

Computation and Language · Computer Science 2018-09-10 Takashi Wada , Tomoharu Iwata

Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by…

Computation and Language · Computer Science 2016-04-04 Kushal Arora , Anand Rangarajan

In this paper we introduce a method to detect words or phrases in a given sequence of alphabets without knowing the lexicon. Our linear time unsupervised algorithm relies entirely on statistical relationships among alphabets in the input…

Computation and Language · Computer Science 2013-12-31 Tamal Chowdhury , Rabindra Rakshit , Arko Banerjee
‹ Prev 1 2 3 10 Next ›