Measuring semantic complexity

Simple item page
dc.creatorZadrozny, Wlodek
dc.date1995-05-08
dc.date.accessioned2026-07-07T09:09:50Z
dc.date.available2026-07-07T09:09:50Z
dc.descriptionWe define {\em semantic complexity} using a new concept of {\em meaning automata}. We measure the semantic complexity of understanding of prepositional phrases, of an "in depth understanding system", and of a natural language interface to an on-line calendar. We argue that it is possible to measure some semantic complexities of natural language processing systems before building them, and that systems that exhibit relatively complex behavior can be built from semantically simple components.
dc.description11 pp. Latex.. To appear in Proc. BISFAI'95, The Fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence, June 20-22, 1995, Ramat-Gan and Jerusalem, Israel. Correspondence to wlodz@watson.ibm.com
dc.identifierhttps://arxiv.org/abs/cmp-lg/9505019
dc.identifierhttp://arxiv.org/abs/cmp-lg/9505019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151178
dc.subjectComputation and Language
dc.titleMeasuring semantic complexity
dc.typetext

Files

Collections

arXiv