Honors Program

Honors in Technology

Date of Award


Thesis Professor(s)

Jay Jarman

Thesis Professor Department

Computer and Information Sciences

Thesis Reader(s)

Jessica Keup, Joseph Sobol


In an effort to make reading more accessible, an automated readability formula can help pair readers with material appropriate for their reading level. This study attempts to discover and analyze a set of possible features that may be included in a future automated readability formula. This set is not a definitive list of readability formula features, but rather an overview of current features being study in the Natural Language Processing field.

Document Type

Honors Thesis - Open Access

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.


Copyright by the authors.