Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kristian Woodsend

dblp:44/8427 · DBLP profile ↗
← Back
10ranked-venue papers
9as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 10 · 9 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
8 papers
Information extraction and text analysis · 46% Language models and text generation · 45% Deep learning architectures and training · 4%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 67% High-performance computing · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
semantic role labeling
0.732017
Text Rewriting Improves Semantic Role Labeling (Extended Abstract) · IJCAI 2017
Distributed Representations for Unsupervised Semantic Role Labeling · EMNLP 2015
Composition of Word Representations Improves Semantic Role Labelling · EMNLP 2014
Natural language and speech › Language models and text generation
text summarization
0.322012
Multiple Aspect Summarization Using Integer Linear Programming · EMNLP-CoNLL 2012
Automatic Generation of Story Highlights · ACL 2010
Natural language and speech › Language models and text generation › text generation
text simplification
0.222011
Learning to Simplify Sentences with Quasi-Synchronous Grammar and Integer Programming · EMNLP 2011
WikiSimple: Automatic Simplification of Wikipedia Articles · AAAI 2011
Natural language and speech › Information extraction and text analysis › semantic role labeling
unsupervised semantic role labeling
0.212015
Distributed Representations for Unsupervised Semantic Role Labeling · EMNLP 2015
Natural language and speech › Language models and text generation › text summarization › opinion summarization
aspect-based summarization
0.112012
Multiple Aspect Summarization Using Integer Linear Programming · EMNLP-CoNLL 2012
Natural language and speech › Language models and text generation › text generation › text simplification
sentence simplification
0.112011
Learning to Simplify Sentences with Quasi-Synchronous Grammar and Integer Programming · EMNLP 2011
Natural language and speech › Language models and text generation › text summarization
title generation
0.112010
Title Generation with Quasi-Synchronous Grammar · EMNLP 2010
Parallel and multicore computing › parallel programming models › hybrid programming models
hybrid MPI/OpenMP
0.112009
Hybrid MPI/OpenMP Parallel Linear Support Vector Machine Training · J. Mach. Learn. Res. 2009
Parallel and multicore computing
parallel programming models
0.112009
Hybrid MPI/OpenMP Parallel Linear Support Vector Machine Training · J. Mach. Learn. Res. 2009
High-performance computing
scientific computing systems
0.112009
Hybrid MPI/OpenMP Parallel Linear Support Vector Machine Training · J. Mach. Learn. Res. 2009
Machine learning › Deep learning architectures and training
data augmentation
0.112017
Text Rewriting Improves Semantic Role Labeling (Extended Abstract) · IJCAI 2017
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.112014
Composition of Word Representations Improves Semantic Role Labelling · EMNLP 2014

Methods — techniques the papers use, named apart from their topics

quasi-synchronous grammar · 0.5integer linear programming · 0.4text rewriting · 0.3automatic rewrite rule extraction · 0.3linear programming · 0.2hierarchical clustering · 0.2distributed representations · 0.2representation composition · 0.2distributional word representations · 0.2integer programming · 0.1support vector machine training · 0.1OpenMP · 0.1MPI · 0.1
YearPublicationVenuePosition
2017 Text Rewriting Improves Semantic Role Labeling (Extended Abstract)
abstract
Large-scale annotated corpora are a prerequisite to developing high-performance NLP systems. Such corpora are expensive to produce, limited in size, often demanding linguistic expertise. In this paper we use text rewriting as a means of increasing the amount of labeled data available for model training. Our method uses automatically extracted rewrite rules from comparable corpora and bitexts to generate multiple versions of sentences annotated with gold standard labels. We apply this idea to semantic role labeling and show that a model trained on rewritten data outperforms the state of the art on the CoNLL-2009 benchmark dataset.
Kristian Woodsend, Mirella Lapata
IJCAI1
2015 Distributed Representations for Unsupervised Semantic Role Labeling
abstract
We present a new approach for unsupervised semantic role labeling that leverages distributed representations.We induce embeddings to represent a predicate, its arguments and their complex interdependence.Argument embeddings are learned from surrounding contexts involving the predicate and neighboring arguments, while predicate embeddings are learned from argument contexts.The induced representations are clustered into roles using a linear programming formulation of hierarchical clustering, where we can model task-specific knowledge.Experiments show improved performance over previous unsupervised semantic role labeling approaches and other distributed word representation models.
Kristian Woodsend, Mirella Lapata
EMNLP1
2014 Composition of Word Representations Improves Semantic Role Labelling
abstract
State-of-the-art semantic role labelling systems require large annotated corpora to achieve full performance.Unfortunately, such corpora are expensive to produce and often do not generalize well across domains.Even in domain, errors are often made where syntactic information does not provide sufficient cues.In this paper, we mitigate both of these problems by employing distributional word representations gathered from unlabelled data.While straight-forward word representations of predicates and arguments improve performance, we show that further gains are achieved by composing representations that model the interaction between predicate and argument, and capture full argument spans.
Michael Roth 0001, Kristian Woodsend
EMNLP2
2014 Text Rewriting Improves Semantic Role Labeling
abstract
Large-scale annotated corpora are a prerequisite to developing high-performance NLP systems. Such corpora are expensive to produce, limited in size, often demanding linguistic expertise. In this paper we use text rewriting as a means of increasing the amount of labeled data available for model training. Our method uses automatically extracted rewrite rules from comparable corpora and bitexts to generate multiple versions of sentences annotated with gold standard labels. We apply this idea to semantic role labeling and show that a model trained on rewritten data outperforms the state of the art on the CoNLL-2009 benchmark dataset.
Kristian Woodsend, Mirella Lapata
J. Artif. Intell. Res.1
2012 Multiple Aspect Summarization Using Integer Linear Programming
Kristian Woodsend, Mirella Lapata
EMNLP-CoNLL1
2011 WikiSimple: Automatic Simplification of Wikipedia Articles
abstract
Text simplification aims to rewrite text into simpler versions and thus make information accessible to a broader audience (e.g., non-native speakers, children, and individuals with language impairments). In this paper, we propose a model that simplifies documents automatically while selecting their most important content and rewriting them in a simpler style. We learn content selection rules from same-topic Wikipedia articles written in the main encyclopedia and its Simple English variant. We also use the revision histories of Simple Wikipedia articles to learn a quasi-synchronous grammar of simplification rewrite rules. Based on an integer linear programming formulation, we develop a joint model where preferences based on content and style are optimized simultaneously. Experiments on simplifying main Wikipedia articles show that our method significantly reduces the reading difficulty, while still capturing the important content.
Kristian Woodsend, Mirella Lapata
AAAI1
2011 Learning to Simplify Sentences with Quasi-Synchronous Grammar and Integer Programming
Kristian Woodsend, Mirella Lapata
EMNLP1
2010 Automatic Generation of Story Highlights
Kristian Woodsend, Mirella Lapata
ACL1
2010 Title Generation with Quasi-Synchronous Grammar
Kristian Woodsend, Yansong Feng 0002, Mirella Lapata
EMNLP1
2009 Hybrid MPI/OpenMP Parallel Linear Support Vector Machine Training
Kristian Woodsend, Jacek Gondzio
J. Mach. Learn. Res.1