Gabriel commited on
Commit
3a0121e
1 Parent(s): 92c49f6

Update text.py

Browse files
Files changed (1) hide show
  1. text.py +11 -5
text.py CHANGED
@@ -7,7 +7,7 @@ Text summarization methods can either be used as an extractive or abstractive mo
7
 
8
  <figure>
9
  <img src="file/EX_VS_ABS.png" alt="Trulli" style="width:100%">
10
- <figcaption>Fig.1 - Trulli, Puglia, Italy.</figcaption>
11
  </figure>
12
 
13
  <h3><center> Abstractive Model </center></h3>
@@ -24,16 +24,22 @@ sum_app_text_tab_2= """
24
  <h2><center> 🤗 </center></h2>
25
 
26
  The figure below illustrates how the skill level of the model increases at each step:
27
- ![alt text2](file/BART_SEQ.png)
28
- <center><i>image_caption</i></center>
 
 
 
29
 
30
  The main benefits of transfer learning in general include the saving of resources and improved efficiency when training new models, so feel free to adopt this model for your type of problem!
31
 
32
  <h3><center> Extractive Model </center></h3>
33
 
34
  The extractive models for this app are using sentence-transformer models, which basically is a bi-encoder that determines how similar two sentences are. This type of models convert texts into vectors (embedding) that capture semantic information. Additionally, LexRank, an unsupervised graph-based algorithm, is used to determine centrality scores as a post-process step to summarise. The main idea is that sentences "recommend" other similar sentences to the reader. Thus, if one sentence is very similar to many others, it will likely be a sentence of great importance. The importance of this sentence also stems from the importance of the sentences "recommending" it. Thus, to get ranked highly and placed in a summary, a sentence must be similar to many sentences that are in turn also similar to many other sentences.
35
- ![alt text3](file/Lex_rank.png)
36
- <center><i>image_caption</i></center>
 
 
 
37
 
38
  The figure above showcase how LexRank formats similarity graphs based on all possible sentence combinations sentence similarity from the vector embeddings. Notice that the most "recommended" sentences that are extracted (the right graph) are derived from a threshold value which filters "weaker" connections in the similarity graph.
39
  For more information on this topic read: [LexRank](https://www.aaai.org/Papers/JAIR/Vol22/JAIR-2214.pdf)
 
7
 
8
  <figure>
9
  <img src="file/EX_VS_ABS.png" alt="Trulli" style="width:100%">
10
+ <figcaption style="text-align: center;">Fig.1 - Trulli, Puglia, Italy.</figcaption>
11
  </figure>
12
 
13
  <h3><center> Abstractive Model </center></h3>
 
24
  <h2><center> 🤗 </center></h2>
25
 
26
  The figure below illustrates how the skill level of the model increases at each step:
27
+
28
+ <figure>
29
+ <img src="file/BART_SEQ.png" alt="Trulli" style="width:100%">
30
+ <figcaption style="text-align: center;">Fig.1 - Trulli, Puglia, Italy.</figcaption>
31
+ </figure>
32
 
33
  The main benefits of transfer learning in general include the saving of resources and improved efficiency when training new models, so feel free to adopt this model for your type of problem!
34
 
35
  <h3><center> Extractive Model </center></h3>
36
 
37
  The extractive models for this app are using sentence-transformer models, which basically is a bi-encoder that determines how similar two sentences are. This type of models convert texts into vectors (embedding) that capture semantic information. Additionally, LexRank, an unsupervised graph-based algorithm, is used to determine centrality scores as a post-process step to summarise. The main idea is that sentences "recommend" other similar sentences to the reader. Thus, if one sentence is very similar to many others, it will likely be a sentence of great importance. The importance of this sentence also stems from the importance of the sentences "recommending" it. Thus, to get ranked highly and placed in a summary, a sentence must be similar to many sentences that are in turn also similar to many other sentences.
38
+
39
+ <figure>
40
+ <img src="file/Lex_rank.png)" alt="Trulli" style="width:100%">
41
+ <figcaption style="text-align: center;">Fig.1 - Trulli, Puglia, Italy.</figcaption>
42
+ </figure>
43
 
44
  The figure above showcase how LexRank formats similarity graphs based on all possible sentence combinations sentence similarity from the vector embeddings. Notice that the most "recommended" sentences that are extracted (the right graph) are derived from a threshold value which filters "weaker" connections in the similarity graph.
45
  For more information on this topic read: [LexRank](https://www.aaai.org/Papers/JAIR/Vol22/JAIR-2214.pdf)