first cauld meeting http loria fr pogodall cauld
play

First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ ARC INRIA - PowerPoint PPT Presentation

First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ ARC INRIA May 14th CAuLD 1 / 9 First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ Outline What is an ARC? 1 CAuLD:


  1. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ ARC INRIA May 14th CAuLD 1 / 9

  2. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ Outline What is an ARC? 1 CAuLD: Scientific Objectives 2 Scientific Background Objectives Participants 3 Today’s and Tomorrow’s Program 4 CAuLD 2 / 9

  3. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ What is an ARC? ARC: INRIA support for Collaborative Research Initiative Aim (...) to foster synergy between teams with differents, but complementary, skills and support areas of research which require contributions from researchers from several fields or organisations. CAuLD 3 / 9

  4. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ What is an ARC? ARC: INRIA support for Collaborative Research Initiative Aim (...) to foster synergy between teams with differents, but complementary, skills and support areas of research which require contributions from researchers from several fields or organisations. CAuLD’s Objectives At the interface between grammatical formalism and linguistic theory and modelling Aims at developping a grammatical formalism (based on programming methods) suitable for discourse representations Aims at reconsidering linguistic theories and modelling through this grammatical formalism Hence: people from formal semantics, formal linguistics, computer science With a common background: logic and type theory CAuLD 3 / 9

  5. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures CAuLD 4 / 9

  6. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) CAuLD 4 / 9

  7. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) CAuLD 4 / 9

  8. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) CAuLD 4 / 9

  9. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ CAuLD 4 / 9

  10. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) CAuLD 4 / 9

  11. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) If John owns a donkey ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ CAuLD 4 / 9

  12. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) If John owns a donkey, he beats it ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x ) CAuLD 4 / 9

  13. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) If John owns a donkey, he beats it ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x ) ( ∀ x (donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x )) CAuLD 4 / 9

  14. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) If John owns a donkey, he beats it ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x ) ( ∀ x (donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x )) Accessibility constraints John owns a donkey CAuLD 4 / 9

  15. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) If John owns a donkey, he beats it ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x ) ( ∀ x (donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x )) Accessibility constraints John owns a donkey It is grey CAuLD 4 / 9

  16. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background CAuLD: Construction Automatique de repr´ esentations Logiques du Discours Scientific Context Montague’s semantics: how to (automatically) associate semantic representations with expressions from their syntactic structures John owns a donkey ∃ x donkey( x ) ∧ owns(John , x ) Fails to deal with pronouns: If John owns a donkey, he is rich ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ rich(John) If John owns a donkey, he beats it ( ∃ x donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x ) ( ∀ x (donkey( x ) ∧ owns(John , x )) ⇒ beats(John , x )) Accessibility constraints John doesn’t own a donkey ∗ It is grey CAuLD 4 / 9

  17. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background DRT and DPL DRT [Kamp(1981), Kamp and Reyle(1993)] Elaborated to take the former phenomena into account Some weaknesses [Hinderer(2008)]: It needs symbol generators Compositional presentation [Muskens(1996)] does not have confluence Built-in theory of accessibility (different from Binding theory, SDRT, etc.) CAuLD 5 / 9

  18. First CAuLD Meeting http://www.loria.fr/~pogodall/cauld/ CAuLD: Scientific Objectives Scientific Background DRT and DPL DRT [Kamp(1981), Kamp and Reyle(1993)] Elaborated to take the former phenomena into account Some weaknesses [Hinderer(2008)]: It needs symbol generators Compositional presentation [Muskens(1996)] does not have confluence Built-in theory of accessibility (different from Binding theory, SDRT, etc.) DPL [Groenendijk and Stokhof(1991)] Non-standard interpretation of quantifiers CAuLD 5 / 9

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend