Integrating Semantics And Flexible Syntax By Exploiting Isomorphism Between Gramnatical And Senantical Relations
نویسندگان
چکیده
This work concerns i n t e g r a t i o n between syn tax and semant ics . S y n t a c t i c and semant ic a c t i v i t i e s r e l y on separa te bod ies o f knowledges. I n t e g r a t i o n i s ob ta i ned by e x p l o i t i n g the isomorphism between grammat ica l r e l a t i o n s (among immediate c o n s t i t u ~ e r r s ) and conceptua l r e l a t i o n s , thanks t o a l i m i t e d s e t o f fo rmal mapping r u l e s . S y n t a c t i c a n a l y s i s does not c o n s t r u c t a l l t he e x p l i c i t parse t r e e s but j u s t a graph t h a t r ep resen ts a l l the p l a u s i b l e grammat ica l r e l a t i o n s among immediate c o n s t i t u e n t s . Such graph g i ves the semant ic i n t e r p r e t e r , based on Conceptual Graphs fo rma l i sm, the d i s c r i m i n a t i v e power r e q u i r e d to e s t a b l i s h conceptua l r e l a t i o n s .
منابع مشابه
Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملGlueTag Linear Logic based Semantics Construction for LTAG
In this paper we review existing appoaches to semantics construction in LTAG (Lexicalised Tree Adjoining Grammar) which are all based on the notion of derivation (tree)s. We argue that derivation structures in LTAG are not appropriate to guide semantic composition, due to a non-isomorphism, in LTAG, between the syntactic operation of adjunction on the one hand, and the semantic operations of co...
متن کاملGlueTag Linear Logic based Semantics for LTAG
We review existing appoaches to semantics construction in LTAG (Lexicalised Tree Adjoining Grammar) based on the notion of derivation (tree)s. We argue that derivation structures in LTAG are not appropriate to guide semantic composition, due to a non-isomorphism, in LTAG, between the syntactic operation of adjunction on the one hand, and the semantic operations of complementation and modificati...
متن کاملOn Isomorphism Theorems of Fn -Polygroups
In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...
متن کاملExploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs
Subgraph Isomorphism is a fundamental problem in graph data processing. Most existing subgraph isomorphism algorithms are based on a backtracking framework which computes the solutions by incrementally matching all query vertices to candidate data vertices. However, we observe that extensive duplicate computation exists in these algorithms, and such duplicate computation can be avoided by explo...
متن کامل