Semantic analysis

Feldman R, Regev Y, Hurvitz E, Finkelstein-Landau M. Mining the biomedical literature using semantic analysis and natural language processing techniques Biosilico 2003 1 69-80. 

The rule is parsed in a top-down fashion(l6) using a BNF driven parser according to the explicit grammar, a portion of which is shown in Figure 5. This is a fairly simple context free grammar, written in the BNF (Backus Normal Form) style.(17) A condensed version of the parse tree for the sample rule is shown in Figure 6. Semantic analysis checks for ... 

Syntax and semantics analysis of relationships between words to recognize chemical names that include spaces... 

Nesher, P., 8c Katriel, T. (1977). A semantic analysis of addition and subtraction word problems in arithmetic. Educational Studies in Mathematics, 8, 251-269. 

Another method is Latent Semantic Analysis. This method creates a statistical word-usage model that permits comparisons of semantic similarity between pieces of textual information [3637]. An improved version is Probabilistic Latent Semantic Analysis (PLSA) [38]. This method explicitly models document topics. The Expectation Maximization [39] algorithm is then used to lit the model given a set of documents. Each document is defined in terms of a combination of topics based on the model-fitted conditional probabilities of word occurrences in each topic class. 

Deerwester, S., S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman. 1990. Indexing by latent semantic analysis. Journal of the American Society of Information Science 41 391 407. 

Hofmann, T. 1999. Probabilistic latent semantic analysis. In Uncertainty in artificial intelligence. Stockholm, Sweden. 

Translation + Review - Goal Setting Syntax Analysis Semantic Analysis Optional Review Compliance Analysis Creation of PROCSPECS Review... 

At eompleting the Semantic Analysis report care must be taken that all the sections of the report are... 

Other data driven techniques include support vector machines [114], [111], [18], transformation based learning [67], [519] and latent semantic analysis [38]. Boula de Mareiiil et al [62] describe a formal evaluation of grapheme-to-phoneme algorithms and explains the complexities involved in ensuring that accurate and meaningful comparisons can be performed. 

The analysis of an input string by an AGinterpretor jnoceeds in two biases. In the first, c ed syntax analysis, a context-free parser is used to construct a parse tree df the itqmt string, hi Ae second, called semantic analysis, the values df the attributes at the nodes of the parse tree are evaluated and the semantic conditions are tested. 

Steinberg, D. D. (1967). The word sort an instrument for semantic analysis. Psychonomic Science, 8, 541-542. 

Two types of SC A are apparent, syntactic and semantic analysis and these are used for two purposes demonstration of code integrity and functional correctness. Syntactic Analysis is based on the structure of the code and has the ability to detect control flow errors (e.g. unreachable code), data flow errors (e.g. an OUT parameter that is not always written) and coding standard violations. Additionally a syntactic technique. Information Flow analysis, can be used to support software partitioning arguments by demonstrating that sections of code are independent of each other. Syntactic Analysis can also be used to measure software and generate software metrics, though these tend to be relatively simple metrics such as McCabe s complexity metric. 

Analysis of program semantics is a less commonly used, but more powerful technique. The critical difference between Semantic and Syntactic analysis is that the properties analysed by Semantic analysis require an understanding of the meaning of the software, and this enables analysis of code properties that require knowledge of the values held by program variables. For example, analysis that a divide-by-zero error will not occur requires a Semantic approach. A Semantic Analysis of the code would seem to be better suited to the demands of high-integrity software. 

Static analysis comprising subset analysis, metrics analysis, control flow analysis, data use analysis, information flow analysis, semantic analysis/path function analysis and safety properties analysis shall be performed on the whole of the source code to verify that the source code is well formed and free of anomalies that would affect the safety of the system. 

Semantic analysis, whereby functional relationships between inputs and outputs are described for each path, is the most powerful of the static analysis procedures. It is, however, not trivial... 

The input HardwareC description is parsed and translated first into an abstract syntax tree representation, which provides the underlying model for semantic analysis and behavioral transformations. The transformations are categorized into user-driven and automatic transformations. User-driven transformations are optional, and allow the designer the capability of modifying the model calls and hierarchy of the input description. They include the following ... 

Kosuga, Y., Kono, K., Hanaoka, M., Hishiyama, M., Takahama, Y Sania Syntactic and Semantic Analysis for Automated Testing against SQL Injection. In Proc. of the 23rd Annual Computer Security Applications Conference, Miami, December 2007, pp. 107-117 (2007) Salas, R, Krishnan, P, Ross, K.J. Model-Based Security Vulnerability Testing. In Proc. of Australian Software Engineering Conference, Melbourne, Australia, pp. 284—296 (2007)... 

Figure 1 shows the structure of HUNT. In addition to the main phases of syntactic and semantic analysis, several other tasks are carried out. Simple lexical... 

The ADL-semantics extractor is a software component that is aimed at resolving these issues, by further processing the extracted state-data, and transforms the later to a nested XML ADL-journal. The XML formatted journal allows flexibility on the final rendering, and enables a higher level of semantic analysis. 

Ocarina is a tool set designed in Ada for AADL modeling. It provides syntactic and semantic analysis, verification and code generation from AADL models in Ada and C languages. Ocarina compiler has two parts a frontend and a backend. Frontend analyzes AADL model and presents it as Abstract Syntax Tree (AST). Backend treats AADL AST to produce all types of generation. 

---