var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fzotero-mypublications%2FValentinDRichard&nocache=1&theme=default&fullnames=1&commas=true&group0=year&jsonp=1&showSearch=true&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fzotero-mypublications%2FValentinDRichard&nocache=1&theme=default&fullnames=1&commas=true&group0=year&jsonp=1&showSearch=true\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fzotero-mypublications%2FValentinDRichard&nocache=1&theme=default&fullnames=1&commas=true&group0=year&jsonp=1&showSearch=true\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Est-ce que l'extraction des interrogatives du français peut-elle être automatisée ?.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n In 5èmes journées du Groupement de Recherche CNRS “ Linguistique Informatique, Formelle et de Terrain ” (LIFT 2023), pages 69–76, Nancy, France, November 2023. CNRS\n \n\n\n\n
\n\n\n\n \n \n \"Est-cePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Richard_lift:2023,\n\taddress = {Nancy, France},\n\ttitle = {Est-ce que l'extraction des interrogatives du français peut-elle être automatisée ?},\n\tcopyright = {All rights reserved},\n\turl = {https://hal.science/hal-04359947},\n\tabstract = {The vast majority of linguistic corpus studies on French interrogatives retrieve the researched patterns by hand or only based on simple heuristics on raw text (e.g. interrogative words, question marks). In this paper, I present FUDIA (French UD Interrogative Annotator), a program able to detect French interrogatives from a corpus annotated in Universal Dependencies (UD). FUDIA is a rule-based graph rewriting system based on Grew. I inventory the obstacles to such an interrogative identification task and I explain how FUDIA solves most of them. I show that, coupled with a parser fine-tuned on similar data, FUDIA obtains good results on raw text (written and speech transcription).},\n\turldate = {2024-01-17},\n\tbooktitle = {5èmes journées du {Groupement} de {Recherche} {CNRS} “ {Linguistique} {Informatique}, {Formelle} et de {Terrain} ” ({LIFT} 2023)},\n\tpublisher = {CNRS},\n\tauthor = {Richard, Valentin D.},\n\tmonth = nov,\n\tyear = {2023},\n\tpages = {69--76},\n}\n\n
\n
\n\n\n
\n The vast majority of linguistic corpus studies on French interrogatives retrieve the researched patterns by hand or only based on simple heuristics on raw text (e.g. interrogative words, question marks). In this paper, I present FUDIA (French UD Interrogative Annotator), a program able to detect French interrogatives from a corpus annotated in Universal Dependencies (UD). FUDIA is a rule-based graph rewriting system based on Grew. I inventory the obstacles to such an interrogative identification task and I explain how FUDIA solves most of them. I show that, coupled with a parser fine-tuned on similar data, FUDIA obtains good results on raw text (written and speech transcription).\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the 4th Workshop on Inquisitiveness Below and Beyond the Sentence Boundary.\n \n \n \n \n\n\n \n Valentin D. Richard, & Floris Roelofsen.,\n editors.\n \n\n\n \n\n\n\n Association for Computational Linguistics, Nancy, France, June 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@book{Richard_Roelofsen_inqbnb4:2023,\n\taddress = {Nancy, France},\n\ttitle = {Proceedings of the 4th {Workshop} on {Inquisitiveness} {Below} and {Beyond} the {Sentence} {Boundary}},\n\tcopyright = {All rights reserved},\n\tisbn = {978-1-959429-96-8},\n\turl = {https://valentin-d-richard.fr/Publications/2023-Richard-Roelofsen-inqbnb4},\n\tlanguage = {en},\n\turldate = {2024-01-17},\n\tpublisher = {Association for Computational Linguistics},\n\teditor = {Richard, Valentin D. and Roelofsen, Floris},\n\tmonth = jun,\n\tyear = {2023},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Lambek-Grishin calculus: Focusing, display and full polarization.\n \n \n \n \n\n\n \n Giuseppe Greco, Valentin D. Richard, Michael Moortgat, & Apostolos Tzimoulis.\n\n\n \n\n\n\n In Alessandra Palmigiano, & Mehrnoosh Sadrzadeh., editor(s), Samson Abramsky on Logic and Structure in Computer Science and Beyond, of Outstanding Contributions to Logic. Springer Cham, 2023.\n arXiv: 2011.02895\n\n\n\n
\n\n\n\n \n \n \"Lambek-GrishinPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@incollection{Greco_etal_focusing_display::2021,\n\tseries = {Outstanding {Contributions} to {Logic}},\n\ttitle = {Lambek-{Grishin} calculus: {Focusing}, display and full polarization},\n\tcopyright = {All rights reserved},\n\tisbn = {978-3-031-24119-2},\n\turl = {https://valentin-d-richard.fr/Publications/2023-Greco-etal-fDLG},\n\tabstract = {Focused sequent calculi are a refinement of sequent calculi, where additional side-conditions on the applicability of inference rules force the implementation of a proof search strategy. Focused cut-free proofs exhibit a special normal form that is used for defining identity of sequent calculi proofs. We introduce a novel focused display calculus fD.LG and a fully polarized algebraic semantics FP.LG for Lambek-Grishin logic by generalizing the theory of multi-type calculi and their algebraic semantics with heterogenous consequence relations. The calculus fD.LG has strong focalization and it is sound and complete w.r.t. FP.LG. This completeness result is in a sense stronger than completeness with respect to standard polarized algebraic semantics (see e.g. the phase semantics of Bastenhof for Lambek-Grishin logic or Hamano and Takemura for linear logic), insofar we do not need to quotient over proofs with consecutive applications of shifts over the same formula. We plan to investigate the connections, if any, between this completeness result and the notion of full completeness introduced by Abramsky et al. We also show a number of additional results. fD.LG is sound and complete w.r.t. LG-algebras: this amounts to a semantic proof of the so-called completeness of focusing, given that the standard (display) sequent calculus for Lambek-Grishin logic is complete w.r.t. LG-algebras. fD.LG and the focused calculus f.LG of Moortgat and Moot are equivalent with respect to proofs, indeed there is an effective translation from f.LG-derivations to fD.LG-derivations and vice versa: this provides the link with operational semantics, given that every f.LG-derivation is in a Curry-Howard correspondence with a directional λμμ{\\textasciitilde}-term.},\n\tlanguage = {en},\n\tnumber = {25},\n\tbooktitle = {Samson {Abramsky} on {Logic} and {Structure} in {Computer} {Science} and {Beyond}},\n\tpublisher = {Springer Cham},\n\tauthor = {Greco, Giuseppe and Richard, Valentin D. and Moortgat, Michael and Tzimoulis, Apostolos},\n\teditor = {Palmigiano, Alessandra and Sadrzadeh, Mehrnoosh},\n\tyear = {2023},\n\tnote = {arXiv: 2011.02895},\n}\n\n
\n
\n\n\n
\n Focused sequent calculi are a refinement of sequent calculi, where additional side-conditions on the applicability of inference rules force the implementation of a proof search strategy. Focused cut-free proofs exhibit a special normal form that is used for defining identity of sequent calculi proofs. We introduce a novel focused display calculus fD.LG and a fully polarized algebraic semantics FP.LG for Lambek-Grishin logic by generalizing the theory of multi-type calculi and their algebraic semantics with heterogenous consequence relations. The calculus fD.LG has strong focalization and it is sound and complete w.r.t. FP.LG. This completeness result is in a sense stronger than completeness with respect to standard polarized algebraic semantics (see e.g. the phase semantics of Bastenhof for Lambek-Grishin logic or Hamano and Takemura for linear logic), insofar we do not need to quotient over proofs with consecutive applications of shifts over the same formula. We plan to investigate the connections, if any, between this completeness result and the notion of full completeness introduced by Abramsky et al. We also show a number of additional results. fD.LG is sound and complete w.r.t. LG-algebras: this amounts to a semantic proof of the so-called completeness of focusing, given that the standard (display) sequent calculus for Lambek-Grishin logic is complete w.r.t. LG-algebras. fD.LG and the focused calculus f.LG of Moortgat and Moot are equivalent with respect to proofs, indeed there is an effective translation from f.LG-derivations to fD.LG-derivations and vice versa: this provides the link with operational semantics, given that every f.LG-derivation is in a Curry-Howard correspondence with a directional λμμ~-term.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Lambek-Grishin Calculus: focusing, display and full polarization: Extended abstract.\n \n \n \n \n\n\n \n Giuseppe Greco, Michael Moortgat, Valentin D. Richard, & Apostolos Tzimoulis.\n\n\n \n\n\n\n In Clementino Maria Manuel, Jipsen Peter, & Picardo Jorge., editor(s), Book of Abstracts from Topology, Algebra, and Categories in Logic (TACL 2022), pages 79–81, Coimbra, Portugal, June 2022. \n \n\n\n\n
\n\n\n\n \n \n \"Lambek-GrishinPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Greco_etal_extabstr::2022,\n\taddress = {Coimbra, Portugal},\n\ttitle = {Lambek-{Grishin} {Calculus}: focusing, display and full polarization: {Extended} abstract},\n\tcopyright = {All rights reserved},\n\tshorttitle = {Lambek-{Grishin} {Calculus}},\n\turl = {https://valentin-d-richard.fr/Publications/2021-Greco-etal-fDLG-extabstr},\n\turldate = {2022-07-19},\n\tbooktitle = {Book of {Abstracts} from {Topology}, {Algebra}, and {Categories} in {Logic} ({TACL} 2022)},\n\tauthor = {Greco, Giuseppe and Moortgat, Michael and Richard, Valentin D. and Tzimoulis, Apostolos},\n\teditor = {Maria Manuel, Clementino and Peter, Jipsen and Jorge, Picardo},\n\tmonth = jun,\n\tyear = {2022},\n\tpages = {79--81},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Is natural language processing (NLP) going in the right direction?: Getting started with NLP ethics.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n October 2022.\n PhD seminar at Loria, Nancy, France\n\n\n\n
\n\n\n\n \n \n \"IsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@misc{Richard_ethics:2022,\n\taddress = {Loria, Nancy, France},\n\ttype = {Presentation},\n\ttitle = {Is natural language processing ({NLP}) going in the right direction?: {Getting} started with {NLP} ethics},\n\tcopyright = {All rights reserved},\n\tshorttitle = {Is natural language processing ({NLP}) going in the right direction?},\n\turl = {https://hal.science/hal-03813509},\n\tabstract = {In just a few decades, natural language processing (NLP) developed tremendously. By gaining access to extremely large natural language data and engineering scalable powerful architectures, language models managed to score well at a lot of tasks. As a result, NLP technologies are now being extensively commercialized, so much so that our everyday life is inescapably exposed to these systems. However, awareness about the risks of these technologies and NLP practice in general is not as well widespread. This raises issues regarding the use of such programmes and their harms. In this talk, I would like to discuss these problems. After some recap about modern-day NLP, I present some major issues pertaining to this field, and I sketch possible solutions.},\n\tlanguage = {en},\n\tauthor = {Richard, Valentin D.},\n\tmonth = oct,\n\tyear = {2022},\n\tnote = {PhD seminar at Loria, Nancy, France},\n}\n\n
\n
\n\n\n
\n In just a few decades, natural language processing (NLP) developed tremendously. By gaining access to extremely large natural language data and engineering scalable powerful architectures, language models managed to score well at a lot of tasks. As a result, NLP technologies are now being extensively commercialized, so much so that our everyday life is inescapably exposed to these systems. However, awareness about the risks of these technologies and NLP practice in general is not as well widespread. This raises issues regarding the use of such programmes and their harms. In this talk, I would like to discuss these problems. After some recap about modern-day NLP, I present some major issues pertaining to this field, and I sketch possible solutions.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Introducing Proof Tree Automata and Proof Tree Graphs: Extended abstract.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n In Åsa Hirvonen, & Fernando Velázquez-Quesada., editor(s), SLSS 2022 - 11th Scandinavian Logic Symposium, pages 10–12, Bergen, Norway, June 2022. \n \n\n\n\n
\n\n\n\n \n \n \"IntroducingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Richard_pta_extabstr::2022,\n\taddress = {Bergen, Norway},\n\ttitle = {Introducing {Proof} {Tree} {Automata} and {Proof} {Tree} {Graphs}: {Extended} abstract},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2022-Richard-pta},\n\tabstract = {In structural proof theory, designing and working on large calculi make it difficult to get intuitions about each rule individually and as part of a whole system. We introduce two novel tools to help working on calculi using the approach of graph theory and automata theory. The first tool is a Proof Tree Automaton (PTA): a tree automaton which language is the derivation language of a calculus. The second tool is a graphical representation of a calculus called Proof Tree Graph (PTG). In this directed hypergraph, vertices are sets of terms (e.g. sequents) and hyperarcs are rules. We explore properties of PTA and PTGs and how they relate to each other. We show that we can decompose a PTA as a partial map from a calculus to a traditional tree automaton. We formulate that statement in the theory of refinement systems. Finally, we compare our framework to proof nets and string diagrams.},\n\turldate = {2022-07-19},\n\tbooktitle = {{SLSS} 2022 - 11th {Scandinavian} {Logic} {Symposium}},\n\tauthor = {Richard, Valentin D.},\n\teditor = {Hirvonen, Åsa and Velázquez-Quesada, Fernando},\n\tmonth = jun,\n\tyear = {2022},\n\tpages = {10--12},\n}\n\n
\n
\n\n\n
\n In structural proof theory, designing and working on large calculi make it difficult to get intuitions about each rule individually and as part of a whole system. We introduce two novel tools to help working on calculi using the approach of graph theory and automata theory. The first tool is a Proof Tree Automaton (PTA): a tree automaton which language is the derivation language of a calculus. The second tool is a graphical representation of a calculus called Proof Tree Graph (PTG). In this directed hypergraph, vertices are sets of terms (e.g. sequents) and hyperarcs are rules. We explore properties of PTA and PTGs and how they relate to each other. We show that we can decompose a PTA as a partial map from a calculus to a traditional tree automaton. We formulate that statement in the theory of refinement systems. Finally, we compare our framework to proof nets and string diagrams.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Simulating feature structures with simple types.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n In Proceedings of the 2022 conference of the north american chapter of the association for computational linguistics: Human language technologies: Student research workshop, pages 113–122, Hybrid: Seattle, Washington + Online, July 2022. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"SimulatingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Richard_macg::2022,\n\taddress = {Hybrid: Seattle, Washington + Online},\n\ttitle = {Simulating feature structures with simple types},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2022-Richard-macg},\n\tabstract = {Feature structures have been several times considered to enrich categorial grammars in order to build fine-grained grammars. Most attempts to unify both frameworks either model categorial types as feature structures or add feature structures on top of categorial types. We pursue a different approach: using feature structure as categorial atomic types. In this article, we present a procedure to create, from a simplified HPSG grammar, an equivalent abstract categorial grammar (ACG). We represent a feature structure by the enumeration of its totally well-typed upper bounds, so that unification can be simulated as intersection. We implement this idea as a meta-ACG preprocessor.},\n\tbooktitle = {Proceedings of the 2022 conference of the north american chapter of the association for computational linguistics: {Human} language technologies: {Student} research workshop},\n\tpublisher = {Association for Computational Linguistics},\n\tauthor = {Richard, Valentin D.},\n\tmonth = jul,\n\tyear = {2022},\n\tpages = {113--122},\n}\n
\n
\n\n\n
\n Feature structures have been several times considered to enrich categorial grammars in order to build fine-grained grammars. Most attempts to unify both frameworks either model categorial types as feature structures or add feature structures on top of categorial types. We pursue a different approach: using feature structure as categorial atomic types. In this article, we present a procedure to create, from a simplified HPSG grammar, an equivalent abstract categorial grammar (ACG). We represent a feature structure by the enumeration of its totally well-typed upper bounds, so that unification can be simulated as intersection. We implement this idea as a meta-ACG preprocessor.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Embedding Intensional Semantics into Inquisitive Semantics.\n \n \n \n \n\n\n \n Philippe Groote, & Valentin D. Richard.\n\n\n \n\n\n\n In MOL 2021 - 17th Meeting on the Mathematics of Language, Montpellier (online), France, December 2021. \n \n\n\n\n
\n\n\n\n \n \n \"EmbeddingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{deGroote_Richard::2021,\n\taddress = {Montpellier (online), France},\n\ttitle = {Embedding {Intensional} {Semantics} into {Inquisitive} {Semantics}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2021-deGroote-Richard-inquisitivation},\n\tabstract = {Ciardelli, Roelofsen, and Theiler (2017) have shown how a Montague-like semantic frame- work based on inquisitive logic allows for a uniform compositional treatment of both declarative and interrogative constructs. In this setting, a natural question is the one of the relation between the intensional and the inquisitive interpretation of a declarative sentence. We tackle this problem by defining an embedding of intensional semantics into inquisitive semantics, in the spirit of de Groote’s and Kanazawa’s (2013) intensionalization procedure. We show that the resulting inquisitivation procedure preserves intensional validity and entailment.},\n\tlanguage = {en},\n\turldate = {2022-06-10},\n\tbooktitle = {{MOL} 2021 - 17th {Meeting} on the {Mathematics} of {Language}},\n\tauthor = {de Groote, Philippe and Richard, Valentin D.},\n\tmonth = dec,\n\tyear = {2021},\n}\n\n
\n
\n\n\n
\n Ciardelli, Roelofsen, and Theiler (2017) have shown how a Montague-like semantic frame- work based on inquisitive logic allows for a uniform compositional treatment of both declarative and interrogative constructs. In this setting, a natural question is the one of the relation between the intensional and the inquisitive interpretation of a declarative sentence. We tackle this problem by defining an embedding of intensional semantics into inquisitive semantics, in the spirit of de Groote’s and Kanazawa’s (2013) intensionalization procedure. We show that the resulting inquisitivation procedure preserves intensional validity and entailment.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Embedding Intentional Semantics into Inquisitive Semantics.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n Master's thesis, Université de Paris, Paris, France, June 2021.\n \n\n\n\n
\n\n\n\n \n \n \"EmbeddingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Richard_thesis::2021,\n\taddress = {Paris, France},\n\ttitle = {Embedding {Intentional} {Semantics} into {Inquisitive} {Semantics}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2021-Richard-inquisitivation},\n\tabstract = {Inquisitive semantics [Ciardelli, Groenedijk and Roelofsen, 2018] is a model of natural language semantics which uniformly represents interrogative and declarative sentences. Clauses are represented by a nonempty downward-closed set of sets of possible worlds, the maximal elements of which are called alternatives. Questions have several alternatives corresponding to their possible answers. In this thesis, we investigate an embedding of (declarative) intentional semantics into inquisitive semantics. We provide a conservative extension [de Groote, 2015] mapping every lexical meaning to an inquisitive meaning.},\n\tlanguage = {en},\n\turldate = {2022-07-19},\n\tschool = {Université de Paris},\n\tauthor = {Richard, Valentin D.},\n\tmonth = jun,\n\tyear = {2021},\n}\n\n
\n
\n\n\n
\n Inquisitive semantics [Ciardelli, Groenedijk and Roelofsen, 2018] is a model of natural language semantics which uniformly represents interrogative and declarative sentences. Clauses are represented by a nonempty downward-closed set of sets of possible worlds, the maximal elements of which are called alternatives. Questions have several alternatives corresponding to their possible answers. In this thesis, we investigate an embedding of (declarative) intentional semantics into inquisitive semantics. We provide a conservative extension [de Groote, 2015] mapping every lexical meaning to an inquisitive meaning.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Keyboards as a New Model of Computation.\n \n \n \n \n\n\n \n Yoan Géran, Bastien Laboureix, Corto Mascle, & Valentin D. Richard.\n\n\n \n\n\n\n In Filippo Bonchi, & Simon J. Puglisi., editor(s), 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), volume 202, of Leibniz International Proceedings in Informatics (LIPIcs), pages 49:1–49:20, Dagstuhl, Germany, August 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik\n ISSN: 1868-8969 Best student paper award\n\n\n\n
\n\n\n\n \n \n \"KeyboardsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Geran_etal::2021,\n\taddress = {Dagstuhl, Germany},\n\tseries = {Leibniz {International} {Proceedings} in {Informatics} ({LIPIcs})},\n\ttitle = {Keyboards as a {New} {Model} of {Computation}},\n\tvolume = {202},\n\tcopyright = {All rights reserved},\n\tisbn = {978-3-95977-201-3},\n\turl = {https://valentin-d-richard.fr/Publications/2021-Geran-etal-keyboards},\n\tdoi = {10.4230/LIPIcs.MFCS.2021.49},\n\tabstract = {We introduce a new formalisation of language computation, called keyboards. We consider a set of atomic operations (writing a letter, erasing a letter, going to the right or to the left) and we define a keyboard as a set of finite sequences of such operations, called keys. The generated language is the set of words obtained by applying some non-empty sequence of those keys. Unlike classical models of computation, every key can be applied anytime. We define various classes of languages based on different sets of atomic operations, and compare their expressive powers. We also compare them to rational, context-free and context-sensitive languages. We obtain a strict hierarchy of classes, whose expressiveness is orthogonal to the one of the aforementioned classical models. We also study closure properties of those classes, as well as fundamental complexity problems on keyboards.},\n\turldate = {2023-05-12},\n\tbooktitle = {46th {International} {Symposium} on {Mathematical} {Foundations} of {Computer} {Science} ({MFCS} 2021)},\n\tpublisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},\n\tauthor = {Géran, Yoan and Laboureix, Bastien and Mascle, Corto and Richard, Valentin D.},\n\teditor = {Bonchi, Filippo and Puglisi, Simon J.},\n\tmonth = aug,\n\tyear = {2021},\n\tnote = {ISSN: 1868-8969\nBest student paper award},\n\tpages = {49:1--49:20},\n}\n\n
\n
\n\n\n
\n We introduce a new formalisation of language computation, called keyboards. We consider a set of atomic operations (writing a letter, erasing a letter, going to the right or to the left) and we define a keyboard as a set of finite sequences of such operations, called keys. The generated language is the set of words obtained by applying some non-empty sequence of those keys. Unlike classical models of computation, every key can be applied anytime. We define various classes of languages based on different sets of atomic operations, and compare their expressive powers. We also compare them to rational, context-free and context-sensitive languages. We obtain a strict hierarchy of classes, whose expressiveness is orthogonal to the one of the aforementioned classical models. We also study closure properties of those classes, as well as fundamental complexity problems on keyboards.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Production d'Inférences Linguistiques avec des Animations Acoustiques.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n February 2019.\n Student squib\n\n\n\n
\n\n\n\n \n \n \"ProductionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{Richard_acoustic::2019,\n\taddress = {École Normale Supérieure, Paris, France},\n\ttype = {Student squib},\n\ttitle = {Production d'{Inférences} {Linguistiques} avec des {Animations} {Acoustiques}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2019-Richard-inf%C3%A9rences-animations-acoustiques},\n\tabstract = {La production d’inférences linguistiques est généralement reconnue comme un phénomène propre à une langue et encodé dans son lexique. De récentes études proposent une autre vision, en s’appuyant sur un protocole mettant en œuvre des phrases hybrides. Dans le but d’étendre ces résultats, cet\narticle étudie la production d’inférences (implicature, présupposition, supplément, homogénéité) à l’aide de sons iconiques non linguistiques. Les données récoltées semblent soutenir la thèse d’un processus plus général et cognitif, mais les expériences pourraient être approfondies voire refaites.},\n\tlanguage = {fr},\n\tauthor = {Richard, Valentin D.},\n\tmonth = feb,\n\tyear = {2019},\n\tnote = {Student squib},\n}\n\n
\n
\n\n\n
\n La production d’inférences linguistiques est généralement reconnue comme un phénomène propre à une langue et encodé dans son lexique. De récentes études proposent une autre vision, en s’appuyant sur un protocole mettant en œuvre des phrases hybrides. Dans le but d’étendre ces résultats, cet article étudie la production d’inférences (implicature, présupposition, supplément, homogénéité) à l’aide de sons iconiques non linguistiques. Les données récoltées semblent soutenir la thèse d’un processus plus général et cognitif, mais les expériences pourraient être approfondies voire refaites.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Introduction of Quantification in Frame Semantics.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n Master's thesis, ENS Paris-Saclay, Cachan, France, August 2019.\n arXiv:2002.00720\n\n\n\n
\n\n\n\n \n \n \"IntroductionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Richard_frame::2019,\n\taddress = {Cachan, France},\n\ttitle = {Introduction of {Quantification} in {Frame} {Semantics}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2019-Richard-quantification-frames},\n\tabstract = {Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of representing higher-order entities and relations. This is however needed in Frame Semantics, where semantic dependencies should be able to connect groups of individuals and their properties, especially to model quantification. To answer this issue, this master report introduces wrappings as a way to envelop a sub-FS and treat it as a node. Following the work of [Kallmeyer, Osswald 2013], we extend its syntax, semantics and some properties (translation to FOL, subsumption, unification). We can then expand the proposed pipeline. Lexical minimal model sets are generated from formulas. They unify by FS value equations obtained by LTAG parsing to an underspecified sentence representation. The syntactic approach of quantifiers allows us to use existing methods to produce any possible reading. Finally, we give a transcription to type-logical formulas to interact with the context in the view of dynamic semantics. Supported by ideas of Frame Types, this system provides a workable and tractable tool for higher-order relations with FS.},\n\tlanguage = {fr},\n\turldate = {2023-05-23},\n\tschool = {ENS Paris-Saclay},\n\tauthor = {Richard, Valentin D.},\n\tmonth = aug,\n\tyear = {2019},\n\tnote = {arXiv:2002.00720},\n}\n\n
\n
\n\n\n
\n Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of representing higher-order entities and relations. This is however needed in Frame Semantics, where semantic dependencies should be able to connect groups of individuals and their properties, especially to model quantification. To answer this issue, this master report introduces wrappings as a way to envelop a sub-FS and treat it as a node. Following the work of [Kallmeyer, Osswald 2013], we extend its syntax, semantics and some properties (translation to FOL, subsumption, unification). We can then expand the proposed pipeline. Lexical minimal model sets are generated from formulas. They unify by FS value equations obtained by LTAG parsing to an underspecified sentence representation. The syntactic approach of quantifiers allows us to use existing methods to produce any possible reading. Finally, we give a transcription to type-logical formulas to interact with the context in the view of dynamic semantics. Supported by ideas of Frame Types, this system provides a workable and tractable tool for higher-order relations with FS.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Glide Formation and its Absence of Compensatory Lengthening in French.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n October 2019.\n Student squib\n\n\n\n
\n\n\n\n \n \n \"GlidePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{Richard_lengthening::2019,\n\taddress = {Universiteit van Utrecht, Utrecht, The Netherlands},\n\ttype = {Student squib},\n\ttitle = {Glide {Formation} and its {Absence} of {Compensatory} {Lengthening} in {French}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2019-Richard-glide-fromation-without-lengthening-French.pdf},\n\tabstract = {Moraic theory predicts that whenever a vowel in a precedent syllabe turns into a glide, the next vowel gets lengthened. French observes optional glide formation from three high vowels /i y u/, but no such vowel lengthening. This squib explores why and proposes an analysis in terms of Optimality Theory.},\n\tlanguage = {en},\n\tauthor = {Richard, Valentin D.},\n\tmonth = oct,\n\tyear = {2019},\n\tnote = {Student squib},\n}\n\n
\n
\n\n\n
\n Moraic theory predicts that whenever a vowel in a precedent syllabe turns into a glide, the next vowel gets lengthened. French observes optional glide formation from three high vowels /i y u/, but no such vowel lengthening. This squib explores why and proposes an analysis in terms of Optimality Theory.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n French Left Dislocation with Silent Pronouns.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n November 2019.\n Student squib\n\n\n\n
\n\n\n\n \n \n \"FrenchPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{Richard_dislocation::2019,\n\taddress = {Universiteit van Utrecht, Utrecht, The Netherlands},\n\ttype = {Student squib},\n\ttitle = {French {Left} {Dislocation} with {Silent} {Pronouns}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2019-Richard-dislocation-French-silent-pronoun.pdf},\n\tabstract = {Dislocation is a widespread macrosyntactic phenomenon of spoken French. It consists in placing an element of the sentence at its beginning or at its end. Reducing the sentence core length, often bearing a pronoun co-referring to that element, it is mainly used to put topic on it. Contrary to other Romance languages, which also share dislocation, French exposes a broader variety of dislocation types, which undergo different constraints. We presents some examples of this diversity and the classical analysis due to [de Cat 2005]. The method employed is given and used to show that some types of dislocations cannot be analysed the same way. Different patterns appear when the pronoun seems to be silent.},\n\tlanguage = {en},\n\tauthor = {Richard, Valentin D.},\n\tmonth = nov,\n\tyear = {2019},\n\tnote = {Student squib},\n}\n\n
\n
\n\n\n
\n Dislocation is a widespread macrosyntactic phenomenon of spoken French. It consists in placing an element of the sentence at its beginning or at its end. Reducing the sentence core length, often bearing a pronoun co-referring to that element, it is mainly used to put topic on it. Contrary to other Romance languages, which also share dislocation, French exposes a broader variety of dislocation types, which undergo different constraints. We presents some examples of this diversity and the classical analysis due to [de Cat 2005]. The method employed is given and used to show that some types of dislocations cannot be analysed the same way. Different patterns appear when the pronoun seems to be silent.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Traduction des Grammaires Catégorielles de Lambek dans les Grammaires Catégorielles Abstraites.\n \n \n \n \n\n\n \n Valentin D. Richard.\n\n\n \n\n\n\n 2018.\n Bachelor's Thesis\n\n\n\n
\n\n\n\n \n \n \"TraductionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{Richard::2018,\n\taddress = {ENS Paris-Saclay, Cachan, France},\n\ttype = {Bachelor's {Thesis}},\n\ttitle = {Traduction des {Grammaires} {Catégorielles} de {Lambek} dans les {Grammaires} {Catégorielles} {Abstraites}},\n\tcopyright = {All rights reserved},\n\turl = {https://valentin-d-richard.fr/Publications/2018-Richard-LG-to-ACG},\n\tabstract = {Lambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types. It has been widely studied, especially for languages where the syntax plays a major role (like English). The goal of this internship report is to demonstrate that every Lambek Grammar can be, not entirely but efficiently, expressed in Abstract Categorial Grammars (ACG). The latter is a novel modelling based on higher-order signature homomorphisms (using λ-calculus), aiming at uniting the currently used models. The main idea is to transform the type rewriting system of LGs into that of Context-Free Grammars (CFG) by erasing introduction and elimination rules and generating enough axioms so that the cut rule suffices. This iterative approach preserves the derivations and enables us to stop the possible infinite generative process at any step. Although the underlying algorithm was not fully implemented, this proof provides another argument in favour of the relevance of ACGs in Natural Language Processing.},\n\tlanguage = {French},\n\tauthor = {Richard, Valentin D.},\n\tyear = {2018},\n\tnote = {Bachelor's Thesis},\n}\n\n
\n
\n\n\n
\n Lambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types. It has been widely studied, especially for languages where the syntax plays a major role (like English). The goal of this internship report is to demonstrate that every Lambek Grammar can be, not entirely but efficiently, expressed in Abstract Categorial Grammars (ACG). The latter is a novel modelling based on higher-order signature homomorphisms (using λ-calculus), aiming at uniting the currently used models. The main idea is to transform the type rewriting system of LGs into that of Context-Free Grammars (CFG) by erasing introduction and elimination rules and generating enough axioms so that the cut rule suffices. This iterative approach preserves the derivations and enables us to stop the possible infinite generative process at any step. Although the underlying algorithm was not fully implemented, this proof provides another argument in favour of the relevance of ACGs in Natural Language Processing.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);