CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Estimation of Lexical Complexity using Language Semantics

by Ketakee Nimavat, Tushar Champaneria
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 176 - Number 4
Year of Publication: 2017
Authors: Ketakee Nimavat, Tushar Champaneria
10.5120/ijca2017915572

Ketakee Nimavat, Tushar Champaneria . Estimation of Lexical Complexity using Language Semantics. International Journal of Computer Applications. 176, 4 ( Oct 2017), 24-28. DOI=10.5120/ijca2017915572

@article{ 10.5120/ijca2017915572,
author = { Ketakee Nimavat, Tushar Champaneria },
title = { Estimation of Lexical Complexity using Language Semantics },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2017 },
volume = { 176 },
number = { 4 },
month = { Oct },
year = { 2017 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume176/number4/28541-2017915572/ },
doi = { 10.5120/ijca2017915572 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:41:38.437824+05:30
%A Ketakee Nimavat
%A Tushar Champaneria
%T Estimation of Lexical Complexity using Language Semantics
%J International Journal of Computer Applications
%@ 0975-8887
%V 176
%N 4
%P 24-28
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Word complexity is a quite complex and subjective issue. However, it is also intuitive. Here the topic is explored and an intuitive method is proposed to judge the complexity where the intuition is based on the genesis and development of a language. The proposed technique is analogous to a tree structure where in each word is made up of its child nodes where child nodes signify simpler words. The algorithm hence takes into account the definition of the word and finds the complexity score based on the basic words present in the definition. The method is then judged using Flesch Reading ease and tested on separate sets of simple and difficult words. It is observed that this helps judge the complexity of a text as whole and works fairly well for individual words as well.

References
  1. S. Levine, C. Finn, T. Darrell, and P. Abbeel, “End-to-End Training of Deep Visuomotor Policies,” vol. 17, pp. 1–40, 2015.
  2. J. Hirschberg and C. Manning, “Advances in natural language processing,” sciencemag, vol. 349, no. 6245, pp. 394–416.
  3. T. Ingold, “Jumping NLP Curves: A Review of Natural Language Processing Research,” J. R. Anthropol. Inst., vol. 4, no. January, pp. 771–773, 2014.
  4. M. Shardlow, “A Survey of Automated Text Simplification,” Int. J. Adv. Comput. Sci. Appl. Spec. Issue Nat. Lang. Process., pp. 58–70, 2014.
  5. R. Chandrasekar and B. Srinivas, “Automatic induction of rules for text simplification,” Knowledge-Based Syst., vol. 10, no. 3, pp. 183–190, 1997.
  6. R. Chandrasekar, C. Doran, and B. Srinivas, “Motivations and Methods for Text Simplication,” Proc. COLING ’96, pp. 1041–1044, 1996.
  7. S. Vajjala Balakrishna, “Analyzing Text Complexity and Text Simplification: Connecting Linguistics, Processing and Educational Applications,” PhD Thesis, vol. 1, 2015.
  8. I. Temnikova, “Text Complexity and Text Simplification in the crisis management domain,” Comput. Linguist., 2012.
  9. A. Siddharthan, “Syntactic simpllification and cohesion,” Tech. Report, Univ. Cambridge, no. 597, 2004.
  10. P. Mukherjee et al., “NegAIT: A new parser for medical text simplification using morphological, sentential and double negation,” J. Biomed. Inform., vol. 69, no. March, pp. 55–62, 2017.
  11. X. Zhang and M. Lapata, “Sentence Simplification with Deep Reinforcement Learning,” 2017.
  12. M. L. Lewis and M. C. Frank, “The length of words reflects their conceptual complexity,” pp. 1–42.
  13. S. Pinker, “The Language Instinct,” New York, NY: Harper Perennial Modern Classics, 1994.
  14. “Ogden’s Basic English Words.” [Online]. Available: http://ogden.basic-english.org/words.html. [Accessed: 13-Sep-2017].
  15. “Wikipedia:List of 1000 basic words - Simple English Wikipedia, the free encyclopedia.” [Online]. Available: https://simple.wikipedia.org/wiki/Wikipedia:List_of_1000_basic_words. [Accessed: 13-Sep-2017].
  16. L. Dolamic and J. Savoy, “When Stopword Lists Make the Difference,” no. 1, pp. 200–203, 2009.
  17. S. Bird, “NLTK: The natural Language Toolkit,” 21st Int. Conf. Comput. Linguist., no. July, p. 69, 2006.
  18. Rudolf Flesch, “Guide to Academic Writing Article - Management - University of Canterbury - New Zealand.” [Online]. Available: http://www.mang.canterbury.ac.nz/writing_guide/writing/flesch.shtml. [Accessed: 10-Sep-2017].
  19. F. O. G. Count, F. Reading, and E. Personnel, “Derivation of new Readability formulas,” 1975.
  20. “The New York Times - Breaking News, World News & Multimedia.” [Online]. Available: https://www.nytimes.com/?mcubz=3. [Accessed: 13-Sep-2017].
  21. “The Manhattan Prep GRE Advantage | Comprehensive GRE Prep Books & GRE Online Study Resources | Manhattan GRE Prep.” [Online]. Available: https://www.manhattanprep.com/gre/studentcenter/flash-cards/gre-flashcards.cfm. [Accessed: 07-Sep-2017].
  22. C. Fellbaum, “WordNet,” Encycl. Appl. Linguist., 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Text Simplification semantic complexity lexical complexity text complexity lexicon.

Powered by PhDFocusTM