paper-with-me

홈 › Papers

Unsupervised Declarative Knowledge Induction for Constraint-Based Learning of Information Structure in Scientific Documents

2015-01-01 · TACL 2015 1 · Yufan Guo, Roi Reichart, Anna Korhonen

Inferring the information structure of scientific documents is useful for many NLP applications. Existing approaches to this task require substantial human effort. We propose a framework for constraint learning that reduces human involvement considerably. Our model uses topic models to identify latent topics and their key linguistic features in input documents, induces constraints from this information and maps sentences to their dominant information structure categories through a constrained unsupervised model. When the induced constraints are combined with a fully unsupervised model, the resulting model challenges existing lightly supervised feature-based models as well as unsupervised models that use manually constructed declarative knowledge. Our results demonstrate that useful declarative knowledge can be learned from data with very limited human involvement.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Topic Models

Similar Papers 제목 키워드 기반

Evaluating Induced CCG Parsers on Grounded Semantic Parsing

2016-09-29 · EMNLP 2016 11 · Yonatan Bisk, Siva Reddy, John Blitzer, Julia Hockenmaier 외

We compare the effectiveness of four different syntactic CCG parsers for a semantic slot-filling task to explore how much syntactic supervision is required for downstream semantic analysis. This extrinsic, task-based eva…

Semantic Parsingslot-fillingSlot Filling

Unsupervised Learning of PCFGs with Normalizing Flow

2019-07-01 · ACL 2019 7 · Lifeng Jin, Finale Doshi-Velez, Timothy Miller, Lane Schwartz 외

Unsupervised PCFG inducers hypothesize sets of compact context-free rules as explanations for sentences. PCFG induction not only provides tools for low-resource languages, but also plays an important role in modeling lan…

Language Acquisition

Coinduction Plain and Simple

2020-07-20 · François Bry

Coinduction refers to both a technique for the definition of infinite streams, so-called codata, and a technique for proving the equality of coinductively specified codata. This article first reviews coinduction in decla…

Spatial Symmetry Driven Pruning Strategies for Efficient Declarative Spatial Reasoning

2015-06-16 · Carl Schultz, Mehul Bhatt

Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representatio…

Spatial Reasoning

Character-based PCFG Induction for Modeling the Syntactic Acquisition of Morphologically Rich Languages

2021-11-01 · Findings (EMNLP) 2021 11 · Lifeng Jin, Byung-Doh Oh, William Schuler

Unsupervised PCFG induction models, which build syntactic structures from raw text, can be used to evaluate the extent to which syntactic knowledge can be acquired from distributional information alone. However, many sta…