1. Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceeding of ACL 2013, pp. 924–932. Association for Computational Linguistic (2013)
2. Lecture Notes in Computer Science;A Clark,2011
3. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. J. Mach. Learn. Res. 8, 1725–1745 (2007)
4. Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement graph grammars. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 95–162. World Scientific (1997)
5. Gildea, D.: Grammar factorization by tree decomposition. Comput. Linguist. 37(10), 231–248 (2011)