We present a first algebraic approximation to the semantic content of linguistic ambiguity. Starting from the class of ordinary Boolean algebras, we add to it an ambiguity operator ║ and a small set of axioms which we think are correct for linguistic ambiguity beyond doubt.We then show some important, non-trivial results that follow from this axiomatization, which turn out to be surprising and not fully satisfying from a linguistic point of view. Therefore, we also sketch promising algebraic alternatives.
CITATION STYLE
Wurm, C., & Lichte, T. (2016). The proper treatment of linguistic ambiguity in ordinary algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9804 LNCS, pp. 306–322). Springer Verlag. https://doi.org/10.1007/978-3-662-53042-9_18
Mendeley helps you to discover research relevant for your work.