Their models for semantic computing are based on finite automata. Unlike previous research, it explains semantic computing from the computation theory perspective. Recently, Reference proposed a different understanding of semantic computing based on finite automata. To provide solid foundations for semantic computing, it is significant to bridge the gap between semantic computing and the formal theory of computation. As a result, “semantic computing” refers to computational implementations of semantic reasoning (e.g., ontology reasoning, rule reasoning, semantic query and semantic search) but it is not from the perspective of the formal theory of computation. But most research on Semantic Computing (SC) are devoted to the following three fields: (1) formal models for theoretical foundations of SC, such as description logics, ontology reasoning and answer set programming (2) fundamental languages and technologies for interoperability and reuse of information including RDF, RDFS, the OWL family of languages, the WSML family of languages, and SPARQL (3) some applications of SC. Semantic similarity is applied in plentiful applications about artificial intelligence and computational linguistics, such as word sense disambiguation, information retrieval, knowledge acquisition and natural language processing. Our new probabilistic automata can overcome these limitations. We provide an application for weather forecasting, a domain for which traditional probabilistic automata are not effective due to their finite input alphabet. They have better performances in many applications. Furthermore, our new probabilistic automata are robust enough to handle any alphabet as input. In this paper, we rebuild traditional probabilistic automata for semantic computing. This deeply restricts the abilities of automata. Even though traditional probabilistic automata can handle imprecise knowledge, their limitation resides in their being defined on a fixed finite input alphabet. Therefore, in this paper, we provide foundations for semantic computing based on probabilistic automata. But finite automata are not capable enough to deal with imprecise knowledge. This approach provides a computer theoretical approach to semantic computing. To provide solid foundations for semantic computing, researchers propose a different understanding of semantic computing based on finite automata. It lacks support from the formal theory of computation.

In most previous research, “semantic computing” refers to computational implementations of semantic reasoning.

Automaton synonym