A computational treatment of anaphora and its algorithmic implementation
From MaRDI portal
Recommendations
Cites work
- Adverbs in a modern type theory
- Combining effects: sum and tensor
- Common nouns as types
- Dynamic predicate logic
- Handlers of Algebraic Effects
- scientific article; zbMATH DE number 1501611 (Why is no real title available?)
- scientific article; zbMATH DE number 783772 (Why is no real title available?)
- Introducing a calculus of effects and handlers for natural language semantics
- Notions of computation and monads
Cited in
(9)- Anaphora resolution. Algorithms, resources, and applications
- Lorenzen won the game, Lorenz did too: dialogical logic for ellipsis and anaphora resolution
- Intra-document anaphora resolution: a survey
- Implementing the binding and accommodation theory for anaphora resolution and presupposition projection
- scientific article; zbMATH DE number 1753150 (Why is no real title available?)
- scientific article; zbMATH DE number 1755776 (Why is no real title available?)
- scientific article; zbMATH DE number 1897884 (Why is no real title available?)
- Algebraic effects for extensible dynamic semantics
- Mathematical structures in natural language semantics: Zawadowski's contribution to linguistics
This page was built for publication: A computational treatment of anaphora and its algorithmic implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035844)