This application claims priority under 35 U.S.C. §119 from Chinese Patent Application No. 201010163229.9 filed Apr. 30, 2010, the entire contents of which are incorporated herein by reference.
This invention generally relates to a method and system for assessing speech, in particular, to a method and system for assessing prosody of speech data.
Speech assessment is an important area in speech application technology, the main purpose of which is to assess the quality of input speech data. However, speech assessment technologies in the prior art mainly focus on assessing pronunciation of input speech data, namely, distinguishing and scoring pronunciation variance of speech data. Take the word “today” for example, the correct American pronunciation should be [t'de], whereas a reader can mispronounce it as [tu'de].
The existing speech assessment technologies can detect and correct incorrect pronunciations. If the input speech data is a sentence or a long paragraph rather than a word, the sentence or paragraph needs to be segmented first so as to perform force alignment between the input speech data and corresponding text data, and then an assessment is performed according to pronunciation variance of each word. In addition, most of the existing speech assessment products require a reader to read given speech information, which includes read text of some paragraph or read after a piece of standard speech, such that the input speech data is restricted by given content.
Accordingly, one aspect of the present invention provides a method for assessing speech prosody, the method including the steps of: receiving input speech data; acquiring a prosody constraint; assessing prosody of the input speech data according to the prosody constraint; and providing assessment result where at least of the steps is carried out using a computer device.
Another aspect of the present invention provides a system for assessing speech prosody, the system including: an input speech data receiver for receiving input speech data; a prosody constraint acquiring means for acquiring a prosody constraint; an assessing means for assessing prosody of the input speech data according to the prosody constraint; and a result providing means for providing assessment result.
A further aspect of the present invention provides a computer readable storage medium tangibly embodying a computer readable program code having computer readable instructions which when implemented, cause a computer to carry out the steps of the above method.
The drawings referred to in this description are only for typical embodiments of the invention and should not be considered as limiting the scope of the invention.
The prior art fails to provide an effective method and system for assessing speech prosody. Furthermore, a majority of the prior arts require readers to follow the reading of given text/speech, which limits the application scope of a prosody assessment. The present invention sets forth an effective method and system for assessing input speech. Further, the invention does not have any restriction on input speech data. In other words, a user can read certain text/speech or the user can give a free speech. Therefore, the present invention not only can assess prosody of a reader or follower, but also can assess prosody of any piece of input speech data.
The present invention not only can help a self-learner to score and correct his own spoken language, but can also assist an examiner to assess an examinee's performance during an oral test. The present invention not only can be implemented as a special hardware device such as repeater, but can also be implemented as software logic in a computer to operate in conjunction with a sound collecting device. The present invention not only can serve one end user, but also can be adopted by a network service provider so as to assess input speech data of multiple end users.
In the following discussion, a large amount of specific details are provided to facilitate to understand the invention thoroughly. However, for those skilled in the art, it is evident that it does not affect the understanding of the invention without these specific details. The usage of any of following specific terms is just for convenience of description, thus the invention should not be limited to any specific application that is identified and/or implied by such terms.
The present invention sets forth an effective method and system for assessing input speech. Further, the invention does not have any restriction on input speech data. In other words a user can read certain text/speech as well as give a free speech. Therefore, the present invention not only can assess prosody of a reader or follower, but also can assess prosody of any piece of input speech data.
The present invention not only can help a self-learner to score and correct his own spoken language, but also can assist an examiner to assess an examinee's performance during an oral test. The present invention not only can be implemented as a special hardware device such as repeater, but also can be implemented as software logic in a computer to operate in conjunction with a sound collecting device. The present invention not only can serve one end user, but also can be adopted by a network service provider so as to assess input speech data of a plurality of end users.
Pitch reset refers to pitch variation between words in speech data. Usually, pitch reset can occur if the speaker needs to take a breath after finishing a word or raises the pitch of a following word.
For a speaker, if there is no silence or pitch reset at correct location, his reading or spoken language will not be standard or native, for example, if the speaker pauses after “very” rather than “easy”, as shown in the following example:
Is it very (silence) easy for you to stay healthy in England.
Apparently, if the speaker speaks in the above way, it does not conform to normal speech rhythms. The following steps are used to judge whether a speaker pauses or makes a pitch reset at a correct location.
The purpose of alignment is to further analyze rhythm feature of the input speech data. At step 306, the phrase boundary location of the input speech data is measured. For instance, it can measure after which word the speaker pauses or makes a pitch reset. Further, the phrase boundary location can be marked on the aligned text data, for example:
Is it very easy (silence) for you to stay healthy in England.
Back to
Is it very easy (silence) for you to stay healthy in England.
Is it very easy for you to stay healthy (silence) in England.
Is it very easy for you to stay healthy in England (there is no silence or pitch reset in the whole sentence).
The present invention is not only limited to assess a speaker's input speech data according to one standard reading manner; rather, it can perform assessment by comprehensively considering various standard reading manners. Details about the step of acquiring standard rhythm feature will be given below.
Since standard speech data stored in a corpus are limited (such as tens of thousands of sentences or hundreds of thousands of sentences), it is difficult to find a sentence whose language structure is exactly the same as that of the speaker's input speech data. For example, it is difficult to find standard speech whose language structure is also “aux pro adv adj prep pro prep vi noun prep noun”. Although the grammatical structure of the whole sentence can not be the same, a similar phrase boundary can exist if grammatical structure within a certain range is the same. For instance, if a standard speech data stored in the corpus is:
Vitamin c is extremely good (silence) for all types of skin.
The above sentence also has the grammatical structure of “extremely (adv) good (adj) for (prep)”. Thus, the phrase boundary location that should exist in the input speech data can be deduced from phrase boundaries of standard speech with similar grammatical structure. Of course, the corpus can include numerous standard speech data with a language structure of “adv adj prep”. Some of them have a silence/pitch reset after adj; while others do not have silence/pitch reset after adj. An embodiment of the present invention judges whether silence/pitch reset should occur after a word based on statistic probability of phrase boundary of numerous standard speech data with identical language structure.
Specifically, at step 404, the input language structure is matched with a standard language structure of standard speech in a standard corpus to determine the occurrence probability of phrase boundary location of the input text data. Step 404 further includes traversing a decision tree of the standard language structure according to the input language structure of at least one word of the input text data (for instance, language structure of “easy” is “adv adj prep”) to determine the occurrence probability of phrase boundary location of the at least one word. The decision tree refers to a tree structure obtained from analyzing language structure of standard speech in the corpus.
For example, in standard speech data, if silence/pitch reset occurs in 875 words with language structure “adv adj prep”, and if silence/pitch reset does not occur in 125 words with language structure “adv adj prep”, then occurrence probability of phrase boundary location is 0.875000. Details about the process of building a decision tree can be further found in reference document Shi et al., “Combining Length Distribution Model with Decision Tree in Prosodic Phrase Prediction”, Interspeech, 2007, 454-457. It can be seen that, by traversing the decision tree according to language structure of certain words in the input text data, the occurrence probability of phrase boundary location of that word can be determined, so that the occurrence probability of phrase boundary location of each word in the input speech data can further be obtained. For example:
Is(0.000000) it(0.300000) very(0.028571) easy(0.875000) for(0.000000) you(0.470588) to(0.000000) stay(0.026316) healthy(0.633333) in(0.0513514) England(1.000000)
At step 406, the phrase boundary location of the standard rhythm feature is extracted, and the phrase boundary location whose occurrence probability is above a certain threshold is further extracted. For example, if the threshold is set at 0.600000, then the word whose occurrence probability of phrase boundary location is above 0.600000 will be extracted. According to the above example, “easy”, “healthy” and “England” will all be extracted. In other words, if the silence/pitch reset occurs after “England”, or silence/pitch reset occurs after any one of or both of “easy” and “healthy” in the input speech data, they can all be considered as reasonable in rhythm.
It should be noted that, the foregoing merely gives a simple example of language structure table. The language structure table can be further expanded to further include other items, such as: whether current word is at beginning, at end or in middle of a sentence, part of speech of a second word from its left, part of speech of a second word from its right, etc.
Back to
It is not necessary for the speaker to pause after each word whose occurrence probability of phrase boundary is above 0.600000, because this can cause too many pause times in a sentence, which will affect the coherence of the whole sentence. The present invention can adopt various predetermined assessing strategies to perform assessment based on the comparison between rhythm feature of the input speech data and corresponding standard rhythm feature.
As mentioned above, prosody can refer to rhythm of speech data, or fluency of speech data or both. The foregoing specifically describes the method for assessing input speech data in terms of rhythm feature. The following will describe a method for assessing input speech data in terms of fluency feature.
At step 906, a predicted value of the total number of phrase boundaries is determined according to the sentence length of text data corresponding to the input speech data. In the example listed above, the whole sentence includes 11 words. For example, if a predicted value of the total number of phrase boundaries of a sentence determined based on a certain empiric value is 2, then in addition to the one pause that should be made at end of the sentence, the speaker is allowed to make, at most, one pause/pitch reset in the middle of the sentence. At step 908, the total number of phrase boundaries of the input speech data is compared with the predicted value of the total number of phrase boundaries. At step 910, an assessment result is provided. If the speaker speaks as follows:
Is it very easy (silence) for you to stay healthy (silence) in England (silence).
Then although the assessment result of his/her rhythm feature can be good, the assessment result of the fluency feature can have problem.
The step of determining standard silence duration further includes the step of traversing a decision tree of the standard language structure according to input language structure of at least one word of the input text data to determine standard silence duration of phrase boundary of the at least one word, wherein the standard silence duration is an average value of the silence duration of phrase boundary of standard language structures for which statistics have been gathered.
Take the decision tree in
Is it very very easy for you to stay healthy in England.
No pitch reset occurs between the two instances of “very”, therefore the repetition of “very” can be caused by lack of fluency. If the input speech data is:
Is it very (pitch reset) very easy for you to stay healthy in England.
Then, the repetition of “very” can be caused by an emphasis intentionally made by the speaker. At step 1106, a permissible value of the number of repetition times is acquired (for example, a word or phrase can be repeated once in a paragraph at most); and at step 1108, the number of repetition times of the input speech data is compared with the permissible value. At step 1110, an assessment result of the comparison is provided.
The prosody constraint includes one or more of rhythm constraints or fluency constraints. The system can further include a rhythm feature acquiring means (not shown in the figure) for acquiring rhythm feature of the input speech data. The rhythm feature is represented as phrase boundary location. The phrase boundary includes at least one of silence and pitch reset. In addition, the prosody constraint acquiring means is further used for acquiring standard rhythm feature corresponding to the input speech data. The assessing means is further used for comparing the rhythm feature of the input speech data with the corresponding standard rhythm feature.
According to another embodiment of the present invention, the system further includes a fluency feature acquiring means (not shown in the figure) for acquiring the fluency feature of the input speech data, and the prosodic feature acquiring means is further used for acquiring input text data corresponding to the input speech data, aligning the input text data with the input speech data, and measuring fluency feature of the input speech data.
Other functions performed by the system for assessing speech prosody shown in
It is to be noted that, the present invention can only assess one or more rhythm features of the input speech data, or can only assess one or more fluency features or can perform a comprehensive prosody assessment by combining one or more rhythm features and one or more fluency features. If there is more than one assessed item, different or same weights can be set for each different assessed item. In other words, different assessment strategies can be established based on actual need.
Although the present invention provides a method and system for assessing speech prosody, it can also be combined with other method and system for assessing speech. For instance, the system of the present invention can be combined with another speech assessing system such as a system for assessing pronunciation and/or a system for assessing grammar so as to perform a comprehensive assessment on the input speech data. The result of prosody assessment of the present invention can be taken as one item of the comprehensive speech assessment and be assigned a certain weight.
According to one embodiment of the invention, based on the assessment result, an input speech data with a high score can be added into the corpus as standard speech data, thereby further enriching the quantity of standard speech data.
According to another embodiment of the present invention, the system for assessing speech prosody can also be applied in a local computer for a speaker to perform speech prosody assessment. According to yet another embodiment of the present invention, the system for assessing speech prosody can also be designed as a special hardware device for a speaker to perform speech prosody assessment.
The assessment result of the present invention includes at least one of the following: score of prosody of the input speech data; detailed analysis on prosody of the input speech data; or reference speech data. The score can be assessed using a hundred-point system, five-point system or any other system; or descriptive score can be used, such as excellent, good, fine, or bad.
The detailed analysis can include one or more of the following: location where speaker's silence/pitch reset is inappropriate, total number of speaker's silence/pitch reset is too high, speaker's silence duration at certain location is too long, speaker's number of repetition times of some word/phrase is too high, and speaker's phone hesitation degree of some word is too high. The assessment result can also provide speech data for reference. For example, a correct way for reading the sentence “Is it very easy for you to stay healthy in England”. There can be multiple pieces of reference speech data. The system of the present invention can provide one piece of reference speech data, or provide multiple pieces of speech data for reference.
Although the description above takes one English sentence as an example, the present invention has no limitation on the type of language to be assessed. The present invention can be applied to assess prosody of speech data of various languages such as Chinese, Japanese, Korean, etc. Although the description above takes speech as an example, the present invention can also assess prosody of other phonetic forms such as singing or rap.
As will be appreciated by one skilled in the art, the present invention can be embodied as a system, method or computer program product. Accordingly, the present invention can take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that can all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, the present invention can take the form of a computer program product embodied in any tangible medium of expression having computer usable program code embodied in the medium.
Any combination of one or more computer usable or computer readable medium(s) can be utilized. The computer-usable or computer-readable medium can be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific examples (a non-exhaustive list) of the computer-readable medium can include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CDROM), an optical storage device, a transmission media such as those supporting the Internet or an intranet, or a magnetic storage device.
Note that the computer-usable or computer-readable medium can even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. In the context of this document, a computer-usable or computer-readable medium can be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-usable medium can include a propagated data signal with the computer-usable program code embodied therewith, either in baseband or as part of a carrier wave. The computer usable program code can be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc.
Computer program code for carrying out operations of the present invention can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).
The present invention is described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions can also be stored in a computer-readable medium that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams can represent a module, segment, or portion of code, which includes one or more executable instructions for implementing the specified logical function(s).
It should also be noted that, in some alternative implementations, the functions noted in the block can occur out of the order noted in the figures. For example, two blocks shown in succession can, in fact, be executed substantially concurrently, or the blocks can sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention.
The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Number | Date | Country | Kind |
---|---|---|---|
2010 1 0163229 | Apr 2010 | CN | national |
Number | Name | Date | Kind |
---|---|---|---|
4377158 | Friedman et al. | Mar 1983 | A |
4695962 | Goudie | Sep 1987 | A |
4783807 | Marley | Nov 1988 | A |
4799261 | Lin et al. | Jan 1989 | A |
5305421 | Li | Apr 1994 | A |
5396577 | Oikawa et al. | Mar 1995 | A |
5732395 | Alexander Silverman | Mar 1998 | A |
5761637 | Chino | Jun 1998 | A |
5890117 | Silverman | Mar 1999 | A |
6003005 | Hirschberg | Dec 1999 | A |
6006175 | Holzrichter | Dec 1999 | A |
6029131 | Bruckert | Feb 2000 | A |
6182028 | Karaali | Jan 2001 | B1 |
6505158 | Conkie | Jan 2003 | B1 |
6601030 | Syrdal | Jul 2003 | B2 |
6625575 | Chihara | Sep 2003 | B2 |
6665641 | Coorman et al. | Dec 2003 | B1 |
7035791 | Chazan et al. | Apr 2006 | B2 |
7069216 | DeMoortel et al. | Jun 2006 | B2 |
7120575 | Haase et al. | Oct 2006 | B2 |
7136816 | Strom | Nov 2006 | B1 |
7219059 | Gupta et al. | May 2007 | B2 |
7219060 | Coorman et al. | May 2007 | B2 |
7324944 | Hansen et al. | Jan 2008 | B2 |
7359856 | Martin | Apr 2008 | B2 |
7433819 | Adams et al. | Oct 2008 | B2 |
7454347 | Koyama | Nov 2008 | B2 |
7617105 | Shi et al. | Nov 2009 | B2 |
7761301 | Xu | Jul 2010 | B2 |
7844457 | Chen et al. | Nov 2010 | B2 |
7873522 | Du et al. | Jan 2011 | B2 |
7899672 | Qin | Mar 2011 | B2 |
7962341 | Braunschweiler | Jun 2011 | B2 |
7996214 | Bangalore | Aug 2011 | B2 |
8024174 | Wang et al. | Sep 2011 | B2 |
8175879 | Nitisaroj et al. | May 2012 | B2 |
8219398 | Marple et al. | Jul 2012 | B2 |
8234118 | Pyo | Jul 2012 | B2 |
8315870 | Hanazawa | Nov 2012 | B2 |
8332225 | Zhao et al. | Dec 2012 | B2 |
8484035 | Pentland | Jul 2013 | B2 |
8571849 | Bangalore et al. | Oct 2013 | B2 |
8694319 | Bodin | Apr 2014 | B2 |
20030236663 | Dimitrova | Dec 2003 | A1 |
20040067472 | Polanyi et al. | Apr 2004 | A1 |
20040230421 | Cezanne et al. | Nov 2004 | A1 |
20050071163 | Aaron et al. | Mar 2005 | A1 |
20050119894 | Cutler et al. | Jun 2005 | A1 |
20050177369 | Stoimenov et al. | Aug 2005 | A1 |
20050182625 | Azara | Aug 2005 | A1 |
20050187772 | Azara | Aug 2005 | A1 |
20050267758 | Shi | Dec 2005 | A1 |
20060015326 | Mori | Jan 2006 | A1 |
20060057545 | Mozer et al. | Mar 2006 | A1 |
20060074655 | Bejar | Apr 2006 | A1 |
20060074659 | Adams et al. | Apr 2006 | A1 |
20060136225 | Kuo et al. | Jun 2006 | A1 |
20060149558 | Kahn | Jul 2006 | A1 |
20070055526 | Eide et al. | Mar 2007 | A1 |
20070083357 | Moore et al. | Apr 2007 | A1 |
20070213982 | Xi | Sep 2007 | A1 |
20070250318 | Waserblat et al. | Oct 2007 | A1 |
20080059190 | Chu et al. | Mar 2008 | A1 |
20080177543 | Nagano et al. | Jul 2008 | A1 |
20080319727 | Horvitz | Dec 2008 | A1 |
20090204398 | Du et al. | Aug 2009 | A1 |
20090258333 | Yu | Oct 2009 | A1 |
20100004931 | Ma et al. | Jan 2010 | A1 |
20100161327 | Chandra et al. | Jun 2010 | A1 |
20100174533 | Pakhomov | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
1726533 | Jan 2006 | CN |
1971708 | May 2007 | CN |
1203366 | Aug 2003 | EP |
WO 0250798 | Jun 2002 | WO |
WO2004053834 | Jun 2004 | WO |
WO2006125346 | Nov 2006 | WO |
Entry |
---|
Silverman, Kim EA, Mary E. Beckman, John F. Pitrelli, Mari Ostendorf, Colin W. Wightman, Patti Price, Janet B. Pierrehumbert, and Julia Hirschberg. “TOBI: a standard for labeling English prosody.” In ICSLP, vol. 2, pp. 867-870. 1992. |
Wang, Michelle Q., and Julia Hirschberg. “Automatic classification of intonational phrase boundaries.” Computer Speech & Language 6, No. 2 (1992): 175-196. |
Syrdal et al. “Inter-Transcriber Reliability of ToBI Prosodic Labeling” 2000. |
Ma et al. “Automatic Prosody Labeling Using Both Text and Acoustic Information” 2003. |
“An automatic prosody labeling system using ANN-based syntactic-prosodic model and GMM-based acoustic-prosodic model,” K Chen, M Hasegawa-Johnson, A Cohen, Acoustics, Speech, and Signal Processing, 2004. Proceedings.(ICASSP'04, Montreal, Canada, 509-512.). |
Rao et al., “Word boundary detection using pitch variations”, Fourth International Conference on Spoken Language, 1996. ICSLP 96. Proceedings. Oct. 3-6, 1996, vol. 2, pp. 813-816. |
Shi, Qin, et al., “Combining Length Distribution Model with Decision Tree in Prosodic Phrase Prediction,” IBM China Research Lab, Beijing, China, Interspeech 2007, pp. 1029-1032. |
A prosody only decision-tree model for disfluency detection. E Shriberg, RA Bates, A Stolcke—Eurospeech, 1997. |
Audhkhasi et al., “Automatic Evaluation of Spoken English Fluency”. ICASSP, 2009. pp. 4829-4832. |
Ananthakrishnan et al., “Automatic Prosodic Event Detection Using Acoustic, Lexical, and Syntactic Evidence”, IEEE, Jan. 2008, vol. 16, No. 1. |
Hansakunbuntheung Chatchawarn, et al., “Model-Based Automatic Evaluation of L2 Learner's English Timing”, Jan. 1, 2009, Interspeech XX, XX, pp. 2855-2858, XP008139139, abstract. |
Number | Date | Country | |
---|---|---|---|
20110270605 A1 | Nov 2011 | US |