Use of Genetic Algorithm for Cohesive Summary Extraction to Assist Reading Difficulties

Algorithm 1

Frame work of the genetic algorithm.

(1) procedure SUMMARY EXTRACTION(.txt file)

(2) Create initialize population ⊳ choose K different combinations of the sentences

(3) Evaluate initial population   ⊳ Calculate the fitness based on (13)

(4) Select the best chromosomes   ⊳ select the chromosomes with current best fitness

(5) Generate child chromosome   ⊳ apply modified crossover and mutation to produce child chromosomes

(6) Replace   ⊳ weaker chromosomes are replaced by potential chromosomes

(7) Stopping criteria   ⊳ Repeat steps (3–6) until specified max generation is attained

(8) Output ⊳ Extract the summary sentences from the best chromosome as final solution

(9) return   Candidate Sentences         ⊳ Summary sentences

(10) end procedure