A Query System for Texts with Macros

Keehang KWON  Dae-Seong KANG  Jinsoo KIM  

IEICE TRANSACTIONS on Information and Systems   Vol.E91-D   No.1   pp.145-147
Publication Date: 2008/01/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e91-d.1.145
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Automata and Formal Language Theory
text search,  internet,  information retrieval,  linear logic,  

Full Text: PDF>>
Buy this Article

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.