We propose solutions to enhance the Inside-Outside Recursive Neural Network (IORNN) reranker of<cite> Le and Zuidema (2014)</cite> . Replacing the original softmax function with a hierarchical softmax using a binary tree constructed by combining output of the Brown clustering algorithm and frequency-based Huffman codes, we significantly reduce the reranker's computational complexity.