Semantic complexity of quantifiers and their distribution in corpora

Camilo Thorne, Jakub Szymanik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

The semantic complexity of a quantifier can be defined as the computational complexity of the finite model checking problem induced by its semantics. This paper describes a preliminary study to understand if quantifier distribution in corpora can be to some extent predicted or explained by semantic complexity. We show that corpora distributions for English are significantly skewed towards quantifiers of low complexity and that this bias can be described in some cases by a power law.

Original languageEnglish
Title of host publicationIWCS 2015 - Proceedings of the 11th International Conference on Computational Semantics
PublisherAssociation for Computational Linguistics (ACL)
Pages64-69
Number of pages6
ISBN (Electronic)9781941643334
StatePublished - 2015
Externally publishedYes
Event11th International Conference on Computational Semantics, IWCS 2015 - London, United Kingdom
Duration: Apr 15 2015Apr 17 2015

Publication series

NameIWCS 2015 - Proceedings of the 11th International Conference on Computational Semantics

Conference

Conference11th International Conference on Computational Semantics, IWCS 2015
Country/TerritoryUnited Kingdom
CityLondon
Period04/15/1504/17/15

Fingerprint

Dive into the research topics of 'Semantic complexity of quantifiers and their distribution in corpora'. Together they form a unique fingerprint.

Cite this