Grammatical Inference on the Basis of Linear Environments of Symbol Strings
Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .
Abstract
A new method of grammatical inference is proposed. The inference procedure, receiving only positive sample sentences, produces a grammar. A notion of "bounded context" is introduced which represents linear environment of a string in sample sentences. The procedure consists of (1) calculating the bounded context of strings, (2) finding a pair of context-equivalent strings, (3) reducing the sample sentences by means of the pair, and (4) iterating (1) to (3) until there is no pair of context-equivalent strings in the reduced sample sentences. The output grammar is constructed from the reduced sentences and the pairs of strines obtained in " (2). Sample sentences are grammatically correct with respect to the grammar inferred from the sentences. All of regular languages and a number of non-trivial context-free languages are inferred correctly by the method, when sufficient but a finite number of sample sentences are given.
@inproceedings{ijcai1979p110,
title = {Grammatical Inference on the Basis of Linear Environments of Symbol Strings},
author = {Kotani, Yoshiyuki},
booktitle = {Proceedings of the Sixth International Joint Conference on
Artificial Intelligence, {IJCAI-79}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Bruce G. Buchanan},
year = {1979},
month = {8},
url = {https://ijcai.org/proceedings/1979/110},
}
TY - CPAPER TI - Grammatical Inference on the Basis of Linear Environments of Symbol Strings AU - Kotani, Yoshiyuki T2 - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79 PB - International Joint Conferences on Artificial Intelligence PY - 1979 UR - https://ijcai.org/proceedings/1979/110 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: