paper-with-me

홈 › Papers

A weakly supervised sequence tagging and grammar induction approach to semantic frame slot filling

2019-06-15 · Janneke van de Loo, Guy De Pauw, Walter Daelemans

This paper describes continuing work on semantic frame slot filling for a command and control task using a weakly-supervised approach. We investigate the advantages of using retraining techniques that take the output of a hierarchical hidden markov model as input to two inductive approaches: (1) discriminative sequence labelers based on conditional random fields and memory-based learning and (2) probabilistic context-free grammar induction. Experimental results show that this setup can significantly improve F-scores without the need for additional information sources. Furthermore, qualitative analysis shows that the weakly supervised technique is able to automatically induce an easily interpretable and syntactically appropriate grammar for the domain and task at hand.

📄 PDF Abstract BibTeX arXiv:1906.06493

Code (0)

등록된 구현이 없습니다.

Tasks

slot-fillingSlot Filling

Similar Papers 제목 키워드 기반

Variance of Average Surprisal: A Better Predictor for Quality of Grammar from Unsupervised PCFG Induction

2019-07-01 · ACL 2019 7 · Lifeng Jin, William Schuler

In unsupervised grammar induction, data likelihood is known to be only weakly correlated with parsing accuracy, especially at convergence after multiple runs. In order to find a better indicator for quality of induced gr…

Model Selection

Unsupervised Grammar Induction with Depth-bounded PCFG

2018-02-23 · TACL 2018 1 · Lifeng Jin, Finale Doshi-Velez, Timothy Miller, William Schuler 외

There has been recent interest in applying cognitively or empirically motivated bounds on recursion depth to limit the search space of grammar induction models (Ponvert et al., 2011; Noji and Johnson, 2016; Shain et al.,…

Guiding Symbolic Natural Language Grammar Induction via Transformer-Based Sequence Probabilities

2020-05-26 · Ben Goertzel, Andres Suarez Madrigal, Gino Yu

A novel approach to automated learning of syntactic rules governing natural languages is proposed, based on using probabilities assigned to sentences (and potentially longer word sequences) by transformer neural network …

Clustering

Parallel Algorithms for Unsupervised Tagging

2014-01-01 · TACL 2014 1 · Sujith Ravi, Sergei Vassilivitskii, Vibhor Rastogi

We propose a new method for unsupervised tagging that finds minimal models which are then further improved by Expectation Maximization training. In contrast to previous approaches that rely on manually specified and mult…

Part-Of-Speech Tagging

Fine-Grained Prediction of Syntactic Typology: Discovering Latent Structure with Supervised Learning

2017-10-11 · TACL 2017 1 · Dingquan Wang, Jason Eisner

We show how to predict the basic word-order facts of a novel language given only a corpus of part-of-speech (POS) sequences. We predict how often direct objects follow their verbs, how often adjectives follow their nouns…

POS