Efficiency in Ambiguity : Two Models of Probabilistic Semantics for Natural Language. Clarke, D. & Keller, B. *Proceedings of the 11th International Conference on Computational Semantics, London, UK, April 15-17 2015*, 2015. abstract bibtex This paper explores theoretical issues in constructing an adequate probabilistic semantics for natural language. Two approaches are contrasted. The first extends Montague Semantics with a probability distribution over models. It has nice theoretical properties, but does not account for the ubiquitous nature of ambiguity; moreover inference is NP-hard. An alternative approach is described in which a sequence of pairs of sentences and truth values is generated randomly. By sacrificing some of the nice theoretical properties of the first approach it is possible to model ambiguity naturally; moreover inference now has polynomial time complexity. Both approaches provide a compositional semantics and account for the gradience of semantic judgements of belief and inference.

@article{Clarke2015,
title = {Efficiency in {Ambiguity} : {Two} {Models} of {Probabilistic} {Semantics} for {Natural} {Language}},
abstract = {This paper explores theoretical issues in constructing an adequate probabilistic semantics for natural language. Two approaches are contrasted. The first extends Montague Semantics with a probability distribution over models. It has nice theoretical properties, but does not account for the ubiquitous nature of ambiguity; moreover inference is NP-hard. An alternative approach is described in which a sequence of pairs of sentences and truth values is generated randomly. By sacrificing some of the nice theoretical properties of the first approach it is possible to model ambiguity naturally; moreover inference now has polynomial time complexity. Both approaches provide a compositional semantics and account for the gradience of semantic judgements of belief and inference.},
journal = {Proceedings of the 11th International Conference on Computational Semantics, London, UK, April 15-17 2015},
author = {Clarke, Daoud and Keller, Bill},
year = {2015},
keywords = {Probabilistic linguistics},
pages = {129--139},
}

Downloads: 0

{"_id":"AztJAoGRPqsgzkjzG","bibbaseid":"clarke-keller-efficiencyinambiguitytwomodelsofprobabilisticsemanticsfornaturallanguage-2015","author_short":["Clarke, D.","Keller, B."],"bibdata":{"bibtype":"article","type":"article","title":"Efficiency in Ambiguity : Two Models of Probabilistic Semantics for Natural Language","abstract":"This paper explores theoretical issues in constructing an adequate probabilistic semantics for natural language. Two approaches are contrasted. The first extends Montague Semantics with a probability distribution over models. It has nice theoretical properties, but does not account for the ubiquitous nature of ambiguity; moreover inference is NP-hard. An alternative approach is described in which a sequence of pairs of sentences and truth values is generated randomly. By sacrificing some of the nice theoretical properties of the first approach it is possible to model ambiguity naturally; moreover inference now has polynomial time complexity. Both approaches provide a compositional semantics and account for the gradience of semantic judgements of belief and inference.","journal":"Proceedings of the 11th International Conference on Computational Semantics, London, UK, April 15-17 2015","author":[{"propositions":[],"lastnames":["Clarke"],"firstnames":["Daoud"],"suffixes":[]},{"propositions":[],"lastnames":["Keller"],"firstnames":["Bill"],"suffixes":[]}],"year":"2015","keywords":"Probabilistic linguistics","pages":"129–139","bibtex":"@article{Clarke2015,\n\ttitle = {Efficiency in {Ambiguity} : {Two} {Models} of {Probabilistic} {Semantics} for {Natural} {Language}},\n\tabstract = {This paper explores theoretical issues in constructing an adequate probabilistic semantics for natural language. Two approaches are contrasted. The first extends Montague Semantics with a probability distribution over models. It has nice theoretical properties, but does not account for the ubiquitous nature of ambiguity; moreover inference is NP-hard. An alternative approach is described in which a sequence of pairs of sentences and truth values is generated randomly. By sacrificing some of the nice theoretical properties of the first approach it is possible to model ambiguity naturally; moreover inference now has polynomial time complexity. Both approaches provide a compositional semantics and account for the gradience of semantic judgements of belief and inference.},\n\tjournal = {Proceedings of the 11th International Conference on Computational Semantics, London, UK, April 15-17 2015},\n\tauthor = {Clarke, Daoud and Keller, Bill},\n\tyear = {2015},\n\tkeywords = {Probabilistic linguistics},\n\tpages = {129--139},\n}\n\n","author_short":["Clarke, D.","Keller, B."],"key":"Clarke2015","id":"Clarke2015","bibbaseid":"clarke-keller-efficiencyinambiguitytwomodelsofprobabilisticsemanticsfornaturallanguage-2015","role":"author","urls":{},"keyword":["Probabilistic linguistics"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/ifromm","dataSources":["N4kJAiLiJ7kxfNsoh"],"keywords":["probabilistic linguistics"],"search_terms":["efficiency","ambiguity","two","models","probabilistic","semantics","natural","language","clarke","keller"],"title":"Efficiency in Ambiguity : Two Models of Probabilistic Semantics for Natural Language","year":2015}