An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (Q3540387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5369704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars |
scientific article; zbMATH DE number 5369704 |
Statements
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (English)
0 references
20 November 2008
0 references
hypergraph completion
0 references
hyperedge replacement
0 references
parsing
0 references
0 references
0.7762740254402161
0 references
0.7655674815177917
0 references
0.7650554776191711
0 references
0.7576766610145569
0 references
0.7572948336601257
0 references
