Web Grammars
Proceedings of the First International Joint Conference on Artificial Intelligence. Linguistic and Contextual Methods in Pattern Recognition. Pages 609-620.
Abstract
Classes of "phrase-structure grammars" are defined whose "languages" consist, not of strings of symbols, but of directed graphs with symbols at their vertices ("webs"). Examples of such "web grammars" are given, having languages consisting of trees, of two-terminal series-parallel networks, and of "triangular" networks. It is shown that if the graphs permitted in a "context-sensitive" web grammar are required to be acyclic, and the parsing rules are assumed to be graph homomorphisms, then any subgraph which is parsed by a rule must be "convex", and any rule is a composite of rules each of which parses a subgraph having just two points.
@inproceedings{ijcai1969p53,
title = {Web Grammars},
author = {Pfaltz, John L. and Rosenfeld, Azriel},
booktitle = {Proceedings of the First International Joint Conference on
Artificial Intelligence, {IJCAI-69}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Donald E. Walker and David C. Cooper},
pages = {609--620},
year = {1969},
month = {5},
note = {Linguistic and Contextual Methods in Pattern Recognition},
url = {https://ijcai.org/proceedings/1969/53},
}
TY - CPAPER TI - Web Grammars AU - Pfaltz, John L. AU - Rosenfeld, Azriel T2 - Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69 PB - International Joint Conferences on Artificial Intelligence PY - 1969 SP - 609 EP - 620 UR - https://ijcai.org/proceedings/1969/53 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: