![]() |
Semantic Engine, Natural Language & Semantics | |||
| info@semantic-knowledge.com | ||||
| Home | News | Reference | Support | Download | Buy | About | ||||
To process a text analysis, the Semantic Engine operates in 6 stages:
Words are grouped together in several main Word categories. Among these, six are of interest to us:
An analysis is highly complex. During the process, the software will:
To simplify the analysis, the Semantic Engine divides the text into propositions (simple sentences). This first stage is based on a scrutiny of the punctuation, and on a complex process of syntax analysis, which will not be detailed here. This yields highly reliable co-occurrence statistics (Relations), since it is not possible for two words to fit into the same grammatical proposition if they are not closely connected. Propositional hashing is bound to involve errors (propositions that are either too short or too long), but this does not affect the results.
The automatic interpretation of words in any living language, either written or spoken, requires the solving of numerous ambiguities:
One of the main functions of this software is to solve these ambiguities by means of a set of Artificial Intelligence problem-solving algorithms. Though a perfect result is impossible to achieve, the error rate is low enough to guarantee an accurate analysis of your text.
Copyright Semantic Knowledge, all rights reserved
www.semantic-knowledge.com