Measuring semantic complexity
<|reference_start|>Measuring semantic complexity: 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.<|reference_end|>
@article{zadrozny1995measuring,
    title={Measuring semantic complexity},
    author={Wlodek Zadrozny (IBM Research, T. J. Watson Research Center)},
    journal={arXiv preprint arXiv:cmp-lg/9505019},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9505019},
    primaryClass={cmp-lg cs.CL}
}