LSTM encoder-decoder model that translates infix mathematical expressions to postfix notation, achieving 100% accuracy with true autoregressive decoding. Built with TensorFlow/Keras.
-
Updated
Feb 23, 2026 - Jupyter Notebook
LSTM encoder-decoder model that translates infix mathematical expressions to postfix notation, achieving 100% accuracy with true autoregressive decoding. Built with TensorFlow/Keras.
Tree-based speculative decoding benchmarked against linear under equal verification budget — branch factor, depth, and draft quality sweep with fair node-level comparison.
Add a description, image, and links to the autoregressive-decoding topic page so that developers can more easily learn about it.
To associate your repository with the autoregressive-decoding topic, visit your repo's landing page and select "manage topics."