Maarten Trompper
Maarten Trompper
Dashka, It is possible if you set all rule probabilities equal to each other, or just ignore the computed probabilities. The parse trees are the same. If you just need...
Just a heads up in case you run into a strange error about a singular matrix. You (maybe) need to make sure that the sum of probabilities for any given...
It's possible, but not as easily as in the example you give. Dealing with probabilities complicates the issue considerably. Stolcke describes how to it in his paper. I welcome any...
Eh. Are you a spam bot?
Oh OK my Android device wouldn't open the PDF so I thought it was a virus, but I can open it now. Let me see.
This is a very nice idea. A bit what I was getting at in #1 except I didn't put any thought in it. We could definitely implement this. You may...
Idea: implement a `ParseIterator` that performs the predict, scan, complete cycle based on the user-passed iterator and additionally contains a stack for tokens to insert or "delete" dynamically at runtime
I don't really understand yet how error handling should work for Earley parsers (and I don't really know about shift reduce parsers in general). Do you have any idea how...
If I understand correctly: when the parser reads a sentence left to right it might encounter a token E that it cannot understand. It will go into a kind of...