Non-size increasing graph rewriting for natural language processing

DOI10.1017/S0960129518000178MaRDI QIDQ4585012zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Non-simplifying graph rewriting termination
• Graph grammars based on node rewriting: An introduction to NLC graph grammars
• scientific article; zbMATH DE number 3872712
• scientific article; zbMATH DE number 2086416
• Note on node-rewriting graph grammars

Cites work

• Graph grammars with neighbourhood-controlled embedding
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 1183250 (Why is no real title available?)
• scientific article; zbMATH DE number 1339873 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• On theories with a combinatorial definition of 'equivalence'
• Termination detection of distributed algorithms by graph relabelling systems
• Universal grammar

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)