| 1 | = Automatic Semantic Tool (AST) = |
| 2 | |
| 3 | Full semantic analysis of natural language (NL) texts is an open |
| 4 | problem. The most comprehensive semantic systems build upon a mathematically |
| 5 | sound formalism of a selected logical system. Mostly due to computability |
| 6 | and efficiency, current systems work with the first order logic (or its variant). |
| 7 | However, the low-order logic is not appropriate for capturing higher-order |
| 8 | phenomena that occurs in natural language, such as belief attitudes, direct |
| 9 | speech, or verb tenses. In our project, we develop new tool for automatic semantic analysis |
| 10 | (AST) that emerged from (a module of) the Czech syntactic parser [https://nlp.fi.muni.cz/trac/synt SYNT] . |
| 11 | |
| 12 | |
| 13 | AST is now a standalone tool based on Transparent Intensional Logic (TIL). |
| 14 | It works with the same input files (lexicons, semantic rules, ...) that were designed and developed in SYNT. |
| 15 | |
| 16 | AST can provide a semantic analysis in the form of Transparent Intensional Logic (TIL) constructions independently on the input syntactic parser and language. |
| 17 | |
| 18 | Adaptation for new language consists in a specification of four lexicon files that describe lexical items, verb valencies, prepositional valencies and a semantic grammar. |
| 19 | |
| 20 | |
| 21 | == Input == |
| 22 | |
| 23 | To create a semantic structure of a sentence, AST needs the output from |
| 24 | previous analysis. A usual output is in the form of a syntactic tree [[Image()]] |
| 25 | |