Decomposable Attention Model for Sentence Pair Classification (from https://arxiv.org/abs/1606.01933)
☆95Feb 26, 2017Updated 9 years ago
Alternatives and similar repositories for decomp-attn
Users that are interested in decomp-attn are comparing it to the libraries listed below
Sorting:
- Implementation of the multi feed-forward network architecture by Parikh et al. (2016) for Natural Language Inference.☆87Feb 24, 2018Updated 8 years ago
- Decomposable Attention Model for Sentence Pair Classification (Pytorch Version) from paper 'A Decomposable Attention Model for Natural La…☆71Sep 23, 2018Updated 7 years ago
- Tensorflow implementation of Dynamic Coattention Networks for Question Answering.☆100Dec 4, 2016Updated 9 years ago
- ☆285Sep 14, 2017Updated 8 years ago
- ☆23Sep 4, 2016Updated 9 years ago
- TensorFlow implementation of the Decomposable Attention model (A Decomposable Attention Model for Natural Language Inference)☆36Aug 3, 2018Updated 7 years ago
- Open Question Answering☆160Sep 8, 2017Updated 8 years ago
- BiMPM: Bilateral Multi-Perspective Matching for Natural Language Sentences☆434Aug 18, 2021Updated 4 years ago
- Ice is a rapid information extraction customizer☆15Apr 26, 2021Updated 4 years ago
- Transition-based dependency parser based on stack LSTMs☆206Nov 17, 2019Updated 6 years ago
- Enhanced LTSM for natural language inference☆265Feb 18, 2020Updated 6 years ago
- ☆87Jul 13, 2016Updated 9 years ago
- ☆41Sep 27, 2017Updated 8 years ago
- collect the publications and related resources of Deep Learning in NLP☆116Nov 24, 2015Updated 10 years ago
- An aspiring attempt to generate a continuous space of sentences with DenseNet☆26May 4, 2017Updated 8 years ago
- Accompanying code for our EMNLP 2017 publication "GraphDocExplore: A Framework for the Experimental Comparison of Graph-based Document Ex…☆27May 27, 2023Updated 2 years ago
- Sequence-to-sequence model with LSTM encoder/decoders and attention☆1,282Dec 30, 2020Updated 5 years ago
- Keras-Based LSTM Conv model for Question Selection☆23Mar 21, 2017Updated 8 years ago
- Question Answering via Integer Programming (TableILP)☆28Apr 22, 2016Updated 9 years ago
- Keras implementation of Bilateral Multi-Perspective Matching.☆61Jun 22, 2017Updated 8 years ago
- Document context language models☆22Nov 13, 2015Updated 10 years ago
- A sentence encoding-based model for natural language inference☆31May 22, 2018Updated 7 years ago
- Author implementation of "Learning Recurrent Span Representations for Extractive Question Answering" (Lee et al. 2016)☆33Apr 6, 2017Updated 8 years ago
- This is the code&dataset for the paper [Hierarchical Memory Networks for Answer Selection on Unknown Words. COLING 2016]☆44Jul 3, 2018Updated 7 years ago
- A neural conversation model☆138May 19, 2016Updated 9 years ago
- FIGMENT☆15Jan 27, 2020Updated 6 years ago
- (arXiv:1509.06664) Reasoning about Entailment with Neural Attention.☆44Nov 15, 2018Updated 7 years ago
- ICASSP2017: End-to-end joint learning of natural language understanding and dialogue manager☆75Jul 7, 2017Updated 8 years ago
- An implementation of the Globally Normalized Reader☆58Dec 8, 2022Updated 3 years ago
- ☆45Jun 29, 2017Updated 8 years ago
- This is a python and keras implementation of the VIS+LSTM visual question answering model.☆46Jan 6, 2017Updated 9 years ago
- An attempt to implement the TreeLSTM in Theano☆44Mar 14, 2016Updated 9 years ago
- ☆833Jul 12, 2017Updated 8 years ago
- ☆472Feb 12, 2022Updated 4 years ago
- Code for Structured Attention Networks https://arxiv.org/abs/1702.00887☆241Apr 3, 2017Updated 8 years ago
- Tree-structured Long Short-Term Memory networks (http://arxiv.org/abs/1503.00075)☆892Jul 30, 2017Updated 8 years ago
- A Neural Reading Comprehension-based Question Answering System☆80Sep 28, 2018Updated 7 years ago
- A PyTorch implementation of Recurrent Additive Networks by Lee et al. (2017)☆29Oct 17, 2017Updated 8 years ago
- This is an implementation of the Attention Sum Reader model as presented in "Text Comprehension with the Attention Sum Reader Network" av…☆98Sep 9, 2016Updated 9 years ago