識別学習による組合せ最適化問題としての文短縮手法

• 平尾 努

  日本電信電話株式会社 NTTコミュニケーション科学基礎研究所

• 鈴木 潤

  日本電信電話株式会社 NTTコミュニケーション科学基礎研究所

• 磯崎 秀樹

  日本電信電話株式会社 NTTコミュニケーション科学基礎研究所

書誌事項

タイトル別名

• A Discriminative Sentence Compression Method as Combinatorial Optimization Problem
• シキベツ ガクシュウ ニ ヨル クミアワセ サイテキカ モンダイ ト シテノ ブン タンシュク シュホウ

抄録

In the study of automatic summarization, the main research topic was `important sentence extraction' but nowadays `sentence compression' is a hot research topic. Conventional sentence compression methods usually transform a given sentence into a parse tree or a dependency tree, and modify them to get a shorter sentence. However, this method is sometimes too rigid. In this paper, we regard sentence compression as an combinatorial optimization problem that extracts an optimal subsequence of words. Hori et al. also proposed a similar method, but they used only a small number of features and their weights were tuned by hand. We introduce a large number of features such as part-of-speech bigrams and word position in the sentence. Furthermore, we train the system by discriminative learning. According to our experiments, our method obtained better score than other methods with statistical significance.

収録刊行物

• 人工知能学会論文誌

  人工知能学会論文誌 22 (6), 574-584, 2007

  一般社団法人 人工知能学会

キーワード

• text summarization
• sentence compression
• combinatorial optimization
• discriminative learning
• dynamic programming

詳細情報

• CRID: 1390001205108910336
• NII論文ID: 10022008183
• NII書誌ID: AA11579226
• DOI: 10.1527/tjsai.22.574
• ISSN: 13468030
• ISSN: 13460714
• NDL書誌ID: 9604271
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I9604271
• Web Site: http://www.jstage.jst.go.jp/article/tjsai/22/6/22_6_574/_pdf
• 本文言語コード: ja
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可