DeNeutoy / Decomposable_AttnLinks
☆23Updated 8 years ago
Alternatives and similar repositories for Decomposable_Attn
Users that are interested in Decomposable_Attn are comparing it to the libraries listed below
Sorting:
- Reimplementation of Munkhdalai et al's Neural Semantic Encoders (https://arxiv.org/pdf/1607.04315v2.pdf)☆59Updated 8 years ago
- Semantic parsing as machine translation☆24Updated 8 years ago
- An implementation of Mikolov's word2vec in Python using Theano and Lasagne.☆37Updated 7 years ago
- ☆45Updated 7 years ago
- GloVe Word Embedding model's implementation in theano☆36Updated 8 years ago
- Graph-based Dependency Parser☆46Updated 9 years ago
- Implementation of a deep recursive net over binary parse trees (code for NIPS2014 paper)☆28Updated 10 years ago
- Top-down Tree LSTM (NAACL 2016) http://aclweb.org/anthology/N/N16/N16-1035.pdf☆83Updated 8 years ago
- Recurrent Memory Network - Torch implementation☆35Updated 8 years ago
- BiCVM Code☆45Updated 7 years ago
- Very Deep Pairwise Word Interaction Neural Networks for modeling textual similarity (He and Lin, NAACL/HLT 2016)☆18Updated 7 years ago
- ☆19Updated 8 years ago
- Document context language models☆22Updated 9 years ago
- ☆30Updated 6 years ago
- Code of NAACL paper "Unsupervised Multi-Domain Adaptation with Feature Embeddings"☆33Updated 10 years ago
- Moro files for the ACL 2015 Tutorial on Matrix and Tensor Factorization Methods for Natural Language Processing☆20Updated 9 years ago
- Slides/code for the Lisbon machine learning school 2017☆28Updated 7 years ago
- Parallel (asynchronous) sparse coding implementation for obtaining sparse overcomplete word vectors☆55Updated 7 years ago
- ☆18Updated 10 years ago
- ☆19Updated 6 years ago
- End-to-end memory networks in TensorFlow☆33Updated 8 years ago
- High-order Semi-Markov Conditional Random Field☆33Updated 6 years ago
- An autoencoder to calculate word embeddings as mentioned in Lebret/Collobert paper 2015☆74Updated 8 years ago
- Non-distributional linguistic word vector representations.