Measuring semantic complexity
cmp-lg
2008-02-03 v1 计算与语言
摘要
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.
引用
@article{arxiv.cmp-lg/9505019,
title = {Measuring semantic complexity},
author = {Wlodek Zadrozny},
journal= {arXiv preprint arXiv:cmp-lg/9505019},
year = {2008}
}
备注
11 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 [email protected]