scholarly journals Building a Chinese AMR Bank with Concept and Relation Alignments

2019 ◽  
Vol 18 (1) ◽  
Author(s):  
Bin Li ◽  
Yuan Wen ◽  
Li Song ◽  
Weiguang Qu ◽  
Nianwen Xue

Abstract Meaning Representation (AMR) is a meaning representation framework in which the meaning of a full sentence is represented as a single-rooted, acyclic, directed graph. In this article, we describe an on-going project to build a Chinese AMR (CAMR) corpus, which currently includes 10,149 sentences from the newsgroup and weblog portion of the Chinese TreeBank (CTB). We describe the annotation specifications for the CAMR corpus, which follow the annotation principles of English AMR but make adaptations where needed to accommodate the linguistic facts of Chinese. The CAMR specifications also include a systematic treatment of sentence-internal discourse relations. One significant change we have made to the AMR annotation methodology is the inclusion of the alignment between word tokens in the sentence and the concepts/relations in the CAMR annotation to make it easier for automatic parsers to model the correspondence between a sentence and its meaning representation. We develop an annotation tool for CAMR, and the inter-agreement as measured by the Smatch score between the two annotators is 0.83, indicating reliable annotation. We also present some quantitative analysis of the CAMR corpus. 46.71% of the AMRs of the sentences are non-tree graphs. Moreover, the AMR of 88.95% of the sentences has concepts inferred from the context of the sentence but do not correspond to a specific word.

1969 ◽  
Vol 60 (2) ◽  
pp. 276-280
Author(s):  
Bernard A. Rüedi

ABSTRACT A quantitative analysis of spermatogenesis has been made in rats bearing bilateral lesions of the lateral mammillary nuclei or of the suprachiasmatic nuclei of the hypothalamus. There was no significant change in the germinal cell counts in lesioned rats as compared either with normal or with sham operated rats.


1997 ◽  
Vol 62 (4) ◽  
pp. 1187-1201 ◽  
Author(s):  
Sanjay Jain ◽  
Arun Sharma

AbstractLimiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (from a graph of the function) have served as models for investigating the boundaries of learnability. Recently, a new approach to the study of “intrinsic” complexity of identification in the limit has been proposed. This approach, instead of dealing with the resource requirements of the learning algorithm, uses the notion of reducibility from recursion theory to compare and to capture the intuitive difficulty of learning various classes of concepts. Freivalds, Kinber, and Smith have studied this approach for function identification and Jain and Sharma have studied it for language identification.The present paper explores the structure of these reducibilities in the context of language identification. It is shown that there is an infinite hierarchy of language classes that represent learning problems of increasing difficulty. It is also shown that the language classes in this hierarchy are incomparable, under the reductions introduced, to the collection of pattern languages.Richness of the structure of intrinsic complexity is demonstrated by proving that any finite, acyclic, directed graph can be embedded in the reducibility structure. However, it is also established that this structure is not dense. The question of embedding any infinite, acyclic, directed graph is open.


2019 ◽  
Vol 11 (2) ◽  
pp. 79-90
Author(s):  
Lailatul Izzah ◽  
Sukarti Sukarti ◽  
Uly Gusniarti

This study aims to determine the effect of empathy training to reduce bullying behavior on the offender bullying in primary school. Subjects in this study were 10-11 years old who have low and medium empathy scores nor high and medium bullying behavior. There were eight students who become participants in this study. The data were collected by using interview, observation, peer relations questionaires, bullying scales, and empathy scales. This study was using one group pretest-posttest design. The data were analyzed by using quantitative analysis of two related sample test by Wilcoxon. The results showed that empathy scores (Z=-2.52, p=0.012 (p<0.05)) and bullying scores (Z=-2.207, p=0.027 (p<0.05)) underwent a significant change pretest-posttest. Meanwhile, empathy scores Z=-1.452, p=0.146 (p>0.05)) and bullying scores (Z=-1.897, p=0.058 (p>0.05)) had no significant changes posttest- follow up. Furthermore, empathy scores (Z=-2.530, p=0.011 (p<0.05)) and bullying scores (Z=-2.533, p=0.011 (p<0.05)) underwent a significant change pretest- follow-up.


