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.
Semantic complexity of quantifiers and their distribution in corpora / Thorne, C.; Szymanik, J.. - (2015), pp. 64-69. ( 11th International Conference on Computational Semantics, IWCS 2015 London 2015).
Semantic complexity of quantifiers and their distribution in corpora
Szymanik, J.
2015-01-01
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
