The technology described herein relates generally to text selection and more specifically to automatic generation of recitation items for speaking assessment.
Assessment of a person's speaking proficiency is often performed in education and in other domains. Such speaking assessment typically takes the form of texts (e.g., essays, passages, articles, etc.) being presented to and read by the person being assessed. The texts used in the assessments are usually selected from a large pool of texts collected from diverse resources (e.g., textbooks, journals, websites, and manual generation). The selection process, however, is often performed manually, which is costly, time-consuming, and lacks objectivity.
In accordance with the teachings herein, computer-implemented systems and methods are provided for automatically generating recitation items. For example, a computer performing the recitation item generation can receive one or more text sets that each includes one or more texts. The computer can determine a value for each text set using one or more metrics, such as a vocabulary difficulty metric, a syntactic complexity metric, a phoneme distribution metric, a phonetic difficulty metric, and a prosody distribution metric. Then the computer can select a final text set based on the value associated with each text set. The selected final text set can be used as the recitation items for a speaking assessment test.
The unfiltered or pre-filtered texts are then used to form one or more text sets. Candidate text sets, such as Text Set1 102 and Text Set2 104, are each a subset of the text pool 100. In one embodiment, the candidate text sets, each of a given size M, are generated by creating all possible combinations of M candidate texts. In another embodiment, a text set is generated by selecting one text at a time using Kullback-Leibler divergence measure or other entropy optimization methods.
Once the text sets have been generated, each candidate text set is processed according to an optional post-set-generation text filter module 110 and a text selection module 120. Similar to the pre-set-generation text filter module 101, the post-set-generation text filter module 110 stores one or more rules for identifying problematic words, phrases, and/or sentences in a text that make the text undesirable or unsuitable as a recitation item. However, instead of filtering texts from the text pool 100 before the text sets are generated, the post-set-generation text filter module 110 filters text sets after they have been generated. If a text set includes a text that is deemed undesirable by the post-set-generation text filter module 110, the text set may be filtered out is no longer a candidate for the recitation items.
With respect to the text selection module 120, it applies one or more metrics to a text set and accordingly determines a score that reflects the text set's overall suitability to be used as recitation items for a particular assessment test. The text selection module 120 may utilize (1) phonemic metrics 130 to quantify the phonemic characteristics of a text set; (2) prosodic metrics 140 to quantify the prosodic characteristics of a text set; (3) vocabulary metrics 150 to quantify the difficulty of vocabulary in a text set; and/or (4) syntactic metrics 160 to quantify the syntactical complexity of a text set. While the order in which the modules and metrics are applied is not deterministic (i.e., they can be applied in any order), in one embodiment application of the text filter module 110 is followed by application of the text selection module 120.
Based on the results of the applied metrics, the text selection module 120 determines a score for each processed text set. In
At 220, a vocabulary difficulty metric analyzes the text to determine a level of difficulty of its words. “Difficult words,” for example, may be foreign words or uncommon names that are inappropriate for a particular recitation task. Since difficult words tend to appear less frequently than easy words, the difficulty of a word can be estimated based on the frequency of the word appearing in a reference corpus (i.e., a word that rarely appears in the reference corpus may be deemed difficult). Based on this assumption, a vocabulary difficulty value can be estimated based on, for example, the proportion of the text's low frequency words and average word frequency. At 225, the vocabulary difficulty value is compared to a pre-determined vocabulary difficulty range, which in one embodiment is determined based on a set of training texts that have been deemed suitable for the recitation task. Then at 250, the text filter module determines whether to filter out the text from the text set based on the result of the comparison and, optionally, the results of other metrics.
At 230, a syntactic complexity metric is employed to identify texts with overly complicated syntactic structure, which may not be appropriate for a recitation task. A syntactic complexity value may be calculated using any conventional means for estimating syntax complexity (such as those used in automated essay scoring systems). At 235, the text filter module compares the syntactic complexity value to a pre-determined syntactic complexity range, which in one embodiment is determined based on a set of training texts that have been deemed suitable for the recitation task. Then at 250, the text filter module determines whether to filter out the text from the text set based on the result of the comparison and, optionally, the results of other metrics.
One embodiment of a syntactic complexity metric 240 is employed to identify texts with overly long sentences, which may be undesirable for certain recitation tasks. The metric causes the processor(s) to determine the number of words in each sentence of the text and accordingly calculate a sentence length value (e.g., which could be the average of length of the text's sentences or a proportion of sentences exceeding a threshold length). The text filter module compares the sentence length value to a pre-determined sentence length range, which in one embodiment is determined based on a set of training texts that have been deemed suitable for the recitation task. Then based on the result of the comparison and, optionally, the results of other metrics, the text filter module determines whether to filter out the text from the text set.
A disk controller 960 interfaces one or more optional disk drives to the system bus 952. These disk drives may be external or internal floppy disk drives such as 962, external or internal CD-ROM, CD-R, CD-RW or DVD drives such as 964, or external or internal hard drives 966. As indicated previously, these various disk drives and disk controllers are optional devices.
Each of the element managers, real-time data buffer, conveyors, file input processor, database index shared access memory loader, reference data buffer and data managers may include a software application stored in one or more of the disk drives connected to the disk controller 960, the ROM 956 and/or the RAM 958. Preferably, the processor 954 may access each component as required.
A display interface 968 may permit information from the bus 952 to be displayed on a display 970 in audio, graphic, or alphanumeric format. Communication with external devices may optionally occur using various communication ports 973.
In addition to the standard computer-type components, the hardware may also include data input devices, such as a keyboard 972, or other input device 974, such as a microphone, remote control, pointer, mouse and/or joystick.
The invention has been described with reference to particular exemplary embodiments. However, it will be readily apparent to those skilled in the art that it is possible to embody the invention in specific forms other than those of the exemplary embodiments described above. The embodiments are merely illustrative and should not be considered restrictive. The scope of the invention is reflected in the claims, rather than the preceding description, and all variations and equivalents which fall within the range of the claims are intended to be embraced therein.
This application is a divisional application of U.S. patent application Ser. No. 14/215,124, filed on Mar. 17, 2014, entitled “Systems and Methods for Generating Recitation Items,” which claims priority to U.S. Provisional Patent Application No. 61/802,904, filed Mar. 18, 2013, entitled “An Automated Recitation Item Generation Method,” both of which are herein incorporated by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5799276 | Komissarchik | Aug 1998 | A |
5970453 | Sharman | Oct 1999 | A |
7373102 | Deane | May 2008 | B2 |
7392187 | Bejar | Jun 2008 | B2 |
7460997 | Conkie | Dec 2008 | B1 |
7739103 | Deane | Jun 2010 | B2 |
7840404 | Xi | Nov 2010 | B2 |
8147250 | Deane | Apr 2012 | B2 |
8209173 | Bejar et al. | Jun 2012 | B2 |
8275306 | Attali | Sep 2012 | B2 |
20020099554 | Spiser-Albert et al. | Jul 2002 | A1 |
20020116183 | Waryas et al. | Aug 2002 | A1 |
20020120441 | Waryas | Aug 2002 | A1 |
20020147587 | Townshend et al. | Oct 2002 | A1 |
20020184027 | Brittan | Dec 2002 | A1 |
20030163316 | Addison et al. | Aug 2003 | A1 |
20030229497 | Wilson et al. | Dec 2003 | A1 |
20040049375 | Brittan | Mar 2004 | A1 |
20040078204 | Segond et al. | Apr 2004 | A1 |
20050049867 | Deane | Mar 2005 | A1 |
20050095564 | Stuart et al. | May 2005 | A1 |
20050222837 | Deane | Oct 2005 | A1 |
20060074655 | Bejar | Apr 2006 | A1 |
20060122826 | Jiang et al. | Jun 2006 | A1 |
20060155538 | Higgins et al. | Jul 2006 | A1 |
20060172276 | Higgins et al. | Aug 2006 | A1 |
20060177799 | Stuart | Aug 2006 | A9 |
20060240390 | Attali | Oct 2006 | A1 |
20070213982 | Xi | Sep 2007 | A1 |
20080183463 | Deane | Jul 2008 | A1 |
20080221893 | Kaiser | Sep 2008 | A1 |
20080249773 | Bejar | Oct 2008 | A1 |
20080294440 | Higgins | Nov 2008 | A1 |
20080300874 | Gavalda | Dec 2008 | A1 |
20090171661 | Jayadeva | Jul 2009 | A1 |
20090292538 | Barnish | Nov 2009 | A1 |
20100036654 | Futagi et al. | Feb 2010 | A1 |
20100145691 | Bellegarda | Jun 2010 | A1 |
20100145698 | Chen et al. | Jun 2010 | A1 |
20100250238 | Deane | Sep 2010 | A1 |
20110040554 | Audhkhasi et al. | Feb 2011 | A1 |
20110270605 | Qin | Nov 2011 | A1 |
20120016672 | Chen | Jan 2012 | A1 |
20120065977 | Tepperman | Mar 2012 | A1 |
20130024184 | Vogel | Jan 2013 | A1 |
20130144621 | Chen | Jun 2013 | A1 |
20130189652 | Marttila | Jul 2013 | A1 |
20140025381 | Wang | Jan 2014 | A1 |
20150179169 | John | Jun 2015 | A1 |
Entry |
---|
Cui, Xiaodong, Alwan, Abeer; Efficient Adaptation Text Design Based on the Kullback-Leibler Measure; Proceedings of the IEEE International Conference on Acoustic Speech and Signal Processing, 1; pp. 613-616; 2002. |
Rosenberg, Andrew; AuToBI—a Tool for Automatic ToBI Annotation; Interspeech; pp. 146-149; 2010. |
Silverman, Kim, Beckman, Mary, Pitrelli, John, Ostendorf, Mad, Wightman, Colin, Price, Patti, Pierrehumbert, Janet, Hirschberg, Julia; ToBI: A Standard for Labeling English Prosody; Proceedings of the International Conference on Spoken Language Processing, 2; pp. 867-870; 1992. |
Wu, Chung-Hsien, Su, Hung-Yu, Liu, Chao-Hong; Efficient Personalized Mispronunciation Detection of Taiwanese-English Speech Based on Unsupervised Model Adaptation and Dynamic Sentence Selection; Computer Assisted Language Learning, 26(5); pp. 446-467; 2013. |
Zechner, Klaus, Higgins, Derrick, Lawless, Rene, Futagi, Yoko, Ohls, Sarah, Ivanov, George; Adapting the Acoustic Model of a Speech Recognizer for Varied Proficiency Non-Native Spontaneous Speech Using Read Speech with Language-Specific Pronunciation Difficulty; Interspeech; pp. 612-615; 2009. |
Number | Date | Country | |
---|---|---|---|
61802904 | Mar 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14215124 | Mar 2014 | US |
Child | 15895098 | US |