Joke van de Plassche’s research while affiliated with University of Amsterdam and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (4)


Analysis of Unknown Words through Morphological Decomposition
  • Article
  • Full-text available

July 1996

·

262 Reads

·

17 Citations

Alan W Black

·

Joke van de Plassche

·

This paper describes a method of analysing words through morphological decomposition when the lexicon is incomplete. The method is used within a text-to-speech system to help generate pronunciations of unknown words. The method is achieved within a general morphological analyser system using Koskenniemi twolevel rules. Keywords: Morphology, incomplete lexicon, text-to-speech systems Background When a text-to-speech synthesis system is used, it is likely that the text being processed will contain a few words which do not appear in the lexicon as entries in their own right. If the lexicon consists only of whole-word entries, then the method for producing a pronunciation for such "unknown" words is simply to pass them through a set of letter-to-sound rules followed by word stress assignment rules and vowel reduction rules. The resulting pronunciation may well be inaccurate, particularly in English (which often shows a poor relationship between spelling and pronunciation). In addition, ...

Download

Fig. 2. the corrected inference structure of compare
Fig. 5. the inference structure of revise without the extra test
Evaluating a formal KBS specification language

March 1996

·

130 Reads

·

9 Citations

IEEE Expert

Formal specification languages can improve the development of knowledge-based systems, but several problems limit their usefulness. (ML)2, a formal language based on the knowledge models used in the CommonKADS KBS development method, avoids many of these problems. We describe a study that investigated the usability of a formal KBS modeling language, (ML)2. To analyze (ML)2 usability, we first designed a set of evaluation criteria. Then we performed a small case study, constructing an expertise model in (ML) 2, to test and refine these criteria. Subsequently, we used (ML)2 to construct a second model, which formed the basis for our language evaluation. Altogether, we performed three case studies, which we used to score (ML)2 with our evaluation criteria


A Knowledge-Based, English Verb-Form Tutor

January 1994

·

23 Reads

·

21 Citations

Describes Spengels, a knowledge-based tutoring system for the conjugation and spelling of English verbs for Dutch writers. The student has to fill in gapped-sentences. If an incorrect answer is entered, the system locates the point where the student deviated from the path through a spelling algorithm that leads to the correct answer. The student is either guided from that particular point through the spelling algorithm or given hints about what went wrong. The techniques that are applied for diagnosis of knowledge and performance errors are model driven. An enumerative and a reconstructive theory of bugs are combined to diagnose errors and to build a student model. Continuous knowledge diagnosis enables Spengels to present only those problems which are a challenge to the student. At the end of the session, a short overview of the student's performance is provided. (PsycINFO Database Record (c) 2012 APA, all rights reserved)


Citations (4)


... When conventional classroom instruction in person was not practicable, technological innovations in education saved the day the year 2020 due to COVID-19 [1] [3]. Many studies, including those in [4][5][6], maintained the fact that there are benefits to studying using technology, especially if it concerns foreign language acquisition. However, providing personalized feedback is still lacking in many language e-learning systems. ...

Reference:

Technology-Assisted Language Learning Systems: A Systematic Literature Review
A Knowledge-Based, English Verb-Form Tutor
  • Citing Article
  • January 1994

... Although mathematical simplicity is a major design criterion for BeSSY, are there certain things that are impossible to express in BeSSY despite demonstration of Python list and dictionary operations in this study? Expressiveness is an important criteria in evaluating formal languages (Ruiz et al., 1994, van Harmelen et al., 1993, van Harmelen et al., 1996). We used Turing completeness as a test for expressiveness. ...

Evaluating a Formal Modelling Language.

... Although mathematical simplicity is a major design criterion for BeSSY, are there certain things that are impossible to express in BeSSY despite demonstration of Python list and dictionary operations in this study? Expressiveness is an important criteria in evaluating formal languages (Ruiz et al., 1994, van Harmelen et al., 1993, van Harmelen et al., 1996. We used Turing completeness as a test for expressiveness. ...

Evaluating a formal KBS specification language

IEEE Expert

... One popular method is to create a list of word suffixes from known lexicon words and to use the longest matching suffix of an unknown word to assign a most common part-of-speech tag (Kupiec, 1992; Meteer et al., 1991). Another method tries to map unknown words to known words in the lexicon by adding or deleting affixes (Mikheev, 1994; Black et al., 1991). These methods provide a part-of-speech tag for the individual unknown word but provide neither a lemmatization of the word nor a prediction as to what other words are variants of the same word. ...

Analysis of Unknown Words through Morphological Decomposition