Daniel Bauer
Owen Rambow
2016
Hyperedge Replacement and Nonprojective Dependency Structures
David Chiang
Alexander Koller
Proceedings of the 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+12), June 29 - July 1, 2016, Heinrich Heine University, Düsseldorf, Germany
The Association for Computer Linguistics
103–111
https://www.aclweb.org/anthology/W16-3311/
Frank Drewes
Anna Jonsson
2017
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
Marco Kuhlmann
Tatjana Scheffler
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG 2017, Umeå, Sweden, September 4-6, 2017
Association for Computational Linguistics
102–111
https://www.aclweb.org/anthology/W17-6211/
Frank Drewes
Hans-Jörg Kreowski
Annegret Habel
1997
Hyperedge Replacement Graph Grammars
Grzegorz Rozenberg
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations
World Scientific
95–162
10.1142/9789812384720_0002
Sorcha Gilroy
Adam Lopez
Sebastian Maneth
2017
Parsing Graphs with Regular Graph Grammars
Nancy Ide
Aurélie Herbelot
Lluís Màrquez
Proceedings of the 6th Joint Conference on Lexical and Computational Semantics, *SEM @ACM 2017, Vancouver, Canada, August 3-4, 2017
Association for Computational Linguistics
199–208
10.18653/v1/S17-1024
Annegret Habel
1992
Hyperedge Replacement: Grammars and Languages
Lecture Notes in Computer Science
643
Springer
10.1007/BFb0013875
Bevan K. Jones
Jacob Andreas
Daniel Bauer
Karl Moritz Hermann
Kevin Knight
2012
Semantics-Based Machine Translation with Hyperedge Replacement Grammars
Martin Kay
Christian Boitet
COLING 2012, 24th International Conference on Computational Linguistics, Proceedings of the Conference: Technical Papers, 8-15 December 2012, Mumbai, India
Indian Institute of Technology Bombay
1359–1376
https://www.aclweb.org/anthology/C12-1083/
Joachim Lambek
1958
The Mathematics of Sentence Structure
The American Mathematical Monthly
65
3
154–170
10.1080/00029890.1958.11989160
http://www.jstor.org/stable/2310058
Mati Pentus
1993
Lambek Grammars Are Context Free
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), Montreal, Canada, June 19-23, 1993
IEEE Computer Society
429–433
10.1109/LICS.1993.287565
Mati Pentus
1995
Models for the Lambek Calculus
Ann. Pure Appl. Log.
75
1-2
179–213
10.1016/0168-0072(94)00063-9
Tikhon Pshenitsyn
2020
Hypergraph Basic Categorial Grammars
Fabio Gadducci
Timo Kehrer
Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Online, June 25-26, 2020, Proceedings
Lecture Notes in Computer Science
12150
Springer
146–162
10.1007/978-3-030-51372-6_9
Tikhon Pshenitsyn
2020
Weak Greibach Normal Form for Hyperedge Replacement Grammars
Berthold Hoffmann
Mark Minas
Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020, Online-Workshop, 24th June 2020
EPTCS
330
108–125
10.4204/EPTCS.330.7
Tikhon Pshenitsyn
2021
Introduction to a Hypergraph Logic Unifying Different Variants of the Lambek Calculus
https://arxiv.org/abs/2103.01199
Tikhon Pshenitsyn
2021
Powerful and NP-Complete: Hypergraph Lambek Grammars
Fabio Gadducci
Timo Kehrer
Graph Transformation - 14th International Conference, ICGT 2021, Held as Part of STAF 2021, Virtual Event, June 24-25, 2021, Proceedings
Lecture Notes in Computer Science
12741
Springer
102–121
10.1007/978-3-030-78946-6_6