Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Grammar Based Encoder and Decoder #20

Open
hmc-cs-mdrissi opened this issue May 1, 2018 · 1 comment
Open

Grammar Based Encoder and Decoder #20

hmc-cs-mdrissi opened this issue May 1, 2018 · 1 comment

Comments

@hmc-cs-mdrissi
Copy link
Owner

It'd be helpful if the encoder and decoder tree models took into account the programming language's grammar. This is more important in the decoder as it would force it to only construct grammatically correct programs. It could still be interesting for the encoder as it may help it find better learned representations. To do this each non-terminal in the grammar for the decoder would need its own tree lstm cell and the cell would need a softmax to create its children based off its possible rules. The dimensionality of the softmax would be determined by the number of ways that non terminal could be expanded. For the encoder tree lstm, it is still necessary to have one for each non-terminal, but no softmaxes should be necessary.

@hmc-cs-mdrissi
Copy link
Owner Author

The grammar decoder is finished. The grammar encoder is a goal that still could be done. I'm kind of skeptical it'll help much though.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant