A Query System for Texts with Macros

スポンサーリンク

概要

• 論文の詳細を見る

• 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 D _??_ G and G1 & G2 where D is a text or a macro and G is a query. The first goal is solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.

• （社）電子情報通信学会の論文
• 2008-01-01

著者

• Kang Dae‐seong

  The Department Of Electronics Engineering Donga University

• Kim Jinsoo

  The Department Of Computer Science Konkuk University

• KWON Keehang

  the Department of Computer Engineering, DongA University

• KANG Dae-Seong

  the Department of Electronics Engineering, DongA University

• Kwon Keehang

  The Department Of Computer Engineering Donga University

関連論文

• A Query System for Texts with Macros
• An Efficient Prefix Caching Scheme with Bounded Prefix Expansion for High-Speed IP Lookup

スポンサーリンク