Jayashree Nair
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jayashree Nair has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Renjith Mohan
Amrita Vishwa Vidyapeetham
2 shared publications A Ajesh
Department of Computer Science and Applications, Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India
1 shared publicationA. Adarsh
Amrita Vishwa Vidyapeetham
1 shared publicationAbhijeet Gupta
Amrita Vishwa Vidyapeetham
1 shared publicationAnakha Shaji
Amrita Vishwa Vidyapeetham
1 shared publicationAnand Sadasivan
Amrita Vishwa Vidyapeetham,International Centre for Spiritual Studies,India
1 shared publication
Latest Publications
- 1 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1489-1494
Environment Sound Recognition Systems-A Case Study
There are various sounds in the environment, which are produced by multiple sources such as birds, animals, machinery, etc. An Environment sound recognition system (ESRS) detects and categorizes these environmental sounds. ESRS plays a major role in different applications with sound processing such as noise removal, IoT-based systems for sound monitoring, etc. The paper presents simple ESRS models trained on an existing standard environmental sound dataset, freely accessible via the Freesound project. This dataset contains 250000 unlabeled auditory extracts and 2000 short clips representing 50 different basic sound events. Various feature extraction techniques are applied to sound data; the extracted features are then represented using various vectorization techniques so that they can be incorporated into the models. ESRS models are built based on standard Machine Learning(ML) algorithms. Following that, these models are evaluated, tested, and compared.
- 1 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1489-1494
Environment Sound Recognition Systems-A Case Study
There are various sounds in the environment, which are produced by multiple sources such as birds, animals, machinery, etc. An Environment sound recognition system (ESRS) detects and categorizes these environmental sounds. ESRS plays a major role in different applications with sound processing such as noise removal, IoT-based systems for sound monitoring, etc. The paper presents simple ESRS models trained on an existing standard environmental sound dataset, freely accessible via the Freesound project. This dataset contains 250000 unlabeled auditory extracts and 2000 short clips representing 50 different basic sound events. Various feature extraction techniques are applied to sound data; the extracted features are then represented using various vectorization techniques so that they can be incorporated into the models. ESRS models are built based on standard Machine Learning(ML) algorithms. Following that, these models are evaluated, tested, and compared.
- 1 January 2022
- Published by Springer Nature
- p. 103-117
A Study on Transliteration Techniques and Conventional Transliteration Schemes for Indian Languages
- 1 January 2022
- Published by Springer Nature
- p. 103-117
A Study on Transliteration Techniques and Conventional Transliteration Schemes for Indian Languages
- 29 August 2021
- Published by Springer Nature
- p. 117-128
Sanskrit Stemmer Design: A Literature Perspective
- 29 August 2021
- Published by Springer Nature
- p. 117-128
Sanskrit Stemmer Design: A Literature Perspective
- 8 September 2020
- Published by Springer Nature
- p. 247-258
Design of a Morphological Generator for an English to Indian Languages in a Declension Rule-Based Machine Translation System
- 8 September 2020
- Published by Springer Nature
- p. 247-258
Design of a Morphological Generator for an English to Indian Languages in a Declension Rule-Based Machine Translation System
- 19 May 2020
- Published by Springer Nature
- p. 1662-1672
Computing for Mitigation of Health Vulnerabilities for the Village Morasiya in Bihar, India
- 19 May 2020
- Published by Springer Nature
- p. 1662-1672
Computing for Mitigation of Health Vulnerabilities for the Village Morasiya in Bihar, India
- 19 May 2020
- Published by Springer Nature
- p. 1673-1682
Context Aware Community Based Systems for Sustainable Waste Management in Morasia, Bihar
- 19 May 2020
- Published by Springer Nature
- p. 1673-1682
Context Aware Community Based Systems for Sustainable Waste Management in Morasia, Bihar
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A Roman to Devanagari Back-Transliteration Algorithm based on Harvard-Kyoto Convention
Transliteration is the process to transcribe a script of one language into another, while, backward or back transliteration is converting back the transliterated text into its original script. The highly technical phonetic system of Sanskrit seems to have made the preparation of transliteration scheme quite arduous. This study is focused on development of a rule-based, grapheme model character alignment back-transliteration algorithm of Sanskrit script, transcribed ASCII(American Standard Code for Information Interchange)-encoded English to Devanagari, pursuant to the Harvard-Kyoto (HK) convention. Accordingly, the paper presents the context of the utility for such an algorithm. It also describes the various standard schemes available for transcribing Devanagari into Roman. A survey on the evolution of scripts in India suggests the Brahmi script as the foundation for the origin of variants like Devanagari. Since the nineteenth century, various transliteration schemes based on Roman script have evolved. The International Alphabet of Sanskrit Transliteration (IAST) schemes used diacritics to disambiguate phonetic similarities and seem to have induced much strenuous venture for the non-professionals. The ASCII-based, HK and its variant, Indian Language Transliteration (ITRANS) schemes do not use diacritics and hence accounted to be the simplest. Our rationale for the use of HK scheme, stem from its prime traits of Sanskrit Unicode encoding. We have also explained the Sanskrit alphabet and its classifications, which are incorporated into our proffered process. We appraise the complexity of our pseudo-coded algorithm and finally, we propose an extension of this work in the creation of similar tools, for other Indian languages that use the Devanagari script, such as Hindi and Marathi.
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A Roman to Devanagari Back-Transliteration Algorithm based on Harvard-Kyoto Convention
Transliteration is the process to transcribe a script of one language into another, while, backward or back transliteration is converting back the transliterated text into its original script. The highly technical phonetic system of Sanskrit seems to have made the preparation of transliteration scheme quite arduous. This study is focused on development of a rule-based, grapheme model character alignment back-transliteration algorithm of Sanskrit script, transcribed ASCII(American Standard Code for Information Interchange)-encoded English to Devanagari, pursuant to the Harvard-Kyoto (HK) convention. Accordingly, the paper presents the context of the utility for such an algorithm. It also describes the various standard schemes available for transcribing Devanagari into Roman. A survey on the evolution of scripts in India suggests the Brahmi script as the foundation for the origin of variants like Devanagari. Since the nineteenth century, various transliteration schemes based on Roman script have evolved. The International Alphabet of Sanskrit Transliteration (IAST) schemes used diacritics to disambiguate phonetic similarities and seem to have induced much strenuous venture for the non-professionals. The ASCII-based, HK and its variant, Indian Language Transliteration (ITRANS) schemes do not use diacritics and hence accounted to be the simplest. Our rationale for the use of HK scheme, stem from its prime traits of Sanskrit Unicode encoding. We have also explained the Sanskrit alphabet and its classifications, which are incorporated into our proffered process. We appraise the complexity of our pseudo-coded algorithm and finally, we propose an extension of this work in the creation of similar tools, for other Indian languages that use the Devanagari script, such as Hindi and Marathi.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 296-302
Generating Noun Declension-case markers for English to Indian Languages in Declension Rule based MT Systems
Machine Translation is a branch of re- search under Computational Linguistics that deais with the automatic/semi-automatic translation of a natu- ral/human language into another. The language that is being translated is termed as Source Language(SL) and the language into which translation is done, is termed Target Language(TL). This paper presents an English to Indian Languages Machine Translation technique that is based on the rules of grammar, namely word deelensions or inflections, and sentence formation rules of the target languages, i.e. Indian Languages. Declensions are variations or inflections of words in language and Indian languages are richly declensional or inflectional languages. This study is on generating Noun Declension-case markers for English to Indian languages in Declension Rule based Machine Translation. This paper also describes about the various approaches to machine translation along with their system architectures. The proposed Declension based RBMT is explained with its architecture and each of the modules and their functionalities are elaborated in detail. The input and output, to and from the System are also described with an example. The research works that are similar with the proposed system, such as ANUSAARAKA and ANGLABHARATI are also explored.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 296-302
Generating Noun Declension-case markers for English to Indian Languages in Declension Rule based MT Systems
Machine Translation is a branch of re- search under Computational Linguistics that deais with the automatic/semi-automatic translation of a natu- ral/human language into another. The language that is being translated is termed as Source Language(SL) and the language into which translation is done, is termed Target Language(TL). This paper presents an English to Indian Languages Machine Translation technique that is based on the rules of grammar, namely word deelensions or inflections, and sentence formation rules of the target languages, i.e. Indian Languages. Declensions are variations or inflections of words in language and Indian languages are richly declensional or inflectional languages. This study is on generating Noun Declension-case markers for English to Indian languages in Declension Rule based Machine Translation. This paper also describes about the various approaches to machine translation along with their system architectures. The proposed Declension based RBMT is explained with its architecture and each of the modules and their functionalities are elaborated in detail. The input and output, to and from the System are also described with an example. The research works that are similar with the proposed system, such as ANUSAARAKA and ANGLABHARATI are also explored.
- 3 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1293-1297
A random forest approach for rating-based recommender system
Recommender system has emerged as an integral part of the online shopping sites as it promotes sales. It recommends intuitive products based on users preference which solves the issue of information overload. Recommender system constitutes information filtering mechanism which filters vast amount of data. Algorithms such as SVD, KNN, Softmax Regression has already been used in the past to form recommendations. In this paper we propose a system which uses clustering and random forest as multilevel strategies to predict recommendations based on users ratings while targeting users mind-set and current trends. The result has been evaluated with the help of RMSE (Root Mean Square Error). Feasible performance has been achieved.
- 3 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1293-1297
A random forest approach for rating-based recommender system
Recommender system has emerged as an integral part of the online shopping sites as it promotes sales. It recommends intuitive products based on users preference which solves the issue of information overload. Recommender system constitutes information filtering mechanism which filters vast amount of data. Algorithms such as SVD, KNN, Softmax Regression has already been used in the past to form recommendations. In this paper we propose a system which uses clustering and random forest as multilevel strategies to predict recommendations based on users ratings while targeting users mind-set and current trends. The result has been evaluated with the help of RMSE (Root Mean Square Error). Feasible performance has been achieved.