An Introduction to Shape Schema Grammars
Robert Woodbury
What the paper says
Shape schema grammars generalize parametric shape grammars so that both rules and the objects to which they apply are expressed with shape schemata. This paper defines shape schema grammars. It starts with a notation for schemata in general and shape schemata in particular. Schema equality is shown to have at least three possible definitions, of which schema consistency is the most useful. A limited notion of shape schema maximality potentially reduces the size and redundancy of a given schema. Shape schema subpart is a multifunction returning all of the possible ways that one shape schema can be embedded in another. Shape schema difference and addition complete the basic mathematical operations over shape schemata required to define shape schema rules, grammars and languages.
5 citations
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.25 × 0.4 = 0.10 |
| M · momentum | 0.68 × 0.15 = 0.10 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.