Disable summary generation at the end

app.py

@@ -470,84 +470,85 @@ if summarize_button:
                 for current_drawing_list in total_unmatched_deps:
                     render_dependency_parsing(current_drawing_list)
 
-    # OUTRO/CONCLUSION
-    st.header("🤝 Bringing it together")
-    st.markdown("We have presented 2 methods that try to detect errors in summaries via post-processing steps. Entity "
-                "matching can be used to solve hallucinations, while dependency comparison can be used to filter out "
-                "some bad sentences (and thus worse summaries). These methods highlight the possibilities of "
-                "post-processing AI-made summaries, but are only a first introduction. As the methods were "
-                "empirically tested they are definitely not sufficiently robust for general use-cases.")
-    st.markdown("####")
-    st.markdown(
-        "Below we generate 3 different kind of summaries, and based on the two discussed methods, their errors are "
-        "detected to estimate a factualness score. Based on this basic approach, "
-        "the best summary (read: the one that a human would prefer or indicate as the best one) "
-        "will hopefully be at the top. Summaries with the same scores will get the same rank displayed.")
-    st.markdown("####")
-
-    with st.spinner("Calculating more summaries and scoring them, this might take a minute or two..."):
-        summaries_list = []
-        deduction_points = []
-        # ENTITIES
-        _, amount_unmatched = get_and_compare_entities(False)
-
-        # DEPS
-        summary_deps = check_dependency(False)
-        article_deps = check_dependency(True)
-        total_unmatched_deps = []
-        for summ_dep in summary_deps:
-            if not any(summ_dep['identifier'] in art_dep['identifier'] for art_dep in article_deps):
-                total_unmatched_deps.append(summ_dep)
-
-        summaries_list.append(st.session_state.summary_output)
-        deduction_points.append(len(amount_unmatched) + len(total_unmatched_deps))
-
-        # FOR NEW GENERATED SUMMARY
-        st.session_state.summary_output = generate_abstractive_summary(st.session_state.article_text,
-                                                                       type="beam",
-                                                                       do_sample=True, num_beams=15,
-                                                                       no_repeat_ngram_size=5)
-        _, amount_unmatched = get_and_compare_entities(False)
-
-        summary_deps = check_dependency(False)
-        article_deps = check_dependency(True)
-        total_unmatched_deps = []
-        for summ_dep in summary_deps:
-            if not any(summ_dep['identifier'] in art_dep['identifier'] for art_dep in article_deps):
-                total_unmatched_deps.append(summ_dep)
-
-        summaries_list.append(st.session_state.summary_output)
-        deduction_points.append(len(amount_unmatched) + len(total_unmatched_deps))
-
-        # FOR NEW GENERATED SUMMARY
-        st.session_state.summary_output = generate_abstractive_summary(st.session_state.article_text,
-                                                                       type="top_p",
-                                                                       do_sample=True,
-                                                                       no_repeat_ngram_size=5)
-        _, amount_unmatched = get_and_compare_entities(False)
-
-        summary_deps = check_dependency(False)
-        article_deps = check_dependency(True)
-        total_unmatched_deps = []
-        for summ_dep in summary_deps:
-            if not any(summ_dep['identifier'] in art_dep['identifier'] for art_dep in article_deps):
-                total_unmatched_deps.append(summ_dep)
-
-        summaries_list.append(st.session_state.summary_output)
-        deduction_points.append(len(amount_unmatched) + len(total_unmatched_deps))
-
-        # RANKING AND SHOWING THE SUMMARIES
-        deduction_points, summaries_list = (list(t) for t in zip(*sorted(zip(deduction_points, summaries_list))))
-
-        cur_rank = 1
-        rank_downgrade = 0
-        for i in range(len(deduction_points)):
-            st.write(f'🏆 Rank {cur_rank} summary: 🏆', display_summary(summaries_list[i]), unsafe_allow_html=True)
-            if i < len(deduction_points) - 1:
-                rank_downgrade += 1
-                if not deduction_points[i + 1] == deduction_points[i]:
-                    cur_rank += rank_downgrade
-                    rank_downgrade = 0
+    # CURRENTLY DISABLED
+    # # OUTRO/CONCLUSION
+    # st.header("🤝 Bringing it together")
+    # st.markdown("We have presented 2 methods that try to detect errors in summaries via post-processing steps. Entity "
+    #             "matching can be used to solve hallucinations, while dependency comparison can be used to filter out "
+    #             "some bad sentences (and thus worse summaries). These methods highlight the possibilities of "
+    #             "post-processing AI-made summaries, but are only a first introduction. As the methods were "
+    #             "empirically tested they are definitely not sufficiently robust for general use-cases.")
+    # st.markdown("####")
+    # st.markdown(
+    #     "Below we generate 3 different kind of summaries, and based on the two discussed methods, their errors are "
+    #     "detected to estimate a factualness score. Based on this basic approach, "
+    #     "the best summary (read: the one that a human would prefer or indicate as the best one) "
+    #     "will hopefully be at the top. Summaries with the same scores will get the same rank displayed.")
+    # st.markdown("####")
+    #
+    # with st.spinner("Calculating more summaries and scoring them, this might take a minute or two..."):
+    #     summaries_list = []
+    #     deduction_points = []
+    #     # ENTITIES
+    #     _, amount_unmatched = get_and_compare_entities(False)
+    #
+    #     # DEPS
+    #     summary_deps = check_dependency(False)
+    #     article_deps = check_dependency(True)
+    #     total_unmatched_deps = []
+    #     for summ_dep in summary_deps:
+    #         if not any(summ_dep['identifier'] in art_dep['identifier'] for art_dep in article_deps):
+    #             total_unmatched_deps.append(summ_dep)
+    #
+    #     summaries_list.append(st.session_state.summary_output)
+    #     deduction_points.append(len(amount_unmatched) + len(total_unmatched_deps))
+    #
+    #     # FOR NEW GENERATED SUMMARY
+    #     st.session_state.summary_output = generate_abstractive_summary(st.session_state.article_text,
+    #                                                                    type="beam",
+    #                                                                    do_sample=True, num_beams=15,
+    #                                                                    no_repeat_ngram_size=5)
+    #     _, amount_unmatched = get_and_compare_entities(False)
+    #
+    #     summary_deps = check_dependency(False)
+    #     article_deps = check_dependency(True)
+    #     total_unmatched_deps = []
+    #     for summ_dep in summary_deps:
+    #         if not any(summ_dep['identifier'] in art_dep['identifier'] for art_dep in article_deps):
+    #             total_unmatched_deps.append(summ_dep)
+    #
+    #     summaries_list.append(st.session_state.summary_output)
+    #     deduction_points.append(len(amount_unmatched) + len(total_unmatched_deps))
+    #
+    #     # FOR NEW GENERATED SUMMARY
+    #     st.session_state.summary_output = generate_abstractive_summary(st.session_state.article_text,
+    #                                                                    type="top_p",
+    #                                                                    do_sample=True,
+    #                                                                    no_repeat_ngram_size=5)
+    #     _, amount_unmatched = get_and_compare_entities(False)
+    #
+    #     summary_deps = check_dependency(False)
+    #     article_deps = check_dependency(True)
+    #     total_unmatched_deps = []
+    #     for summ_dep in summary_deps:
+    #         if not any(summ_dep['identifier'] in art_dep['identifier'] for art_dep in article_deps):
+    #             total_unmatched_deps.append(summ_dep)
+    #
+    #     summaries_list.append(st.session_state.summary_output)
+    #     deduction_points.append(len(amount_unmatched) + len(total_unmatched_deps))
+    #
+    #     # RANKING AND SHOWING THE SUMMARIES
+    #     deduction_points, summaries_list = (list(t) for t in zip(*sorted(zip(deduction_points, summaries_list))))
+    #
+    #     cur_rank = 1
+    #     rank_downgrade = 0
+    #     for i in range(len(deduction_points)):
+    #         st.write(f'🏆 Rank {cur_rank} summary: 🏆', display_summary(summaries_list[i]), unsafe_allow_html=True)
+    #         if i < len(deduction_points) - 1:
+    #             rank_downgrade += 1
+    #             if not deduction_points[i + 1] == deduction_points[i]:
+    #                 cur_rank += rank_downgrade
+    #                 rank_downgrade = 0
 
 # session = SessionState.get(code=print("TEST"))
 # a = st.radio("Edit or show", ['Edit', 'Show'], 1)