A Query System for Texts with Macros

この論文にアクセスする

この論文をさがす

著者

    • KWON Keehang
    • the Department of Computer Engineering, DongA University
    • KIM Jinsoo
    • the Department of Computer Science, Konkuk University

抄録

We propose a query language based on extended regular expressions. This language extends texts with text-generating macros. These macros make it possible to define languages in a compressed, elegant way. This paper also extends queries with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form <i>D</i> _??_ <i>G</i> and <i>G</i><sub>1</sub> & <i>G</i><sub>2</sub> where <i>D</i> is a text or a macro and <i>G</i> is a query. The first goal is solved by adding <i>D</i> to the current text and then solving <i>G</i>. This goal is flexible in controlling the current text dynamically. The second goal is solved by solving both <i>G</i><sub>1</sub> and <i>G</i><sub>2</sub> from the current text. This goal is particularly useful for internet search.

収録刊行物

  • IEICE transactions on information and systems

    IEICE transactions on information and systems 91(1), 145-147, 2008-01-01

    The Institute of Electronics, Information and Communication Engineers

参考文献:  6件中 1-6件 を表示

各種コード

  • NII論文ID(NAID)
    10026800829
  • NII書誌ID(NCID)
    AA10826272
  • 本文言語コード
    ENG
  • 資料種別
    SHO
  • ISSN
    09168532
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