@incollection{,
    author = {Ullrich, Sabine; Soares de Souza, Amon; Köhler, Josua; Geierhos, Michaela},
    title = {BloomQDE: Leveraging Bloom’s Taxonomy for Question Difficulty Estimation},
    editor = {Abbas, Mourad},
    booktitle = {Analysis and Application of Natural Language and Speech Processing},
    series = {Signals and Communication Technology},
    journal = {},
    address = {Cham},
    publisher = {Springer},
    edition = {},
    year = {2023},
    isbn = {978-3-031-11034-4 ; 978-3-031-11035-1},
    volume = {},
    number =  {},
    pages = {145-155},
    url = {},
    doi = {10.1007/978-3-031-11035-1_7},
    keywords = {},
    abstract = {Current question answering systems often focus on providing a simple entity or short sentence as an answer. By gaining confidence in information retrieval systems, users start to ask more complex questions that require sophisticated answers, such as reasoning chains. However, no research has been carried out yet to determine how exhaustive an answer should be. We combine Bloom’s learner’s levels of understanding with question difficulty classification. Therefore, we heuristically determine the threshold within Bloom’s taxonomy that separates question types into simple and complex. Moreover, we extract keywords from the taxonomy within question datasets and categorize questions accordingly. Then, we train a word n-gram multi-layer perceptron (MLP) and an LSTM model with syntactic features. The results are further improved by applying a genetic algorithm for parameter tuning.},
    note = {},
    institution = {Universität der Bundeswehr München, Fakultät für Informatik, INF 7 - Institut für Datensicherheit, Professur: Geierhos, Michaela},
    
    
}