change beam size
Browse files- infer.sh +1 -1
- tmp_data/src.txt +1 -1
- tmp_data/tgt.txt +10 -10
infer.sh
CHANGED
@@ -2,7 +2,7 @@ python inference.py \
|
|
2 |
--model trained_models/retrosnyhesis_ReactSeq_prompt_model_on_50k_aug100.pt \
|
3 |
--src ./tmp_data/src.txt \
|
4 |
--output ./tmp_data/tgt.txt \
|
5 |
-
--beam_size
|
6 |
--n_best 10 \
|
7 |
--batch_size 16384 \
|
8 |
--batch_type tokens \
|
|
|
2 |
--model trained_models/retrosnyhesis_ReactSeq_prompt_model_on_50k_aug100.pt \
|
3 |
--src ./tmp_data/src.txt \
|
4 |
--output ./tmp_data/tgt.txt \
|
5 |
+
--beam_size 10 \
|
6 |
--n_best 10 \
|
7 |
--batch_size 16384 \
|
8 |
--batch_type tokens \
|
tmp_data/src.txt
CHANGED
@@ -1 +1 @@
|
|
1 |
-
N # C C 1 = C C = C ( C ( C (
|
|
|
1 |
+
N # C C 1 = C C = C ( C ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1
|
tmp_data/tgt.txt
CHANGED
@@ -1,10 +1,10 @@
|
|
1 |
-
N # C C 1 = C C = C ( C ( C (
|
2 |
-
N # C C 1 = C C = C (
|
3 |
-
N # C C 1 = C C = C ( C ( C (
|
4 |
-
N # C C 1 = C C = C ( [
|
5 |
-
N # C C 1 = C C = C ( C ( C (
|
6 |
-
N # C C 1 = C C = C ( C ( C (
|
7 |
-
N # C C 1 = C C = C ( C ( C (
|
8 |
-
N # C C 1 = C C = C (
|
9 |
-
N # C C 1 = C C = C ( C (
|
10 |
-
N # C C 1 = C C = C ( C ( C (
|
|
|
1 |
+
N # C C 1 = C C = C ( C ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ B r : 1 ] > < >
|
2 |
+
N # C C 1 = C C = C ( C ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ C l : 1 ] > < >
|
3 |
+
N # C C 1 = C C = C ( C ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ F : 1 ] > < >
|
4 |
+
N # C C 1 = C C = C ( [ r C H ] ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ B r : 1 ] > < >
|
5 |
+
N # C C 1 = C C = C ( [ r C H ] ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ C l : 1 ] > < >
|
6 |
+
N # C C 1 = C C = C ( C ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ O H : 1 ] > < >
|
7 |
+
N # C C 1 = C C = C ( C ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ I : 1 ] > < >
|
8 |
+
N # C C 1 = C C = C ( B ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ B r : 1 ] > < >
|
9 |
+
N # C C 1 = C C = C ( [ r C H ] ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ O H : 1 ] > < >
|
10 |
+
N # C C 1 = C C = C ( [ s C H ] ( C ( O ) C C 2 = C C = C ( F ) C = C 2 ) ! N 2 C = N C = N 2 ) C = C 1 < [ C l : 1 ] > < >
|