Бақылаусыз талдау
Related Papers
An All-Subtrees Approach to Unsupervised Parsing
We investigate generalizations of the all- subtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences and next use (a large …...
Evaluating Unsupervised Part-of-Speech Tagging for Grammar Induction
This paper explores the relationship be- tween various measures of unsupervised part-of-speech tag induction and the per- formance of both supervised and unsuper- vised parsing models trained on induced tags. …...
Improved Fully Unsupervised Parsing with Zoomed Learning
We introduce a novel training algorithm for unsupervised grammar induction, called Zoomed Learning. Given a training set T and a test set S, the goal of our algorithm is to …...
Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation
Dependency parsing is a central NLP task. In this paper we show that the common eval- uation for unsupervised dependency parsing is highly sensitive to problematic annotations. We show that …...
Exploiting Reducibility in Unsupervised Dependency Parsing
The possibility of deleting a word from a sen- tence without violating its syntactic correct- ness belongs to traditionally known manifes- tations of syntactic dependency. We introduce a novel unsupervised …...
Three Dependency-and-Boundary Models for Grammar Induction
We present a new family of models for unsu- pervised parsing, Dependency and Boundary models, that use cues at constituent bound- aries to inform head-outward dependency tree generation. We build …...
Unsupervised Dependency Parsing with Acoustic Cues
AbstractUnsupervised parsing is a difficult task that infants readily perform. Progress has been made on this task using text-based models, but few computational approaches have considered how infants might benefit …...
Unsupervised Dependency Parsing: Let’s Use Supervised Parsers
We present a self-training approach to unsu- pervised dependency parsing that reuses exist- ing supervised and unsupervised parsing algo- rithms. Our approach, called ‘iterated rerank- ing’ (IR), starts with dependency …...
Unsupervised Learning of Prototypical Fillers for Implicit Semantic Role Labeling
Gold annotations for supervised implicit se- mantic role labeling are extremely sparse and costly. As a lightweight alternative, this paper describes an approach based on unsupervised parsing which can do …...
Heads-up! Unsupervised Constituency Parsing via Self-Attention Heads
AbstractTransformer-based pre-trained language models (PLMs) have dramatically improved the state of the art in NLP across many tasks. This has led to substantial interest in analyzing the syntactic knowledge PLMs …...
Unsupervised Parsing via Constituency Tests
AbstractWe 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 …...
R2D2: Recursive Transformer based on Differentiable Tree for Interpretable Hierarchical Language Modeling
AbstractHuman language understanding operates at multiple levels of granularity (e.g., words, phrases, and sentences) with increasing levels of abstraction that can be hierarchically combined. However, existing deep models with stacked …...
Rule Augmented Unsupervised Constituency Parsing
Recently, unsupervised parsing of syntactic trees has gained considerable attention. prototypical approach to such unsupervisedA parsing employs reinforcement learning and auto-encoders. However, no mechanism en- sures that the learnt model …...
Co-training an Unsupervised Constituency Parser with Weak Supervision
AbstractWe 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, …...