TY - GEN
T1 - Bayesian inference semantics
T2 - 8th Joint Conference on Lexical and Computational Semantics, *SEM@NAACL-HLT 2019
AU - Bernardy, Jean Philippe
AU - Blanck, Rasmus
AU - Chatzikyriakidis, Stergios
AU - Lappin, Shalom
AU - Maskharashvili, Aleksandre
N1 - Publisher Copyright:
© 2019 Association for Computational Linguistics
PY - 2019
Y1 - 2019
N2 - We present BIS, a Bayesian Inference Semantics, for probabilistic reasoning in natural language. The current system is based on the framework of Bernardy et al. (2018), but departs from it in important respects. BIS makes use of Bayesian learning for inferring a hypothesis from premises. This involves estimating the probability of the hypothesis, given the data supplied by the premises of an argument. It uses a syntactic parser to generate typed syntactic structures that serve as input to a model generation system. Sentences are interpreted compositionally to probabilistic programs, and the corresponding truth values are estimated using sampling methods. BIS successfully deals with various probabilistic semantic phenomena, including frequency adverbs, generalised quantifiers, generics, and vague predicates. It performs well on a number of interesting probabilistic reasoning tasks. It also sustains most classically valid inferences (instantiation, de Morgan's laws, etc.). To test BIS we have built an experimental test suite with examples of a range of probabilistic and classical inference patterns.
AB - We present BIS, a Bayesian Inference Semantics, for probabilistic reasoning in natural language. The current system is based on the framework of Bernardy et al. (2018), but departs from it in important respects. BIS makes use of Bayesian learning for inferring a hypothesis from premises. This involves estimating the probability of the hypothesis, given the data supplied by the premises of an argument. It uses a syntactic parser to generate typed syntactic structures that serve as input to a model generation system. Sentences are interpreted compositionally to probabilistic programs, and the corresponding truth values are estimated using sampling methods. BIS successfully deals with various probabilistic semantic phenomena, including frequency adverbs, generalised quantifiers, generics, and vague predicates. It performs well on a number of interesting probabilistic reasoning tasks. It also sustains most classically valid inferences (instantiation, de Morgan's laws, etc.). To test BIS we have built an experimental test suite with examples of a range of probabilistic and classical inference patterns.
UR - http://www.scopus.com/inward/record.url?scp=85095239060&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85095239060&partnerID=8YFLogxK
U2 - 10.18653/v1/S19-1029
DO - 10.18653/v1/S19-1029
M3 - Conference contribution
AN - SCOPUS:85095239060
T3 - *SEM@NAACL-HLT 2019 - 8th Joint Conference on Lexical and Computational Semantics
SP - 263
EP - 272
BT - *SEM@NAACL-HLT 2019 - 8th Joint Conference on Lexical and Computational Semantics
PB - Association for Computational Linguistics (ACL)
Y2 - 6 June 2019 through 7 June 2019
ER -