scholarly journals Classification of Tamil Poetry Using Context Free Grammar Using Tamil Grammar Rules

Author(s):  
Subasree Venkatsubhramaniyen ◽  
Subha Rashmi ◽  
Rajeswari Sridhar
2007 ◽  
Vol 38 (9) ◽  
pp. 52-62 ◽  
Author(s):  
Humikazu Mitomi ◽  
Fuyuki Fujiwara ◽  
Masanobu Yamamoto ◽  
Taisuke Sato

IET Software ◽  
2008 ◽  
Vol 2 (3) ◽  
pp. 223 ◽  
Author(s):  
A. Dubey ◽  
P. Jalote ◽  
S.K. Aggarwal

2014 ◽  
Vol 40 (1) ◽  
pp. 203-229
Author(s):  
Tagyoung Chung ◽  
Licheng Fang ◽  
Daniel Gildea ◽  
Daniel Štefankovič

We study the problem of sampling trees from forests, in the setting where probabilities for each tree may be a function of arbitrarily large tree fragments. This setting extends recent work for sampling to learn Tree Substitution Grammars to the case where the tree structure (TSG derived tree) is not fixed. We develop a Markov chain Monte Carlo algorithm which corrects for the bias introduced by unbalanced forests, and we present experiments using the algorithm to learn Synchronous Context-Free Grammar rules for machine translation. In this application, the forests being sampled represent the set of Hiero-style rules that are consistent with fixed input word-level alignments. We demonstrate equivalent machine translation performance to standard techniques but with much smaller grammars.


2021 ◽  
Author(s):  
Henry Gorelick ◽  
◽  
Biddut Sarker Bijoy ◽  
Syeda Jannatus Saba ◽  
Sudipta Kar ◽  
...  

Author(s):  
K. G. Subramanian ◽  
M. Geethalakshmi ◽  
N. Gnanamalar David ◽  
Atulya K. Nagar

2020 ◽  
Vol 39 (6) ◽  
pp. 8463-8475
Author(s):  
Palanivel Srinivasan ◽  
Manivannan Doraipandian

Rare event detections are performed using spatial domain and frequency domain-based procedures. Omnipresent surveillance camera footages are increasing exponentially due course the time. Monitoring all the events manually is an insignificant and more time-consuming process. Therefore, an automated rare event detection contrivance is required to make this process manageable. In this work, a Context-Free Grammar (CFG) is developed for detecting rare events from a video stream and Artificial Neural Network (ANN) is used to train CFG. A set of dedicated algorithms are used to perform frame split process, edge detection, background subtraction and convert the processed data into CFG. The developed CFG is converted into nodes and edges to form a graph. The graph is given to the input layer of an ANN to classify normal and rare event classes. Graph derived from CFG using input video stream is used to train ANN Further the performance of developed Artificial Neural Network Based Context-Free Grammar – Rare Event Detection (ACFG-RED) is compared with other existing techniques and performance metrics such as accuracy, precision, sensitivity, recall, average processing time and average processing power are used for performance estimation and analyzed. Better performance metrics values have been observed for the ANN-CFG model compared with other techniques. The developed model will provide a better solution in detecting rare events using video streams.


2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Witold Dyrka ◽  
Marlena Gąsior-Głogowska ◽  
Monika Szefczyk ◽  
Natalia Szulc

Abstract Background Amyloid signaling motifs are a class of protein motifs which share basic structural and functional features despite the lack of clear sequence homology. They are hard to detect in large sequence databases either with the alignment-based profile methods (due to short length and diversity) or with generic amyloid- and prion-finding tools (due to insufficient discriminative power). We propose to address the challenge with a machine learning grammatical model capable of generalizing over diverse collections of unaligned yet related motifs. Results First, we introduce and test improvements to our probabilistic context-free grammar framework for protein sequences that allow for inferring more sophisticated models achieving high sensitivity at low false positive rates. Then, we infer universal grammars for a collection of recently identified bacterial amyloid signaling motifs and demonstrate that the method is capable of generalizing by successfully searching for related motifs in fungi. The results are compared to available alternative methods. Finally, we conduct spectroscopy and staining analyses of selected peptides to verify their structural and functional relationship. Conclusions While the profile HMMs remain the method of choice for modeling homologous sets of sequences, PCFGs seem more suitable for building meta-family descriptors and extrapolating beyond the seed sample.


Sign in / Sign up

Export Citation Format

Share Document