qbao775 commited on
Commit
380f502
1 Parent(s): e95ab48

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +51 -0
README.md CHANGED
@@ -23,6 +23,57 @@ Project: https://github.com/Strong-AI-Lab/Logical-Equivalence-driven-AMR-Data-Au
23
  Leaderboard: https://eval.ai/web/challenges/challenge-page/503/leaderboard/1347
24
 
25
  In this repository, we trained the DeBERTa-V2-XXLarge on the sentence pair constructed by our AMR-LE. We use AMR with four logical equivalence laws `(Contraposition law, Double negation law, Implication law, Commutative law)` to construct four different logical equivalence/inequivalence sentences.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
26
  ## How to load the model weight?
27
  ```
28
  from transformers import AutoModel
 
23
  Leaderboard: https://eval.ai/web/challenges/challenge-page/503/leaderboard/1347
24
 
25
  In this repository, we trained the DeBERTa-V2-XXLarge on the sentence pair constructed by our AMR-LE. We use AMR with four logical equivalence laws `(Contraposition law, Double negation law, Implication law, Commutative law)` to construct four different logical equivalence/inequivalence sentences.
26
+
27
+ ## How to interact model in this web page?
28
+ Some test examples that you may copy and paste them into the right side user input area.
29
+ The expected answer for the following example is they are logically inequivalent which is 0. Use constraposition law `(If A then B <=> If not B then not A)` to show that following example is false.
30
+ ```
31
+ If Alice is happy, then Bob is smart.
32
+ If Alice is not happy, then Bob is smart.
33
+ ```
34
+
35
+ The expected answer for the following example is they are logically equivalent which is 1. Use constraposition law `(If A then B <=> If not B then not A)` to show that following example is true.
36
+ ```
37
+ If Alice is happy, then Bob is smart.
38
+ If Bob is not smart, then Alice is not happy.
39
+ ```
40
+
41
+ The expected answer for the following example is they are logically inequivalent which is 0. Use double negation law `(A <=> not not A)` to show that following example is false.
42
+ ```
43
+ Alice is happy.
44
+ Alice is not happy.
45
+ ```
46
+
47
+ The expected answer for the following example is they are logically equivalent which is 1. Use constraposition law `(A <=> not not A)` to show that following example is true.
48
+ ```
49
+ Alice is happy.
50
+ Alice is not sad.
51
+ ```
52
+
53
+ The expected answer for the following example is they are logically inequivalent which is 0. Use double negation law `(If A then B <=> not A or B)` to show that following example is false. The `or` in `not A or B` refer to the the meaning of `otherwise` in natural language.
54
+ ```
55
+ If Alan is kind, then Bob is clever.
56
+ Alan is kind or Bob is clever.
57
+ ```
58
+
59
+ The expected answer for the following example is they are logically equivalent which is 1. Use constraposition law `(If A then B <=> not A or B)` to show that following example is true. The `or` in `not A or B` refer to the the meaning of `otherwise` in natural language.
60
+ ```
61
+ If Alan is kind, then Bob is clever.
62
+ Alan is not kind or Bob is clever.
63
+ ```
64
+
65
+ The expected answer for the following example is they are logically inequivalent which is 0. Use double negation law `(A and B <=> B and A)` to show that following example is false.
66
+ ```
67
+ The bald eagle is clever and the wolf is fierce.
68
+ The wolf is not fierce and the bald eagle is not clever.
69
+ ```
70
+
71
+ The expected answer for the following example is they are logically equivalent which is 1. Use constraposition law `(A and B <=> B and A)` to show that following example is true.
72
+ ```
73
+ The bald eagle is clever and the wolf is fierce.
74
+ The wolf is fierce and the bald eagle is clever.
75
+ ```
76
+
77
  ## How to load the model weight?
78
  ```
79
  from transformers import AutoModel