Ordered Memory Baselines

Daniel Borisov, Matthew D'Iorio, Jeffrey Hyacinthe
2/8/2023
cs.CLcs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{borisov2023ordered,
  title  = {Ordered Memory Baselines},
  author = {Daniel Borisov and Matthew D'Iorio and Jeffrey Hyacinthe},
  year   = {2023},
  eprint = {2302.06451},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.06451v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.06451.svg)](https://codeofpaper.com/paper/2302.06451)

Discussion