Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
Someone figured out how to make LLMs obey context free grammars, so that opens up the possibility of really fine-grained control of generation and the structure of outputs.
And I was thinking, what if we did the same for something that consumed and validated tokens?
The thinking is that the option to backtrack already exists, so if an input is invalid, the system can backtrack and regenerate - mostly this is implemented through something called 'temperature', or 'top-k', where the system generates multiple next tokens, and then typically selects from a subsample of them, usually the highest scoring one.
But it occurs to me that a process could be run in front of that, that asks conditions the input based on a grammar, and takes as input the output of the base process. The instruction prompt to it would be a simple binary filter:
"If the next token conforms to the provided grammar, output it to stream, otherwise trigger backtracking in the LLM that gave you the input."
This is very much a compliance thing, but could be used for finer-grained control over how a machine examines its own output, rather than the current system where you simply feed-in as input its own output like we do now for systems able to continuously produce new output (such as the planners some people have built)
link here:
https://news.ycombinator.com/item/...5 -
When you are trying to reverse engineering context free grammar rules from given sentences......
Not possible. Worst assignment yet.
2 -
I know it a strange thing to ask but I need help with English grammar ( I am not a English native)
I am doing an assignment on context free grammar program.
What the program need to do it "Produce a grammar tree based on the rule"
For example a sentence "Jame sat.", It will need to produce a grammar tree like this.
S
_____|___
NP VP
| |
N V
| |
holmes sat
The only thing I need to do it give a grammar rule to the program like this
S -> NP VP
NP -> N | Det N
VP -> V | NP
What the above rule said is that the sentence is composed of Noun Phrase and Verb Phrase and Noun Phrase is either is a Noun or a determiner and Noun.
Now here is the meat of the question.
I am having trouble parsing a grammar tree for this sentence "She never said a word until we were at the door here"
I have provided my grammar rule below. I think I forget to add some grammar rule or some of my grammar rule are incorrect. I am not a native English speaker so I am having trouble on it.
The search engine have fail me (I have look up various grammar tree) so I am asking for help on devrant. Grammar nazi are warmly welcome :)
S -> NP VP | S Conj VP | S Conj S
NP -> N | Det NP | N PP | Adj N | Det Adj N | Det N
PP | Det NOM | Det N PP
VP -> V | V NP | V NP PP | V PP | V NP PP Adv
VP -> Adv V NP | VP PP | VP AVP | V PP PP | V
ADJP
PP -> P NP
AVP -> Adv | Adv Adj | Adv AVP
NOM -> Adj Adj N | Adj N | Adj NP
ADJP -> Adj | Adj PP
**I am not sure about these two clause below**
VP -> V | Adv
NP -> Adj Adj N22
Top Tags
Weekly Rant
View