Measuring Semantic Complexity

Wlodek Zadrozny

We define semantic complexity using a new concept of mesning 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 online 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.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.