A statistical approach for universal networking language-based relation extraction

2006 ◽  
Author(s):  
D.P.T. Nguyen ◽  
M. Ishizuka
Keyword(s):  
Statistical Approach ◽  
Relation Extraction ◽  
Universal Networking Language

Bootstrapping of Semantic Relation Extraction for a Morphologically Rich Language

2019 ◽  
Vol 15 (1) ◽  
pp. 119-149
Author(s):  
Balaji Jagan ◽  
Ranjani Parthasarathi ◽  
T V Geetha
Keyword(s):  
Relation Extraction ◽  
Semantic Relation ◽  
Semantic Relations ◽  
Semantic Constraints ◽  
Order Language ◽  
Fixed Order ◽  
Universal Networking Language ◽  
Rule Based Approach ◽  
Domain Independent ◽  
Free Word

This article focuses on the use of a bootstrapping approach for the extraction of semantic relations that exist between two different concepts in a Tamil text. The proposed system, bootstrapping approach to semantic UNL relation extraction (BASURE) extracts generic relations that exist between different components of a sentence by exploiting the morphological richness of Tamil. Tamil is essentially a partially free word order language which means that semantic relations that exist between the concepts can occur anywhere in the sentence not necessarily in a fixed order. Here, the authors use Universal Networking Language (UNL), an Interlingua framework, to represent the word-based features and aim to define UNL semantic relations that exist between any two constituents in a sentence. The morphological suffix, lexical category and UNL semantic constraints associated with a word are defined as tuples of the pattern used for bootstrapping. Most systems define the initial set of seed patterns manually. However, this article uses a rule-based approach to obtain word-based features that form tuples of the patterns. A bootstrapping approach is then applied to extract all possible instances from the corpus and to generate new patterns. Here, the authors also introduce the use of UNL ontology to discover the semantic similarity between semantic tuples of the pattern, hence, to learn new patterns from the text corpus in an iterative manner. The use of UNL Ontology makes this approach general and domain independent. The results obtained are evaluated and compared with existing approaches and it has been shown that this approach is generic, can extract all sentence based semantic UNL relations and significantly increases the performance of the generic semantic relation extraction system.

Delivering Sustainable Water Systems Using Kalman Filter and Statistical Approach

2017 ◽  
Vol 4 (1) ◽  
pp. 41-52
Author(s):  
Dedy Loebis
Keyword(s):  
Kalman Filtering ◽  
Statistical Approach ◽  
Water Systems ◽  
Data Sets ◽  
Pressure Data ◽  
Burst Event ◽  
Sample Data ◽  
Other Information ◽  
Supply Systems ◽  
Frequency Features

This paper presents the results of work undertaken to develop and test contrasting data analysis approaches for the detection of bursts/leaks and other anomalies within wate r supply systems at district meter area (DMA)level. This was conducted for Yorkshire Water (YW) sample data sets from the Harrogate and Dales (H&D), Yorkshire, United Kingdom water supply network as part of Project NEPTUNE EP/E003192/1 ). A data analysissystem based on Kalman filtering and statistical approach has been developed. The system has been applied to the analysis of flow and pressure data. The system was proved for one dataset case and have shown the ability to detect anomalies in flow and pres sure patterns, by correlating with other information. It will be shown that the Kalman/statistical approach is a promising approach at detecting subtle changes and higher frequency features, it has the potential to identify precursor features and smaller l eaks and hence could be useful for monitoring the development of leaks, prior to a large volume burst event.

Mitigating the Effect of Out-of-Vocabulary Entity Pairs in Matrix Factorization for KB Inference

2018 ◽  
Author(s):  
Prachi Jain ◽  
Shikhar Murty ◽  
Mausam . ◽  
Soumen Chakrabarti
Keyword(s):  
Knowledge Base ◽  
Hybrid Model ◽  
Matrix Factorization ◽  
Relation Extraction ◽  
Tensor Factorization ◽  
Evaluation Protocol

This paper analyzes the varied performance of Matrix Factorization (MF) on the related tasks of relation extraction and knowledge-base completion, which have been unified recently into a single framework of knowledge-base inference (KBI) [Toutanova et al., 2015]. We first propose a new evaluation protocol that makes comparisons between MF and Tensor Factorization (TF) models fair. We find that this results in a steep drop in MF performance. Our analysis attributes this to the high out-of-vocabulary (OOV) rate of entity pairs in test folds of commonly-used datasets. To alleviate this issue, we propose three extensions to MF. Our best model is a TF-augmented MF model. This hybrid model is robust and obtains strong results across various KBI datasets.

Sign in / Sign up

Export Citation Format

Share Document