# Measuring semantic complexity

Source: [Measuring semantic complexity](<https://www.sota2.com/research/paper/68fa5fd21e209131ce9ec069>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:26:47.341Z

Authors: Wlodek Zadrozny

Published: 1995-05-08T18:27:04.000Z

## Abstract

We 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cmp-lg/9505019>)

[PDF](<https://arxiv.org/pdf/cmp-lg/9505019.pdf>)
