中文
相关论文

相关论文: Unsupervised Learning of Morphology without Morphe…

200 篇论文

Word representation is a fundamental component in neural language understanding models. Recently, pre-trained language models (PrLMs) offer a new performant method of contextualized word representations by leveraging the sequence-level…

计算与语言 · 计算机科学 2021-01-01 Zhuosheng Zhang , Haojie Yu , Hai Zhao , Rui Wang , Masao Utiyama

Many NLP applications require disambiguating polysemous words. Existing methods that learn polysemous word vector representations involve first detecting various senses and optimizing the sense-specific embeddings separately, which are…

计算与语言 · 计算机科学 2017-08-16 Yifan Sun , Nikhil Rao , Weicong Ding

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…

计算与语言 · 计算机科学 2025-07-22 Pretam Ray , Jivnesh Sandhan , Amrith Krishna , Pawan Goyal

We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the…

动力系统 · 数学 2022-10-18 Marie-Pierre Béal , Dominique Perrin , Antonio Restivo

The past years have seen a drastic rise in studies devoted to the investigation of colexification patterns in individual languages families in particular and the languages of the world in specific. Specifically computational studies have…

计算与语言 · 计算机科学 2023-02-03 Johann-Mattis List

We present an integrated architecture for word-level and sentence-level processing in a unification-based paradigm. The core of the system is a CLP implementation of a unification engine for feature structures supporting relational values.…

cmp-lg · 计算机科学 2008-02-03 Harald Trost , Johannes Matiasek

The morphological systems of natural languages are replete with examples of the same devices used for multiple purposes: (1) the same type of morphological process (for example, suffixation for both noun case and verb tense) and (2)…

cmp-lg · 计算机科学 2008-02-03 Michael Gasser

This study presents a new approach to metaphorical paraphrase generation by masking literal tokens of literal sentences and unmasking them with metaphorical language models. Unlike similar studies, the proposed algorithm does not only focus…

计算与语言 · 计算机科学 2022-10-14 Giorgio Ottolina , John Pavlopoulos

In this paper, we reproduce the experiments of Artetxe et al. (2018b) regarding the robust self-learning method for fully unsupervised cross-lingual mappings of word embeddings. We show that the reproduction of their method is indeed…

机器学习 · 计算机科学 2020-03-04 Nicolas Garneau , Mathieu Godbout , David Beauchemin , Audrey Durand , Luc Lamontagne

We introduce CSAR, an algorithm for inducing morphemes from emergent language corpora of parallel utterances and meanings. It is a greedy algorithm that (1) weights morphemes based on mutual information between forms and meanings, (2)…

计算与语言 · 计算机科学 2025-10-07 Brendon Boldt , David Mortensen

We present in this paper a novel framework for morpheme segmentation which uses the morpho-syntactic regularities preserved by word representations, in addition to orthographic features, to segment words into morphemes. This framework is…

计算与语言 · 计算机科学 2017-05-02 Tarek Sakakini , Suma Bhat , Pramod Viswanath

Critical to natural language generation is the production of correctly inflected text. In this paper, we isolate the task of predicting a fully inflected sentence from its partially lemmatized version. Unlike traditional morphological…

计算与语言 · 计算机科学 2019-05-07 Ekaterina Vylomova , Ryan Cotterell , Timothy Baldwin , Trevor Cohn , Jason Eisner

This paper presents a model-based, unsupervised algorithm for recovering word boundaries in a natural-language text from which they have been deleted. The algorithm is derived from a probability model of the source that generated the text.…

计算与语言 · 计算机科学 2007-05-23 Michael R. Brent

The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…

形式语言与自动机理论 · 计算机科学 2021-03-10 Dolav Nitay , Dana Fisman , Michal Ziv-Ukelson

Scenarios in which restrictions in data transfer and storage limit the possibility to compose a single dataset -- also exploiting different data sources -- to perform a batch-based training procedure, make the development of robust models…

计算机视觉与模式识别 · 计算机科学 2023-07-31 Lorenzo Pellegrini , Guido Borghi , Annalisa Franco , Davide Maltoni

Cross-lingual word embeddings aim to capture common linguistic regularities of different languages, which benefit various downstream tasks ranging from machine translation to transfer learning. Recently, it has been shown that these…

计算与语言 · 计算机科学 2018-11-02 Pengcheng Yang , Fuli Luo , Shuangzhi Wu , Jingjing Xu , Dongdong Zhang , Xu Sun

We present three innovations in tokenization and subword segmentation. First, we propose to use unsupervised morphological analysis with Morfessor as pre-tokenization. Second, we present an algebraic method for obtaining subword embeddings…

计算与语言 · 计算机科学 2024-10-04 Jindřich Libovický , Jindřich Helcl

Human languages expand vocabularies by combining existing morphemes rather than inventing arbitrary forms. Communicative efficiency shapes lexical systems at multiple levels (Gibson et al., 2019), yet morphological composition -- combining…

计算与语言 · 计算机科学 2026-05-06 Fengyuan Yang , Yongqian Peng , Yuxi Ma , Chenheng Xu , Yixin Zhu

Cross-situational word learning, wherein a learner combines information about possible meanings of a word across multiple exposures, has previously been shown to be a very powerful strategy to acquire a large lexicon in a short time.…

物理与社会 · 物理学 2018-10-01 James Holehouse , Richard A. Blythe

The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Dana Fisman , Dolav Nitay , Michal Ziv-Ukelson