中文
相关论文

相关论文: Unsupervised Parsing by Searching for Frequent Wor…

200 篇论文

Past work on unsupervised parsing is constrained to written form. In this paper, we present the first study on unsupervised spoken constituency parsing given unlabeled spoken sentences and unpaired textual data. The goal is to determine the…

计算与语言 · 计算机科学 2023-05-10 Yuan Tseng , Cheng-I Lai , Hung-yi Lee

We propose a method for unsupervised parsing based on the linguistic notion of a constituency test. One type of constituency test involves modifying the sentence via some transformation (e.g. replacing the span with a pronoun) and then…

计算与语言 · 计算机科学 2020-10-08 Steven Cao , Nikita Kitaev , Dan Klein

Computing universal distributed representations of sentences is a fundamental task in natural language processing. We propose ConsSent, a simple yet surprisingly powerful unsupervised method to learn such representations by enforcing…

计算与语言 · 计算机科学 2019-01-25 Siddhartha Brahma

Previous works have demonstrated the effectiveness of utilising pre-trained sentence encoders based on their sentence representations for meaning comparison tasks. Though such representations are shown to capture hidden syntax structures,…

计算与语言 · 计算机科学 2022-10-12 Qiwei Peng , David Weir , Julie Weeds

Unsupervised constituency parsing has been explored much but is still far from being solved. Conventional unsupervised constituency parser is only able to capture the unlabeled structure of sentences. Towards unsupervised full constituency…

计算与语言 · 计算机科学 2021-11-01 Letian Peng , Zuchao Li , Hai Zhao

We investigate the unsupervised constituency parsing task, which organizes words and phrases of a sentence into a hierarchical structure without using linguistically annotated data. We observe that existing unsupervised parsers capture…

计算与语言 · 计算机科学 2024-04-29 Behzad Shayegh , Yanshuai Cao , Xiaodan Zhu , Jackie C. K. Cheung , Lili Mou

We introduce a method for unsupervised parsing that relies on bootstrapping classifiers to identify if a node dominates a specific span in a sentence. There are two types of classifiers, an inside classifier that acts on a span, and an…

计算与语言 · 计算机科学 2022-03-22 Nickil Maveli , Shay B. Cohen

In order to achieve deep natural language understanding, syntactic constituent parsing is a vital step, highly demanded by many artificial intelligence systems to process both text and speech. One of the most recent proposals is the use of…

计算与语言 · 计算机科学 2022-12-26 Daniel Fernández-González , Carlos Gómez-Rodríguez

In this paper, we focus on the problem of unsupervised image-sentence matching. Existing research explores to utilize document-level structural information to sample positive and negative instances for model training. Although the approach…

计算机视觉与模式识别 · 计算机科学 2021-04-07 Zejun Li , Zhongyu Wei , Zhihao Fan , Haijun Shan , Xuanjing Huang

Syntactic structure of sentences in a document substantially informs about its authorial writing style. Sentence representation learning has been widely explored in recent years and it has been shown that it improves the generalization of…

计算与语言 · 计算机科学 2022-02-25 Fereshteh Jafariakinabad , Kien A. Hua

Syntactic and semantic parsing has been investigated for decades, which is one primary topic in the natural language processing community. This article aims for a brief survey on this topic. The parsing community includes many tasks, which…

计算与语言 · 计算机科学 2020-06-22 Meishan Zhang

Unsupervised sentence representation learning is one of the fundamental problems in natural language processing with various downstream applications. Recently, contrastive learning has been widely adopted which derives high-quality sentence…

计算与语言 · 计算机科学 2023-05-29 Jiduan Liu , Jiahao Liu , Qifan Wang , Jingang Wang , Wei Wu , Yunsen Xian , Dongyan Zhao , Kai Chen , Rui Yan

Existing approaches in disfluency detection focus on solving a token-level classification task for identifying and removing disfluencies in text. Moreover, most works focus on leveraging only contextual information captured by the linear…

计算与语言 · 计算机科学 2022-04-19 Sreyan Ghosh , Sonal Kumar , Yaman Kumar Singla , Rajiv Ratn Shah , S. Umesh

In this paper, we present a novel cross-consistency based semi-supervised approach for semantic segmentation. Consistency training has proven to be a powerful semi-supervised learning framework for leveraging unlabeled data under the…

计算机视觉与模式识别 · 计算机科学 2020-06-11 Yassine Ouali , Céline Hudelot , Myriam Tami

Headedness is widely used as an organizing device in syntactic analysis, yet constituency treebanks rarely encode it explicitly and most processing pipelines recover it procedurally via percolation rules. We treat this notion of constituent…

计算与语言 · 计算机科学 2026-03-17 Zeyao Qi , Yige Chen , KyungTae Lim , Haihua Pan , Jungyeul Park

RST-style discourse parsing plays a vital role in many NLP tasks, revealing the underlying semantic/pragmatic structure of potentially complex and diverse documents. Despite its importance, one of the most prevailing limitations in modern…

计算与语言 · 计算机科学 2021-12-14 Patrick Huber , Linzi Xing , Giuseppe Carenini

Naturally-occurring bracketings, such as answer fragments to natural language questions and hyperlinks on webpages, can reflect human syntactic intuition regarding phrasal boundaries. Their availability and approximate correspondence to…

计算与语言 · 计算机科学 2021-04-30 Tianze Shi , Ozan İrsoy , Igor Malioutov , Lillian Lee

The compositionality degree of multiword expressions indicates to what extent the meaning of a phrase can be derived from the meaning of its constituents and their grammatical relations. Prediction of (non)-compositionality is a task that…

计算与语言 · 计算机科学 2019-06-10 Abhik Jana , Dmitry Puzyrev , Alexander Panchenko , Pawan Goyal , Chris Biemann , Animesh Mukherjee

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…

计算与语言 · 计算机科学 2013-12-31 Tamal Chowdhury , Rabindra Rakshit , Arko Banerjee

We propose a novel constituency parsing model that casts the parsing problem into a series of pointing tasks. Specifically, our model estimates the likelihood of a span being a legitimate tree constituent via the pointing score…

计算与语言 · 计算机科学 2020-06-25 Thanh-Tung Nguyen , Xuan-Phi Nguyen , Shafiq Joty , Xiaoli Li
‹ 上一页 1 2 3 10 下一页 ›