Consistency Queries in Information Extraction
Abstract
A new formal framework of learning - learning by consistency queries - is introduced and studied. The theoretical approach outlined here is implemented as the core technology of a prototypical development system named LExIKON which supports interactive information extraction in practically relevant cases exactly in the way described in the present paper. The overall scenario of learning by consistency queries for information extraction is formalized and different constraints on the query learners are discussed and formulated. The principle learning power of the resulting types of query learners is analyzed by comparing it to the power of well-known types of standard learning devices including unconstrained inductive inference machines as well as consistent, total, finite, and iterative learners.
Cite
Text
Grieser et al. "Consistency Queries in Information Extraction." International Conference on Algorithmic Learning Theory, 2002. doi:10.1007/3-540-36169-3_16Markdown
[Grieser et al. "Consistency Queries in Information Extraction." International Conference on Algorithmic Learning Theory, 2002.](https://mlanthology.org/alt/2002/grieser2002alt-consistency/) doi:10.1007/3-540-36169-3_16BibTeX
@inproceedings{grieser2002alt-consistency,
title = {{Consistency Queries in Information Extraction}},
author = {Grieser, Gunter and Jantke, Klaus P. and Lange, Steffen},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2002},
pages = {173-187},
doi = {10.1007/3-540-36169-3_16},
url = {https://mlanthology.org/alt/2002/grieser2002alt-consistency/}
}