Improved CCG Parsing with Semi-supervised Supertagging
Current supervised parsers are limited by the size of their labelled training data, making improving them with unlabelled data an important goal. We show how a state-of-the-art CCG parser can be enhanced, by predicting lexical categories using unsupervised vector-space embeddings of words. The use of word embeddings enables our model to better generalize from the labelled data, and allows us to accurately assign lexical categories without depending on a POS-tagger. Our approach leads to substantial improvements in dependency parsing results over the standard supervised CCG parser when evaluated on Wall Street Journal (0.8{\%}), Wikipedia (1.8{\%}) and biomedical (3.4{\%}) text. We compare the performance of two recently proposed approaches for classification using a wide variety of word embeddings. We also give a detailed error analysis demonstrating where using embeddings outperforms traditional feature sets, and showing how including POS features can decrease accuracy.
Code (0)
등록된 구현이 없습니다.
Tasks
CCG SupertaggingDependency ParsingNatural Language InferencePOSQuestion AnsweringStructured PredictionWord EmbeddingsSimilar Papers 제목 키워드 기반
German and French Neural Supertagging Experiments for LTAG Parsing
We present ongoing work on data-driven parsing of German and French with Lexicalized Tree Adjoining Grammars. We use a supertagging approach combined with deep learning. We show the challenges of extracting LTAG supertag…
Dependency ParsingSemantic ParsingSemantic Role LabelingSupertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networks
Supertagging is conventionally regarded as an important task for combinatory categorial grammar (CCG) parsing, where effective modeling of contextual information is highly important to this task. However, existing studie…
CCG SupertaggingRevisiting Supertagging and Parsing: How to Use Supertags in Transition-Based Parsing
Re-thinking Supertags in Linear Context-free Rewriting Systems for Constituency Parsing
Recently, a supertagging-based approach for parsing discontinuous constituent trees with linear context-free rewriting systems (LCFRS) was introduced. We reformulate their algorithm for the extraction of supertags from t…
Constituency ParsingSupertagging-based Parsing with Linear Context-free Rewriting Systems
We present the first supertagging-based parser for LCFRS. It utilizes neural classifiers and tremendously outperforms previous LCFRS-based parsers in both accuracy and parsing speed. Moreover, our results keep up with th…