IEICE TRANSACTIONS on Information
A Query System for Texts with Macros
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E91-D No.1 pp.145-147
- Publication Date
- 2008/01/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e91-d.1.145
- Type of Manuscript
- LETTER
- Category
- Automata and Formal Language Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Keehang KWON, Dae-Seong KANG, Jinsoo KIM, "A Query System for Texts with Macros" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 1, pp. 145-147, January 2008, doi: 10.1093/ietisy/e91-d.1.145.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.1.145/_p
Copy
@ARTICLE{e91-d_1_145,
author={Keehang KWON, Dae-Seong KANG, Jinsoo KIM, },
journal={IEICE TRANSACTIONS on Information},
title={A Query System for Texts with Macros},
year={2008},
volume={E91-D},
number={1},
pages={145-147},
abstract={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.},
keywords={},
doi={10.1093/ietisy/e91-d.1.145},
ISSN={1745-1361},
month={January},}
Copy
TY - JOUR
TI - A Query System for Texts with Macros
T2 - IEICE TRANSACTIONS on Information
SP - 145
EP - 147
AU - Keehang KWON
AU - Dae-Seong KANG
AU - Jinsoo KIM
PY - 2008
DO - 10.1093/ietisy/e91-d.1.145
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2008
AB - 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.
ER -
English
