Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

A Fast Unified Model for Parsing and Sentence Understanding

About

Tree-structured neural networks exploit valuable syntactic parse information as they interpret the meanings of sentences. However, they suffer from two key technical problems that make them slow and unwieldy for large-scale NLP tasks: they usually operate on parsed sentences and they do not directly support batched computation. We address these issues by introducing the Stack-augmented Parser-Interpreter Neural Network (SPINN), which combines parsing and interpretation within a single tree-sequence hybrid model by integrating tree-structured sentence interpretation into the linear sequential structure of a shift-reduce parser. Our model supports batched computation for a speedup of up to 25 times over other tree-structured models, and its integrated parser can operate on unparsed data with little loss in accuracy. We evaluate it on the Stanford NLI entailment task and show that it significantly outperforms other sentence-encoding models.

Samuel R. Bowman, Jon Gauthier, Abhinav Rastogi, Raghav Gupta, Christopher D. Manning, Christopher Potts• 2016

Related benchmarks

TaskDatasetResultRank
Natural Language InferenceSNLI (test)
Accuracy83.3
681
Natural Language InferenceSNLI (train)
Accuracy89.2
154
Sentiment ClassificationStanford Sentiment Treebank SST-2 (test)
Accuracy86.3
99
Paraphrase IdentificationQuora Question Pairs
Accuracy82.6
14
Sentiment ClassificationStanford Sentiment Treebank SST-5 (test)
Accuracy46
10
ParsingSNLI (test)
Transition Acc92.4
1
Showing 6 of 6 rows

Other info

Code

Follow for update