I got one question that I want to use AMR to write a function that can be used to automatically represent transitivity law (a->b, b->c <=> a->c). Can I do that? I think the
For example,
Sentence 1: "if Alice go to school, then Bob will play game."
Sentence 2: "if Bob will play game, then Tom will go home."
Then how can I use AMR to identify the following items? I think that part is the most essential step. How can I write an AMR code to automatically do that?
a: Alice go to school
b: Bob will play game
c: Tom will go home
In this case, a->b and b->c and then we can derive a->c.
then we have "a->c" which is "if Alice go to school, then Tom will go home."
Thank you so much.
Hi,
I got one question that I want to use AMR to write a function that can be used to automatically represent transitivity law (a->b, b->c <=> a->c). Can I do that? I think the For example, Sentence 1: "if Alice go to school, then Bob will play game." Sentence 2: "if Bob will play game, then Tom will go home."
Then how can I use AMR to identify the following items? I think that part is the most essential step. How can I write an AMR code to automatically do that? a: Alice go to school b: Bob will play game c: Tom will go home
In this case, a->b and b->c and then we can derive a->c. then we have "a->c" which is "if Alice go to school, then Tom will go home." Thank you so much.