The only thing I'd like to hear in addition to the lecture is the following. Let's say we didn't get stuck into any of the mentioned issues - no ambiguity, the parsing is smooth. What is the next step? How exactly could it be applied. I think these questions deserve one more lecture
Semantic parsers can be used in applications that require knowledge representation and reasoning, or any other application that requires unstructured text to be converted into machine-readable data. I would use the text's logical form as an input to an automated theorem prover in order to derive logical inferences from it. If the logical form were converted into a declarative programming language such as SMT-LIB, it could be used as an input to an SMT solver.
![30 ชั่วโมงคนเดียว บนรถไฟชั้น 3 โซเวียต [Around The World Ep. 2]](http://i.ytimg.com/vi/MlE9boAVqDA/mqdefault.jpg)
Thanks. Some day semantic parsing will amaze us
The only thing I'd like to hear in addition to the lecture is the following. Let's say we didn't get stuck into any of the mentioned issues - no ambiguity, the parsing is smooth. What is the next step? How exactly could it be applied. I think these questions deserve one more lecture
Semantic parsers can be used in applications that require knowledge representation and reasoning, or any other application that requires unstructured text to be converted into machine-readable data.
I would use the text's logical form as an input to an automated theorem prover in order to derive logical inferences from it. If the logical form were converted into a declarative programming language such as SMT-LIB, it could be used as an input to an SMT solver.
What a vivid audience.
I have been to funerals where people are more alive ... including the “host” !
The lecturer was great bro, what are you talking about?