文構造における検索キーワード間の修飾-被修飾関係に基づくWWW検索精度の向上  [in Japanese] Improvement in precision of WWW Search Engines based on Dependency Relation between Input Keywords  [in Japanese]

Search this Article

Author(s)

Abstract

ウェブ検索エンジンに,ユーザが検索キーワードとして2つの語を入力した場合に,その2語が整合的な修飾-被修飾関係を持って文書中に出現しているか否かを判定する,ランキング手法を提案する.キーワード間の修飾-被修飾関係を表現する構造として,本研究では文構造を取り上げる.提案する手法と近接関係を用いた手法との絞り込み精度を比較する実験を行う.

In this paper, we propose a method to improve precision of WWW search engines. When Web search engines are used, the user inputs keywords. Web search engines accept a few keywords as a retrieval condition, and select candidate pages based on some statistics value such as TF/IDF and so on. We think that the keywords input by users have a semantic relation. We try to improve retrieval accuracy by checking whether two keywords have a dependency relation in the candidate pages or not. We deal with sentence as a structure to represent dependency relations between keywords. We construct a meta search engine which accept output of an ordinary search engine and select plausible ones by checking dependency relation. We also show an experimental evaluation of our method.

Journal

  • IEICE technical report

    IEICE technical report 105(595), 7-12, 2006-02-03

    The Institute of Electronics, Information and Communication Engineers

References:  5

Cited by:  3

Codes

  • NII Article ID (NAID)
    110004662880
  • NII NACSIS-CAT ID (NCID)
    AN10091225
  • Text Lang
    JPN
  • Article Type
    Journal Article
  • ISSN
    09135685
  • NDL Article ID
    7846538
  • NDL Source Classification
    ZN33(科学技術--電気工学・電気機械工業--電子工学・電気通信)
  • NDL Call No.
    Z16-940
  • Data Source
    CJP  CJPref  NDL  NII-ELS 
Page Top