![]()
|
Abstract |
|
![]() |
|
![]() Figure 1. Error-checking Modules. |
![]() |
![]() The first module in analyzing student input is a spell check. During the spell check, the system also extracts the base forms of each word from the grammar. The uninflected words are needed to determine whether the learner followed the task, that is, whether the student answer contained the words which were provided. Such errors cannot be determined by the grammar and the parser because these can only judge whether or not a sentence is grammatical. When defining an exercise, we store possible answers of a given task and the Answer Check module determines the most likely answer (MLA) the student intended. The Answer Check module further matches the extracted base forms with the MLA. If any of the words in the task are not contained in the student answer, the system will report an error. The following two checks, Extra Word Check and Word Order Check, refer to additional words in the student answer and errors in word order, respectively. While these two checks are commonly handled by the grammar [Schwind, 1995], preliminary testing of our system showed that the system performs faster if these two error types are treated outside the grammar. Naturally, the speed is also influenced by the grammar formalism used. The Grammar Check is the most elaborate of the modules. Here the sentence is analyzed by the parser according to the rules and lexical entries provided in the Greek grammar. Currently, the grammar covers a wide range of grammatical concepts, from early beginner constructions (verb 'to be' and the concept of null subjects) to fairly advanced structures (passive voice). Development is still ongoing to achieve a complete coverage of Greek grammar. The Match Check looks for correct punctuation and capitalization by string-matching the student answer with the MLA. By this time in the evaluation process, it is very unlikely that the sentence still contains any errors other than punctuation or capitalization. If the sentence passes the Match Check successfully, the sentence is correct. If not, an error is reported to the student. The system is organized in a way that if a module detects an error, further processing is blocked. As a result, only one error at a time will be displayed to the learner. This was implemented mainly to avoid overloading the student with extensive error reports in the case of multiple errors. According to van der Linden [1993], displaying more than one feedback message at a time makes the correction process too complex for the student. After correcting the error, the student restarts the checking mechanism by clicking the CHECK button. In the last section, we will briefly describe the six exercise types implemented in the system and discuss the role of the Student Model for each. |
![]() |
![]() |
|
![]() Figure 2. Guess the Word. |
![]() |
![]() Find the Word In this exercise, students need to find several words in a grid. The system increments the vocabulary node for each word found and decrements it for each incorrect guess. The maximum increments and decrements per game are equal to the number of words in the table. The feedback messages are the same for all students. The exercise difficulty is modulated: advanced students receive clues in English, while other students receive clues in Greek. An example of this exercise type is given in Figure 3. |
![]() |
![]() |
|
![]() Figure 3. Find a Word. |
![]() |
![]() Which Word Is Different This exercise displays a number of words all except one of which belong to the same category. The student task is to identify the one that differs from the others. The divergent word may differ syntactically, semantically or pragmatically from the remaining words. There is an increment for each correct word selected, for each incorrect selection a decrement is recorded. The feedback messages are the same for all students and there is no difficulty modulation. An example of this exercise type is given in Figure 4. |
![]() |
![]() |
|
|
![]() |
![]() Grammar Word Order Practice In this exercise, students practice Greek word order with a ‘drag and drop’ task: words have to be arranged in an appropriate order to form a grammatical Greek sentence. An example is given in Figure 5. For this exercise type, the word order node in the Student Model is updated. For a sentence with incorrect word order, the system records a decrement, else an increment. There is no feedback or difficulty modulation for this exercise. |
![]() |
![]() |
|
![]() Figure 5. Word Order Practice. |
![]() |
![]() Fill-in-the-Blank The student's task here is to complete sentences by filling in any blanks that appear in the example. The Student Model records each grammar node that is detected in the student input. For example, if students are asked to supply the correct conjugation of the verb, then the system records an increment/decrement for subject-verb agreement. The feedback messages are modulated according to the level of the learner. Also, advanced learners obtain more difficult tasks. For instance, novice and intermediate students will find only one blank per example. Advanced students may be presented with examples that contain more than one blank. |
![]() |
![]() |
|
![]() Figure 6. Fill in the Blank. |
![]() |
![]() Build a Sentence In this exercise type, students are provided with a set of words. Their task is to create a grammatical Greek sentence using all the provided words. An example is given in Figure 6. All grammar nodes activated during the processing of the student’s input are updated in the Student Model. An increment is recorded if this aspect of the student’s answer was correct. A decrement is recorded for any grammatical errors made by the student. Feedback messages reflect the current state of the learner’s expertise, as represented by the Student Model. For instance, Figure 7 displays the feedback for an advanced learner. Feedback is minimal such that merely a hint is provided. |
|
![]() |
|
|
![]() |
![]() In contrast, the feedback for the beginner learner is very specific. An example is provided in Figure 8. There is no difficulty modulation in the build a sentence exercise type. |
![]() |
![]() |
|
|
![]() |
|
![]() |