Automatic Telugu Summarizer
DOI:
https://doi.org/10.61841/n8rmgp26Keywords:
NLP, telugu language, single document summarisationAbstract
The exponential development of online material data began with the clear demand for a persuasive and helpful plus that provides the simplest substance in an excessively fragmented sense, while saving center informatio. In this article, we are inclined to suggest an old, related extractive telugu single recording technique aimed at providing an adequate knowledge core. The predicted extractive methodology tests each sentence hooked through a mixture of observable and textual highlights in which a single description is used taking into consideration the meaning of the phrase, its inclusion and close range. Even, as a score-based and directed AI, run-down and ward encourage the use of the scheduled highlights were popular. We aim to find out the adequacy of the expected methodology across various analyzes under EASC corpus using live ROUGE. Contrasting with other existing associated research, the assessment of the trial demonstrates the consistency of the planned methodology as a way as measures of reality, analysis and F-score execution.
Downloads
References
[1] Ko, Y., et al. (2002). Utilization of sentence value for automated document categorization. Proceedings of the 19th International Conference on Computational Linguistics, 1, 1–7.
[2] Kolcz, A., et al. (2001). Summarization as a function option for document categorization. Proceedings of the 10th International Conference on Information and Knowledge Management, 365–370.
[3] Shen, E., et al. (2004). Evaluation of document retrieval using feature-based categorization. Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 242–249.
[4] McCallum, A., & Nigam, K. (1998). A comparison of event models for Naïve Bayes text classification. Proceedings of the AAAI Workshop on Learning for Text Categorization, 41–48.
[5] Yager, R. R. (2006). An extension of the definition of the naïve Bayesian rule. Information Sciences, 176, 577–588.
[6] Joachims, T. (1997). A probabilistic analysis of the Rocchio algorithm with TF-IDF for text categorization. Proceedings of the International Conference on Machine Learning (ICML), 143–151.
[7] Rahal, I., & Perrizo, W. (2004). An automated solution to KNN document categorization using P-trees. Proceedings of the ACM Symposium on Applied Computing, 613–617.
[8] Gabrilovich, E., & Markovitch, S. (2004). Text categorization with many redundant features: Using aggressive feature selection to build efficient SVMs with C4.5. Proceedings of the 20th International Conference on Machine Learning (ICML), 321–328.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
