Research

Sémagramme is a follow-up to the computational linguistic activities of the former INRIA team Calligramme.

The overall objective of the Sémagramme project is to design and develop new unifying logic-based models, methods, and tools for the semantic analysis of natural language utterances and discourses. This includes the logical modelling of pragmatic phenomena related to discourse dynamics. Typically, these models and methods will be based on standard logical concepts (stemming from formal language theory, mathematical logic, and type theory), which should make them easy to integrate.

The project is organized along three research directions:

Syntax-Semantics Interface

The Sémagramme project intends to focus on the semantics of natural languages (in a wider sense than usual, including some pragmatics). Nevertheless, the semantic construction process is syntactically guided, that is, the constructions of logical representations of meaning are based on the analysis of the syntactic structures. We do not want, however, to commit ourselves to such or such specific theory of syntax. Consequently, our approach should be based on an abstract generic model of the syntax-semantic interface.

Here, an important idea of Montague comes into play, namely, the “homomorphism requirement”: semantics must appear as a homomorphic image of syntax. While this idea is almost a truism in the context of mathematical logic, it remains challenged in the context of natural languages. Nevertheless, Montague’s idea has been quite fruitful, especially in the field of categorial grammars, where van Benthem showed how syntax and semantics could be connected using the Curry-Howard isomorphism [3]. This correspondence is the keystone of the syntax-semantics interface of modern type-logical grammars [14]. It also motivated the definition of our own Abstract Categorial Grammars [6].

Technically, an Abstract Categorial Grammar simply consists of a (linear) homomorphism between two higher-order signatures. Extensive studies have shown that this simple model allows several grammatical formalisms to be expressed, providing them with a syntax-semantics interface for free [7, 8, 9, 16, 13, 17].

We intend to carry on with the development of the Abstract Categorial Grammar framework. At the foundational level, we will define and study possible type theoretic extensions of the formalism, in order to increase its expressive power and its flexibility. At the implementation level, we will continue the development of an Abstract Categorial Grammar support system.

As said above, to consider the syntax-semantics interface as the starting point of our investigations allows us not to be committed to some specific syntactic theory. The Montagovian syntax-semantics interface, however, cannot be considered to be universal. In particular, it does not seem to be that well adapted to dependency and model-theoretic grammars. Consequently, in order to be as generic as possible, we intend to explore alternative models of the syntax-semantics interface. In particular, we will explore relational models where several distinct semantic representations can correspond to the same syntactic structure.

Discourse Dynamics

It is well known that the interpretation of a discourse is a dynamic process. Take a sentence occurring in a discourse. On the one hand, it must be interpreted according to its context. On the other hand, its interpretation affects this context, and must therefore result in an updating of the current context. For this reason, discourse interpretation is traditionally considered to belong to pragmatics. The cut between pragmatics and semantics, however, is not that clear.

As we mentioned above, we intend to apply to some aspects of pragmatics (mainly, discourse dynamics) the same methodological tools Montague applied to semantics. The challenge here is to obtain a completely compositional theory of discourse interpretation, by respecting Montague’s homomorphism requirement. We think that this is possible by using techniques coming from programming language theory, in particular, continuation semantics [19, 1, 2, 18] and the related theories of functional control operators [5, 4].

We have indeed successfully applied such techniques in order to model the way quantifiers in natural languages may dynamically extend their scope [10]. We intend to tackle, in a similar way, other dynamic phenomena (typically, anaphora and referential expressions, presupposition, modal subordination…).

What characterize these different dynamic phenomena is that their interpretations need information to be retrieved from a current context. This raises the question of the modeling of the context itself. At a foundational level, we have to answer questions such as the following. What is the nature of the information to be stored in the context? What are the processes that allow implicit information to be inferred from the context? What are the primitives that allow a context to be updated? How does the structure of the discourse and the discourse relations affect the structure of the context? These questions also raise implementation issues. What are the appropriate datatypes? How can we keep the complexity of the inference algorithms sufficiently low?

Common Basic Resources

