Ordered Memory Baselines
Abstract
Natural language semantics can be modeled using the phrase-structured model, which can be represented using a tree-type architecture. As a result, recent advances in natural language processing have been made utilising recursive neural networks using memory models that allow them to infer tree-type representations of the input sentence sequence. These new tree models have allowed for improvements in sentiment analysis and semantic recognition. Here we review the Ordered Memory model proposed by Shen et al. (2019) at the NeurIPS 2019 conference, and try to either create baselines that can perform better or create simpler models that can perform equally as well. We found that the Ordered Memory model performs on par with the state-of-the-art models used in tree-type modelling, and performs better than simplified baselines that require fewer parameters.
Keywords
Cite
@article{arxiv.2302.06451,
title = {Ordered Memory Baselines},
author = {Daniel Borisov and Matthew D'Iorio and Jeffrey Hyacinthe},
journal= {arXiv preprint arXiv:2302.06451},
year = {2023}
}
Comments
9 pages, 6 figures. Submitted for the NeurIPS 2019 Reproducibility Challenge