Non-size increasing graph rewriting for natural language processing

DOI10.1017/S0960129518000178zbMATH Open1398.68270OpenAlexW2736250658WikidataQ129511034 ScholiaQ129511034MaRDI QIDQ4585012FDOQ4585012

Authors: Guillaume Bonfante, Bruno Guillaume 

Publication date: 5 September 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129518000178

Recommendations

• Non-simplifying graph rewriting termination
• scientific article; zbMATH DE number 177419
• scientific article; zbMATH DE number 3872712
• scientific article; zbMATH DE number 2086416
• Note on node-rewriting graph grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• On theories with a combinatorial definition of 'equivalence'
• Handbook of Graph Grammars and Computing by Graph Transformation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Universal grammar
• Graph grammars with neighbourhood-controlled embedding
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Graph transformation for incremental natural language analysis
• Non-simplifying graph rewriting termination

This page was built for publication: Non-size increasing graph rewriting for natural language processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4585012)