Even if our research primarily focuses on semantics and pragmatics, we nevertheless need syntax. More precisely, we need syntactic trees to start with. We consequently need grammars, lexicons, and parsing algorithms to produce such trees. During the last years, we have developed the notion of interaction grammar [12] and graph rewriting [11] as models of natural language syntax. This includes the development of grammars for French [15, 11], together with morpho-syntactic lexicons. We intend to continue this line of research and development. In particular, we want to increase the coverage of our grammars for French, and provide our parsers with more robust algorithms.

Further primary resources are needed in order to put at work a computational semantic analysis of utterances and discourses. As we want our approach to be as compositional as possible, we must develop lexicons annotated with semantic information. This opens the quite wide research area of lexical semantics.

Finally, when dealing with logical representations of utterance interpretations, the need for inference facilities is ubiquitous. Inference is needed in the course of the interpretation process, but also to exploit the result of the interpretation. Indeed, an advantage of using formal logic for semantic representations is the possibility of using logical inference to derive new information. From a computational point of view, however, logical inference may be highly complex. Consequently, we need to investigate which logical fragments can be used efficiently for natural language oriented inference.

References

[1] [doi] Barker, C.. (2002). Continuations and the nature of quantification. Natural language semantics, 10(3), 211–242.
[Bibtex]
@article{barker:2002,
author = {Chris Barker},
title = {Continuations and the Nature of Quantification},
journal = {Natural Language Semantics},
year = {2002},
volume = {10},
number = {3},
pages = {211--242},
doi="10.1023/A:1022183511876"}
[2] [pdf] Barker, C.. (2004). Continuations in natural language. Paper presented at the Proceedings of the fourth acm-sigplan continuations workshop (cw’04).
[Bibtex]
@inproceedings{barker:2004,
author = {Chris Barker},
title = {Continuations in Natural Language},
booktitle = {Proceedings of the Fourth ACM-SIGPLAN Continuations Workshop (CW'04)},
editor = {Hayo Thielecke},
year = {2004},
pdf = {http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf}}
[3] van Benthem, J.. (1986). Essays in logical semantics Reidel.
[Bibtex]
@book{vanBenthem:1986,
Author = {van Benthem, Johan},
Number = {29},
Publisher = {Reidel},
Title = {Essays in logical semantics},
Year = {1986}}
[4] [doi] Felleisen, M., & Hieb, R.. (1992). The revised report on the syntactic theories of sequential control and state. Theoretical computer science, 103(2), 235-271.
[Bibtex]
@article{felleisen-hieb:1992,
Author = {Matthias Felleisen and Robert Hieb},
Doi = {10.1016/0304-3975(92)90014-7},
Issn = {0304-3975},
Journal = {Theoretical Computer Science},
Number = {2},
Pages = {235 - 271},
Title = {The revised report on the syntactic theories of sequential control and state},
Volume = {103},
Year = {1992}}
[5] [doi] Felleisen, M., Friedman, D. P., Kohlbecker, E., & Duba, B.. (1987). A syntactic theory of sequential control. Theoretical computer science, 52, 205–237.
[Bibtex]
@article{felleisen-et-al:1987,
Author = {Felleisen, Matthias and Friedman, D. P. and Kohlbecker, E. and Duba, B.},
Doi = {10.1016/0304-3975(87)90109-5},
Issue = {3},
Journal = {Theoretical Computer Science},
Month = {June},
Numpages = {33},
Pages = {205--237},
Title = {A syntactic theory of sequential control},
Volume = {52},
Year = {1987}}
[6] [pdf] de Groote, P.. (2001). Towards Abstract Categorial Grammars. Paper presented at the Proceedings of 39th annual meeting of the association for computational linguistics.
[Bibtex]
@InProceedings{degroote:2001,
author = {de Groote, Philippe },
title = {Towards {A}bstract {C}ategorial {G}rammars},
booktitle = {Proceedings of 39th Annual Meeting of the Association for Computational Linguistics},
pages = {148--155},
year = {2001},
pdf = {http://aclweb.org/anthology/P01-1033},
eprinttype = {acl},
eprint = {P01-1033}
}
[7] [doi] de Groote, P., & Pogodalla, S.. (2004). On the expressive power of abstract categorial grammars: representing context-free formalisms. Journal of logic, language and information, 13(4), 421–438.
[Bibtex]
@article{degroote:2004,
Author = {de Groote, Philippe and Pogodalla, Sylvain},
Journal = {Journal of Logic, Language and Information},
Number = {4},
Pages = {421--438},
Publisher = {Springer},
Doi = {10.1007/s10849-004-2114-x},
Title = {On the expressive power of abstract categorial grammars: Representing context-free formalisms},
Volume = {13},
Year = {2004}}
[8] [pdf] de Groote, P.. (2002). Tree-Adjoining Grammars as Abstract Categorial Grammars. Paper presented at the Proceedings of the sixth international workshop on tree adjoining grammars and related frameworks (tag+6).
[Bibtex]
@inproceedings{degroote:2002,
author = {de Groote, Philippe},
title = {{T}ree-{A}djoining {G}rammars as {A}bstract {C}ategorial {G}rammars},
booktitle = {Proceedings of the Sixth International Workshop
on Tree Adjoining Grammars and Related Frameworks (TAG+6)},
pages = {145--150},
publisher = {Universit\`a di Venezia},
year = {2002},
pdf = {http://aclweb.org/anthology/W02-2220}}
[9] [pdf] de Groote, P., & Pogodalla, S.. (2003, 2003). m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars. Paper presented at the Proceedings of Eighth Meeting on Mathematics of Language (MOL 8), Bloomington, Indiana, United States.
[Bibtex]
@inproceedings{degroote:2003,
Author = {de Groote, Philippe and Pogodalla, Sylvain},
Editor = {Oehrle, Richard T. and Rogers, James},
Address = {Bloomington, Indiana, United States},
Pdf = {https://hal.inria.fr/inria-00107690},
Booktitle = {{Proceedings of Eighth Meeting on Mathematics of Language (MOL 8)}},
Date = {2003},
Pages = {71--80},
Title = {{m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars}},
Year = {2003},
Month = {6},
Hal_id = {inria-00107690},
}
[10] [doi] de Groote, P.. (2006). Towards a montagovian account of dynamics. Paper presented at the Proceedings of the 16th semantics and linguistic theory conference (salt 16).
[Bibtex]
@inproceedings{degroote:2006,
author = {de Groote, Philippe},
title = {Towards a Montagovian account of dynamics},
booktitle = {Proceedings of the 16th Semantics and Linguistic Theory Conference (SALT 16)},
editor = {Masayuki Gibson and Jonathan Howell},
year = {2006},
doi = {10.3765/salt.v16i0.2952}}
[11] [pdf] Guillaume, B., & Perrier, G.. (2015). Dependency Parsing with Graph Rewriting. Paper presented at the IWPT 2015, 14th International Conference on Parsing Technologies, Bilbao, Spain.
[Bibtex]
@inproceedings{guillaume:hal-01188694,
TITLE = {{Dependency Parsing with Graph Rewriting}},
AUTHOR = {Guillaume, Bruno and Perrier, Guy},
PDF = {https://hal.inria.fr/hal-01188694},
BOOKTITLE = {{IWPT 2015, 14th International Conference on Parsing Technologies}},
ADDRESS = {Bilbao, Spain},
SERIES = {14th International Conference on Parsing Technologies - Proceedings of the Conference},
PAGES = {30-39},
YEAR = {2015},
KEYWORDS = {Dependency Grammar ; Parsing ; Graph Rewriting},
HAL_ID = {hal-01188694},
HAL_VERSION = {v1},
}
[12] [doi] Guillaume, B., & Perrier, G.. (2009). Interaction grammars. Research on language & computation, 7, 171–208.
[Bibtex]
@article{guillaume-perrier:2009,
Author = {Bruno Guillaume and Guy Perrier},
Journal = {Research on Language \& Computation},
Pages = {171--208},
Title = {Interaction Grammars},
Volume = {7},
Year = {2009},
doi = {10.1007/s11168-010-9066-x}}
[13] [pdf] Kanazawa, M., & Salvati, S.. (2007). Generating control languages with abstract categorial grammars. .
[Bibtex]
@article{kanazawa-salvati:2007,
title = {Generating Control Languages with Abstract Categorial Grammars},
author = {Makoto Kanazawa and Sylvain Salvati},
booktitle = {Proceedings of the 12th conference on {F}ormal {G}rammar ({FG} 2007)},
publisher = {{CSLI} {P}ublications },
editor = {Gerald Penn},
pdf = {http://research.nii.ac.jp/~kanazawa/publications/control.pdf},
year = {2007},
}
[14] Moortgat, M.. (1997). Categorial type logics. Handbook of logic and language, 93–177.
[Bibtex]
@article{moortgat:1997,
Author = {Moortgat, M.},
Journal = {Handbook of logic and language},
Pages = {93--177},
Publisher = {Cambridge, MA: The MIT Press},
Title = {Categorial type logics},
Year = {1997}}
[15] [pdf] Perrier, G.. (2007). A French Interaction Grammar. Paper presented at the International Conference on Recent Advances in Natural Language Processing – RANLP 2007, Borovets, Bulgarie.
[Bibtex]
@inproceedings{perrier:inria-00184108_1,
Address = {Borovets, Bulgarie},
Author = {Perrier, Guy},
Booktitle = {{International Conference on Recent Advances in Natural Language Processing - RANLP 2007}},
Editor = {Galia Angelova and Kalina Bontcheva and Ruslan Mitkov and Nicolas Nicolov and Kiril Simov},
Hal_Id = {inria-00184108},
Organization = {IPP \& BAS \& ACL-Bulgaria},
Pages = {463-467},
Pdf = {http://hal.inria.fr/inria-00184108/PDF/perrier.pdf},
Publisher = {INCOMA Ltd, Shoumen, Bulgaria},
Title = {{A French Interaction Grammar}},
Pdf = {http://hal.inria.fr/inria-00184108},
Year = {2007},}
[16] [pdf] Pogodalla, S.. (2004, 2004). Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees. Paper presented at the Proceedings of the 7th international workshop on tree adjoining grammar and related formalisms (tag+7), Vancouver, BC, Canada.
[Bibtex]
@Inproceedings{pogodalla:inria-00107768,
Author = {Pogodalla, Sylvain},
Editor = {Rambow, Owen and Stone, Mattew},
Address = {Vancouver, BC, Canada},
Pdf = {http://aclweb.org/anthology/W04-3309},
Booktitle = {Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+7)},
Crossref = {tag7:2004},
Date = {2004},
Keywords = {{author: me}},
Pages = {64--71},
Title = {{Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees}},
Year = {2004},
Hal_id = {inria-00107768},
}
[17] [pdf] [doi] Retoré, C., & Salvati, S.. (2010). A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars. Journal of logic, language and information, 19(2), 185–200.
[Bibtex]
@article{retore:2010:inria-00409557_1,
Author = {Retor{\'e}, Christian and Salvati, Sylvain},
Hal_Id = {inria-00409557},
Journal = {Journal of Logic, Language and Information},
Month = Apr,
Number = {2},
Pages = {185--200},
Publisher = {Springer},
Title = {{A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars}},
Pdf = {http://hal.inria.fr/inria-00409557/},
Volume = {19},
Year = {2010},
doi = {10.1007/s10849-009-9111-z}}
[18] [pdf] Shan, C.. (2004). Delimited continuations in natural language: quantification and polarity sensitivity. .
[Bibtex]
@article{shan:2004,
author = {Chung-chieh Shan},
title = {Delimited Continuations in Natural Language: quantification and polarity sensitivity},
booktitle = {Proceedings of the Fourth ACM-SIGPLAN Continuations Workshop (CW'04)},
editor = {Hayo Thielecke},
year = {2004},
pdf = {http://www.cs.bham.ac.uk/~hxt/cw04/shan.pdf}}
[19] [doi] Strachey, C., & Wadsworth, C. P.. (1974). Continuations: a mathematical semantics for handling full jumps. Higher-order and symbolic computation, 13, 135–152.
[Bibtex]
@article{strachey-wadsworth:1974,
Author = {Christopher Strachey and Christopher P. Wadsworth},
Journal = {Higher-Order and Symbolic Computation},
Pages = {135--152},
Title = {Continuations: A Mathematical Semantics for Handling Full Jumps},
Volume = {13},
Year = {1974},
doi = {10.1023/A:1010026413531}}

Comments are closed.