You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I had previously concluded that caching was impossible because of shared state (global variables, destructive updates, etc), but now I think it might be possible for the compiler to flag which rules access or update that state and then at runtime everything else can be cached once the input reaches some threshold.
In the shorter term, does adding -F help at all? (Also I just realized that the long versions of -f and -F are identical, so I should fix that.)
chunk variables, string variables, node insertion, and <let> (which only applies if you're writing rules in XML).
Though I think it's also entirely possible that the bytecode interpreter is not the bottleneck and our actual problem is allocating thousands of nodes to store the different paths.
hangs.
or with input-to-rtx.txt since giella-smj doesn't have updated packages to build with:
and then it hangs.
With
--rules
we see it go through the same rules over and over again.(Could some sort of per-sentence memoisation / dynamic programming be useful?)
The text was updated successfully, but these errors were encountered: