科技广场
科技廣場
과기엄장
Science Mosaic
2015年
7期
16-20
,共5页
自动摘要%最短路径算法%Dijkstra%Bellman-Ford%术语权重
自動摘要%最短路徑算法%Dijkstra%Bellman-Ford%術語權重
자동적요%최단로경산법%Dijkstra%Bellman-Ford%술어권중
Automatic Summarization%Shortest Path Algorithm%Dijkstra%Bellman-Ford%Term Weighting
自动文本摘要是一种基于计算机的系统,它概括文本的同时保留文章的主题.在获取摘要过程中,用句子间的权重给每个段落建立句子的图谱;同时也考虑印尼文章段落结构的归纳演绎方法,用最短路径算法确定哪些句子部分将成为摘要的结果.实验结果表明,Dijkstra算法优于Bellman-Ford算法生成文本摘要压缩率的12%.
自動文本摘要是一種基于計算機的繫統,它概括文本的同時保留文章的主題.在穫取摘要過程中,用句子間的權重給每箇段落建立句子的圖譜;同時也攷慮印尼文章段落結構的歸納縯繹方法,用最短路徑算法確定哪些句子部分將成為摘要的結果.實驗結果錶明,Dijkstra算法優于Bellman-Ford算法生成文本摘要壓縮率的12%.
자동문본적요시일충기우계산궤적계통,타개괄문본적동시보류문장적주제.재획취적요과정중,용구자간적권중급매개단락건립구자적도보;동시야고필인니문장단락결구적귀납연역방법,용최단로경산법학정나사구자부분장성위적요적결과.실험결과표명,Dijkstra산법우우Bellman-Ford산법생성문본적요압축솔적12%.
Automated Text Summarization is a computer-based system to perform text summarization that still keeps the main subject of the article.In the summarization process,we use weight of sentence,and build a graph of sentences in every paragraph.We also consider the inductive-deductive method in paragraph structure in Indone-sian articles.We use shortest part algorithm to determine which sentences will become results of summarization.In this paper,we will compare the results of summarization with Dijkstra and bellman-ford algorithms.The experi-mental result shows that Dijkstra give the better compression rate by 12%.