2017 ◽  
Vol 4 (3) ◽  
pp. 35-52
Author(s):  
E.V. Kuzmina

A quantitative analysis of the structure of Nicholas II's speeches was made in the period 1894-1906, in comparison with his speeches, presented in the journal Niva in 1916. The basis for the analysis is the total number of words in the sentences that make up the analyzed speech. A significant change in the total number of words in sentences pertaining to the dates considered has been revealed.


Author(s):  
A. V. Sedelnikov ◽  
E. S. Khnyryova

This paper gives an interpretation of the quasispecies concept for an experiment of growing the Lymantria dispar artificial population. The changes estimate in the population parameters for a significant change in environmental conditions at the stage of hatching caterpillars from the eggs was given. Three numerical and two random parameters were used for quantitative analysis. They characterize the development of individuals of the population at this stage. The parameter changes significance was verified with using statistical tests. The results obtained do not contradict the quasispecies model. The use of fuzzy sets describes the transition from one quasispecies to another at a significant change in environmental conditions.


2006 ◽  
Vol 14 (3) ◽  
pp. 207-230 ◽  
Author(s):  
Kenneth C.C. Kong

A document is mainly composed of words and images, but the complex relationship that binds these two completely different semiotic resources is usually taken for granted as transparent. The simple relations between words and images – ‘anchorage’ and ‘relay’, identified by Barthes almost 30 years ago – are unable to deal with the complexity of their bond, made even more complex by current printing and computer technology. This paper aims to identify the potential relations that bind texts and images together by arguing for a multilevel description of their logico-semantic relationships. The multiple, evaluative and metaphorical functions of the relations will also be discussed. The data generated from the proposed framework can form an empirical corpus for quantitative analysis. Examples from a variety of sources will be used as examples to show how the framework can be operationalized.


2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Vladimir I. Danilov ◽  
Alexander V. Karzanov ◽  
Gleb A. Koshevoy

International audience Let $G=(V,E)$ be a finite acyclic directed graph. Being motivated by a study of certain aspects of cluster algebras, we are interested in a class of triangulations of the cone of non-negative flows in $G, \mathcal F_+(G)$. To construct a triangulation, we fix a raming at each inner vertex $v$ of $G$, which consists of two linear orders: one on the set of incoming edges, and the other on the set of outgoing edges of $v$. A digraph $G$ endowed with a framing at each inner vertex is called $framed$. Given a framing on $G$, we define a reflexive and symmetric binary relation on the set of extreme rays of $\mathcal F_+ (G)$. We prove that that the complex of cliques formed by this binary relation is a pure simplicial complex, and that the cones spanned by cliques constitute a unimodular simplicial regular fan $Σ (G)$ covering the entire $\mathcal F_+(G)$. Soit $G=(V,E)$ un graphe orientè, fini et acyclique. Nous nous intéressons, en lien avec l’étude de certains aspects des algèbres amassées, à une classe de triangulations du cône des flots positifs de $G, \mathcal F_+(G)$. Pour construire une triangulation, nous ajoutons une structure en chaque sommet interne $v$ de $G$, constituée de deux ordres totaux : l'un sur l'ensemble des arcs entrants, l'autre sur l'ensemble des arcs sortants de $v$. On dit alors que $G$ est structurè. On définit ensuite une relation binaire réflexive et symétrique sur l'ensemble des rayons extrêmes de $\mathcal F_+ (G)$. Nous démontrons que le complexe des cliques formè par cette relation binaire est un complexe simplicial pur, et que le cône engendré par les cliques forme un éventail régulier simplicial unimodulaire $Σ (G)$ qui couvre complètement $\mathcal F_+(G)$.


Sign in / Sign up

Export Citation Format

Share Document