Parsing of edNLC-graph grammars for scene analysis
✍ Scribed by Mariusz Flasiński
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 496 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The study of the structural properties of MIMO systems was previously done using a graph approach. This paper presents a new method using bond-graph methodology to derive information on structural controllability/observability properties of a system. The notion of structural rank is defined, and cau
In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio
Compounds can be analyzed in HPSG as head/complement structures, corresponding to verbal compounds, and head/adjunct structures, corresponding to non-verbal compounds. The rules that create these structures are also responsible for paraphrases using prepositional modification. Although compounds are