International Conference on Formal Grammar FG 2018: Formal Grammar 2018
The Formal Grammar conference series (FG) provides a forum for the presentation of
new and original research on formal grammar, mathematical linguistics, and the
application of formal and mathematical methods to the study of natural language.
Themes of interest include, but are not limited to:
– Formal and computational phonology, morphology, syntax, semantics, and
– Model-theoretic and proof-theoretic methods in linguistics
– Logical aspects of linguistic structure
– Constraint-based and resource-sensitive approaches to grammar
– Learnability of formal grammar
– Integration of stochastic and symbolic models of grammar
– Foundational, methodological, and architectural issues in grammar and linguistics
– Mathematical foundations of statistical approaches to linguistic analysis
Previous FG meetings were held in Barcelona (1995), Prague (1996),
Aix-en-Provence (1997), Saarbrücken (1998), Utrecht (1999), Helsinki (2001), Trento
(2002), Vienna (2003), Nancy (2004), Edinburgh (2005), Malaga (2006), Dublin
(2007), Hamburg (2008), Bordeaux (2009), Copenhagen (2010), Ljubljana (2011),
Opole (2012), Düsseldorf (2013), Tübingen (2014), Barcelona (2015), Bolzano-Bozen
(2016), and Toulouse (2017).
FG 2018, the 23rd conference on Formal Grammar, was held in Sofia, Bulgaria,
during August 11–12, 2018. The conference consisted in a special session, dedicated to
the memory of Richard T. Oehrle, who passed away in 2018, and seven contributed
papers selected from 11 submissions. The present volume includes the contributed
We would like to thank the people who made the 23rd FG conference possible: the
invited speakers, the members of the Program Committee, and the organizers of
ESSLLI 2018, with which the conference was colocated.
August 2018 Annie Foret
Relativisation involves dependencies which, although unbounded, are constrained with respect to certain island domains. The Lambek calculus L can provide a very rudimentary account of relativisation limited to unbounded peripheral extraction; the Lambek calculus with bracket modalities Lb can further condition this account according to island domains. However in naïve parsing/theorem-proving by backward chaining sequent proof search for Lb the bracketed island domains, which can be indefinitely nested, have to be specified in the linguistic input. In realistic parsing word order is given but such hierarchical bracketing structure cannot be assumed to be given. In this paper we show how parsing can be realised which induces the bracketing structure in backward chaining sequent proof search with Lb.