A few questions and thoughts as I try to implement and extend your results...

1. Can you explain exactly what is meant by ensuring each entry in the pooled similarity matrix has mean 0 and variance 1. Is this per matrix, per element per mini-batch?

2. Also, did you experiment with other approaches to classification besides simply flattening the similarity matrix and performing binary logistic regression?

3. Is there an updated version of this general approach you think seems promising? I.e. with attention or more complex compositional functions (Tree-LST Ms?, different weight matrices for different POS combinations, etc.)

Thanks so much!

Hi Richard,

Is there a python implementation available?

Hello Richard, I am running the Full Paraphrase System code, but it is throwing error while loading savedParams/params.mat file. The error is "no such file, '/juice/scr21/scr/ehhuang/projects/deepRAE/code/norm1tanh.m" I think this variable should be "code/norm1tanh.m". Can You please tell me how to resolve this error? Thanks...!!

I would also like to know how to retrain the RAE model.

Hi Richard, I would like to know can I retrain the RAE model? Bests, Connie

Hi Connie, Yes, you just need to adjust the training data and train it on two languages. Best, Richard

Hi Richard, I would like to know whether this paraphrase system can apply on bilingual language or not?

Bests, Connie

@D Mr?, There is a flag you can set to binarize trees, you can find it in the code of our sentiment model from EMNLP 2013 and the newest Core NLP? package.

@sriram bhargav Yes, if you retrain the model you can use any set of word vectors you want, e.g. from our ACL 2012 paper, or a new set from Pennington et al 2014 (see front page for link in a few days) or word2vec. You can probably get an improvement in performance by using a larger vocabulary. Best, Richard

To clarify, in the following tree, there are two NP nodes with 3 child leaves:

(ROOT

  (S
    (NP (NNP Shisheh))
    (VP (VBZ is)
      (NP
        (NP (DT a) (NN village))
        (PP (IN in)
          (NP (NNP Hemmatabad) (NNP Rural) (NNP District))))
      (, ,)
      (PP (IN in)
        (NP
          (NP (DT the) (NNP Central) (NNP District))
          (PP (IN of)
            (NP
              (NP (NNP Borujerd) (NNP County))
              (, ,)
              (NP
                (NP (NNP Lorestan) (NNP Province))
                (, ,)
                (NP (NNP Iran))))))))
    (. .)))

Would you just qualify those children as named entities and average the leaves on the same level?

How would you have determined to concatenate the child vectors?

Hi Richard,

  Thanks for all the research and code, it's a great help to all the lowly dataminers out there.   I'm wondering how you opted to construct the binary parse trees for a given sentence during unsupervised training.  Unless I'm missing something, the Stanford Parser won't restrict itself to binary (p->c1,c2) structures.   

Thanks!

Hi Socher, I have a question. Are the values in params.mat independent of vars.normalized.100.mat? When i tried to use your code( codeRAEVectorsNIPS2011) for computing compositional vectors i found out that many words are detected as *UNKNOWN*. Is there any way to get 50 or 200 dimension phrase vector instead 100?

Yes, we're only publishing the code for training the paraphrase classifier on top. The other code is trained on a large corpus and hard to package up nicely. In our most recent TACL paper we have a new RNN on dependency trees. I think it is even more powerful but haven't tried it on the paraphrasing task yet.

very elegant work! My confusion on variable matrix is almost tackled out by your paper.

Hi Richard, I too am interested in training an Unfolding RAE, but I am not sure what you meant by "You can use the training code from this website to see." in your last comment. There is no training code above. Are you saying you won't release it, and we should come up with our own training port to the pre-trained code above? Thanks, Mike.

Hi Richard, I too am interested in training an Unfolding RAE, but I am not sure what you meant by "You can use the training code from this website to see." in your last comment. There is no training code above. Are you saying you won't release it, and we should come up with our own training port to the pre-trained code above? Thanks, Mike.

Hi, It takes at most 5h to train. You can use the training code from this website to see. Best, Richard

Hi Socher,

I am implementing this model as part of my thesis work. Could you please tell me how much time did it take to train unfolded RAE?

Thanks in advance.

Hi Richard, recently I have been studying your code above. However, I can't find any details about the RAE training algorithm in your code. Can I get your RAE training algorithm implementation for academic study purpose. Thx.

Hi Richard, recently I have been studying your code above. However, I can't find any details about the RAE training algorithm in your code. Can I get your RAE training algorithm implementation for academic study purpose. Thx.

Hi Tian, It highly depends on your corpus. Are there many different words that are unknown in this vocabulary? Are the new pairs much longer or shorter? For shorter phrases you may want to use a smaller similarity matrix. Best, Richard

I follow REAME.txt to replace the input.txt with new corpus and the performance is much lower than results in your paper, so I guess that we need to retrain the model with the new corpus, How to make training, could you help me,

Hi Richard I try to use your data and code , it is OK for your input.txt, And I get some input sentences , and I want to test the performance, I read your paper, and find that you train the model with a part of MS corpus and then test the rest part of MS corpus，is it right, As I want to test new input, I need to train my corpus, is it right, So how to use your code for training model, Could you help me