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.

Sign up for GitHub

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

Jump to bottom

Create TRS search methods that capture the behavior of less flexible formalisms #10

Open
joshrule opened this issue Sep 28, 2018 · 0 comments
Open

Create TRS search methods that capture the behavior of less flexible formalisms #10

joshrule opened this issue Sep 28, 2018 · 0 comments
Labels
enhancement New feature or request

Comments

@joshrule
Copy link
Collaborator

Many slightly less-flexible formalisms can be approximated with a suitably restricted TRS learning algorithm. These include:

  • combinatory logic (learn rules that don't use variables)
  • LOT-style PCFG (learn rules of the form f(x1,x2,...) = <definition in terms of existing operators>)
  • lambda calculus (learn PCFG-style rules and rules which include only variables on the RHS)

It would also be great to setup classic priors for some of these models, including Rational Rules (Goodman, et al., 2008).
@joshrule joshrule added the enhancement New feature or request label Sep 28, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@joshrule