Parsing Weighted Order-Preserving Hyperedge Replacement Grammars [Elektronisk resurs]

• We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars and prove that the weight of a graph according to such a weighted graph grammar can be computed uniformly in quadratic time (under assumptions made precise in the paper). 

Ämnesord

Natural Sciences  (hsv)

Computer and Information Sciences  (hsv)

Computer Sciences  (hsv)

Naturvetenskap  (hsv)

Data- och informationsvetenskap  (hsv)

Datavetenskap (datalogi)  (hsv)

Computing Science  (umu)

administrativ databehandling  (umu)

Genre

government publication  (marcgt)

Indexterm och SAB-rubrik

graph grammars

order-preservation

parsing

weighted graph grammars