CN106951081B - implementation method of brain-controlled speech generator based on P300 - Google Patents
implementation method of brain-controlled speech generator based on P300 Download PDFInfo
- Publication number
- CN106951081B CN106951081B CN201710162409.7A CN201710162409A CN106951081B CN 106951081 B CN106951081 B CN 106951081B CN 201710162409 A CN201710162409 A CN 201710162409A CN 106951081 B CN106951081 B CN 106951081B
- Authority
- CN
- China
- Prior art keywords
- cur
- character
- loc
- sen
- spelling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 210000004556 brain Anatomy 0.000 title claims abstract description 16
- 239000011159 matrix material Substances 0.000 claims description 40
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000004048 modification Effects 0.000 claims description 4
- 238000012986 modification Methods 0.000 claims description 4
- 239000000126 substance Substances 0.000 claims description 3
- 238000012549 training Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 4
- 238000004422 calculation algorithm Methods 0.000 abstract description 3
- 238000004891 communication Methods 0.000 description 3
- 230000003925 brain function Effects 0.000 description 2
- 208000028389 Nerve injury Diseases 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000001771 impaired effect Effects 0.000 description 1
- 238000012821 model calculation Methods 0.000 description 1
- 238000003058 natural language processing Methods 0.000 description 1
- 230000008764 nerve damage Effects 0.000 description 1
- 230000000638 stimulation Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/011—Arrangements for interaction with the human body, e.g. for user immersion in virtual reality
- G06F3/015—Input arrangements based on nervous system activity detection, e.g. brain waves [EEG] detection, electromyograms [EMG] detection, electrodermal response detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/16—Sound input; Sound output
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Human Computer Interaction (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Dermatology (AREA)
- Neurosurgery (AREA)
- Neurology (AREA)
- Biomedical Technology (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Machine Translation (AREA)
Abstract
the invention relates to a method for realizing a P300-based brain-controlled speech sounder, which is used for decoding a sentence spelled by a P300Speller and playing the sentence by a speech sounder to realize the process that a user directly completes speaking through the brain; the method mainly comprises the following steps: the user spells the character sequence in sequence through the P300Speller, and certain minor characters can be omitted in the spelling process until a complete sentence is spelled; correcting the spelled character sequence by using a decoding algorithm to obtain a correct sentence; the correct sentence is then transmitted to the speech generator. The method provided by the invention can improve the speed of spelling sentences by the P300Speller and realize the function of directly speaking by the brain.
Description
Technical Field
the invention belongs to the application of combining a brain-computer interface and natural language processing, and relates to a method for spelling sentences based on P300 and realizing brain speaking through a speech device.
background
The brain-computer interface provides a way for some patients with motor nerve damage and brain function damage to communicate with the outside world, wherein the P300Speller analyzes brain electrical signals through a series of stimulations to the brain, and identifies characters which the user wants to spell to achieve communication with the outside world. Currently, the spelling of a sentence by the P300Speller can only be spelled one by one for characters, and the user can only correct the spelling by himself when an error occurs. There are problems in that it takes a long time to spell a sentence, users are fatigued easily, and the spelling effect is not good.
Disclosure of Invention
Accordingly, the present invention is directed to increasing the speed of spelling a sentence by a user using a P300Speller and increasing the efficiency of communication between the user and the outside. In the invention, a user can omit certain minor characters in the spelling process and does not correct errors by himself, the spelling character sequence is corrected by a decoding algorithm, and the obtained correct sentence is transmitted to a voice generator.
The invention is realized by adopting the following scheme: a realization method of a brain-controlled speech generator based on P300 comprises the following steps:
Step S1: user spells the Sentence sequence c by the P300 spelling matrix1c2,…,cnThe P300 spelling matrix comprises letters A-Z, 36 characters in total from 0 to 9, ciI is 1, … n is the character in the P300 spelling matrix;
step S2: correcting the sequence, inserting the character which is missed to be input into the sequence, and correcting the error character to obtain a new Sentence C _ sequence;
step S3: and transmitting the C _ Sennce to a voice generator and playing.
further, the step S2 specifically includes the following steps:
step S21: setting structural variables Cur, cur.sen ═ sequence, cur.loc ═ 1, cur.len ═ length (sequence); initializing a stack S, listing a table L, and pressing Cur into the stack S;
Step S22: if the stack S is not empty, popping the stack to update Cur, and turning to the next step; otherwise, go to step S26;
Step S23: judging whether a character is to be inserted into the Cur.loc position; if so, ins.sen ═ Insert (cur.sen, cur.loc), ins.loc ═ cur.loc +1, ins.len ═ cur.len +1, Ins is pushed into the stack S;
Step S24: correcting a character at a position of cur.loc, cur.sen ═ modification (cur.sen, cur.loc); cor. loc ═ cur. loc + 1;
step S25: if Cur.loc is larger than Cur.len, inserting Cur into a table L, otherwise, pressing Cur into a stack S; proceed to step S22;
step S26: the probabilities of all sentences in the table L are calculated using the word language model, and the Sentence C _ sequence with the highest probability is output.
Further, the specific method for determining whether to Insert a character and an Insert (cur.sen, cur.loc) in the cur.loc position in step S23 is as follows:
Taking the Cur.loc position as the center, taking a character subsequence from Cur.senIs denoted by c1c2…ck(ii) a At c1c2…ckInserting character c at the position corresponding to Curi,cie C, C contains the space character and all the characters in the P300 spelling matrix, resulting in C1c2…ci...ck+1(ii) a Computing c with a 5-gram character language model1c2...ckAnd c1c2…ci...ck+1,ciE probability of C, from C1c2…ci…ck+1,cie C, selecting the character sequence with the highest probability, and comparing it with C1c2...ckIf the probability is higher, inserting the character;
when a character is to be inserted, Insert (cur. sen, cur. loc) is inserted at the cur.loc position of the cur.sen character sequence so that c.sen1c2...ci...ck+1,cie C the one with the highest probability of Ci。
further, the specific method for correcting the character at the cut.loc position, modify (cut.sen, cut.loc) in step S24 is as follows:
Selecting a plurality of characters with high possibility to be input actually to form a character set according to the character of Cur.sen at the Cur.loc position and the P300 spelling matrix probability modelLet i ═ curWherein c islsen in the original character of the l position, cl'is a character corrected in the l position by Cur.sen, P (c'l|cl) Taken from the P300 spelling matrix probability model, if clis an inserted space, then P (c'l|cl) Taking 1; c. C1c2...ci...cnSen or its corrected result, P (c)1c2...ci...cn) According to 5-gram character languageFor model calculation, α is a scale factor; is calculated to obtain cbBy cbreplacement of c in Curias output of modify (cur. sen, cur. loc).
Further, the specific method for calculating the probability of the sentence in step S26 is as follows:
sen in the sentence of the table L are read, the space is used as a separator to separate the words, and the words are sequentially stored in the wiI 1.. m, then the probability of the sentence is calculated using a 3-gram word language model, the formula is as follows,
Wherein C (w)i-2wi-1wi) And C (w)i-2wi-1) Are respectively words wi-2wi- 1wiAnd wi-2wi-1Number of occurrences in the corpus.
Further, according to the character of Cur.sen at the Cur.loc position and the probability model of the P300 spelling matrix, selecting a plurality of characters with high possibility to be input actually to form a character setand P (c'l|cl) The specific method is taken from a P300 spelling matrix probability model and comprises the following steps:
The user carries out P300 spelling training before using the user, and a P300 spelling matrix probability model is obtained through calculation and is represented as a matrix A; element a in Aij=P(cj|ci),ciSpelling the resulting character for the user, cjFor the character to be spelled actually, P (c)j|ci) The character obtained when spelling is ciwhen the character actually intended to be spelled is cjthe probability of (a) of (b) being,ci,cj∈{'A','B',...,'Z','0',...,'9'},i=1,2,...,36,j=1,2,..36;
for the character of Cur.sen at the Cur.loc position, querying the row corresponding to the matrix A to obtain the characters with high possibility of actually spelling;
P(c'l|cl) C in (1)land cl' are characters, which correspond to the rows and columns of matrix A, respectively, and the corresponding probabilities are extracted from A.
Further, the specific method for calculating by using the 5-gram character language model comprises the following steps:
5-gram character language model calculates any character sequence c1c2...cnThe probability of (a) is determined by using,Wherein the content of the first and second substances,C(c1...ci-1ci) And C (C)1...ci-1) Are respectively a character c1...ci-1ciAnd c1...ci-1in the number of times the corpus is present,C(ci-4...ci-1ci) And C (C)i-4...ci-1) Are respectively a character ci-4...ci-1ciAnd ci-4...ci-1Number of occurrences in the corpus.
It is important to understand the needs and conditions of a patient with impaired motor and intact brain function, which requires a long time to spell a sentence with the P300 Speller. Therefore, compared with the prior art, the invention has the following advantages:
1. The invention can enable the user to omit some characters in the spelling process, reduce the work load of spelling and improve the spelling efficiency.
2. The invention adopts the decoding algorithm to correct the sentence spelled by the user, and improves the spelling rate of the sentence, thereby improving the communication speed with the outside.
3. the invention connects the spelled sentences through the voice equipment, more directly connects the user with the outside, and has strong practical application significance.
Drawings
FIG. 1 is a schematic illustration of the method flow of the present invention.
Detailed Description
The invention is further explained below with reference to the drawings and the embodiments.
The embodiment provides a method for implementing a brain-controlled speech generator based on P300, as shown in fig. 1, comprising the following steps:
Step S1: user spells the Sentence sequence c by the P300 spelling matrix1c2,…,cnThe P300 spelling matrix comprises letters A-Z, 36 characters in total from 0 to 9, cii is 1, … n is the character in the P300 spelling matrix;
step S2: correcting the sequence, inserting the character which is missed to be input into the sequence, and correcting the error character to obtain a new Sentence C _ sequence;
Step S3: and transmitting the C _ Sennce to a voice generator and playing.
In this embodiment, step S2 specifically includes the following steps:
step S21: setting structural variables Cur, cur.sen ═ sequence, cur.loc ═ 1, cur.len ═ length (sequence); initializing a stack S, listing a table L, and pressing Cur into the stack S;
step S22: if the stack S is not empty, popping the stack to update Cur, and turning to the next step; otherwise, go to step S26;
step S23: judging whether a character is to be inserted into the Cur.loc position; if so, ins.sen ═ Insert (cur.sen, cur.loc), ins.loc ═ cur.loc +1, ins.len ═ cur.len +1, Ins is pushed into the stack S;
Step S24: correcting a character at a position of cur.loc, cur.sen ═ modification (cur.sen, cur.loc); cor. loc ═ cur. loc + 1;
step S25: if Cur.loc is larger than Cur.len, inserting Cur into a table L, otherwise, pressing Cur into a stack S; proceed to step S22;
step S26: the probabilities of all sentences in the table L are calculated using the word language model, and the Sentence C _ sequence with the highest probability is output.
In this embodiment, the specific method for determining whether to Insert a character and an Insert (cur.sen, cur.loc) in the cur.loc position in step S23 is as follows:
Taking the Cur.loc position as the center, taking a character subsequence out of Cur.sen and marking as c1c2…ck(ii) a At c1c2...ckInserting character c at the position corresponding to Curi,ciE C, C contains the space character and all the characters in the P300 spelling matrix, resulting in C1c2…ci…ck+1(ii) a Computing c with a 5-gram character language model1c2...ckAnd c1c2...ci...ck+1,cie probability of C, from C1c2...ci...ck+1,ciE C, selecting the character sequence with the highest probability, and comparing it with C1c2...ckIf the probability is higher, inserting the character;
When a character is to be inserted, Insert (cur. sen, cur. loc) is inserted at the cur.loc position of the cur.sen character sequence so that c.sen1c2...ci...ck+1,ciE C the one with the highest probability of Ci。
In this embodiment, the specific method for correcting the character at the cut.loc position, modify (cut.sen, cut.loc) in step S24 is as follows:
Selecting a plurality of characters with high possibility to be input actually to form a character set according to the character of Cur.sen at the Cur.loc position and the P300 spelling matrix probability modelLet i ═ curWherein c islsen in the original character of the l position, cl'is a character corrected in the l position by Cur.sen, P (c'l|cl) Taken from the P300 spelling matrix probability model, if clIs an inserted space, then P (c'l|cl) Taking 1; c. C1c2...ci...cnSen or its corrected result, P (c)1c2...ci...cn) Calculating according to a 5-gram character language model, wherein alpha is a scale factor; is calculated to obtain cbBy cbReplacement of c in CuriAs output of modify (cur. sen, cur. loc).
in this embodiment, the specific method for calculating the probability of the sentence in step S26 is as follows:
Sen in the sentence of the table L are read, the space is used as a separator to separate the words, and the words are sequentially stored in the wiI 1.. m, then the probability of the sentence is calculated using a 3-gram word language model, the formula is as follows,
Wherein C (w)i-2wi-1wi) And C (w)i-2wi-1) Are respectively words wi-2wi- 1wiand wi-2wi-1Number of occurrences in the corpus.
In this embodiment, the characters with high possibility to be actually input are selected to form a character set according to the character of Cur.sen at the Cur.loc position and the probability model of the P300 spelling matrixAnd P (c'l|cl) The specific method is taken from a P300 spelling matrix probability model and comprises the following steps:
The user carries out P300 spelling training before using the user, and a P300 spelling matrix probability model is obtained through calculation and is represented as a matrix A; element a in Aij=P(cj|ci),ciSpelling the resulting character for the user, cjFor the character to be spelled actually, P (c)j|ci) The character obtained when spelling is ciWhen the character actually intended to be spelled is cjThe probability of (a) of (b) being,ci,cj∈{'A','B',...,'Z','0',...,'9'},i=1,2,...,36,j=1,2,..36;
For the character of Cur.sen at the Cur.loc position, querying the row corresponding to the matrix A to obtain the characters with high possibility of actually spelling;
P(c'l|cl) C in (1)land cl' are characters, which correspond to the rows and columns of matrix A, respectively, and the corresponding probabilities are extracted from A.
In this embodiment, the specific method for performing calculation by using the 5-gram character language model includes:
5-gram character language model calculates any character sequence c1c2...cnThe probability of (a) is determined by using,Wherein the content of the first and second substances,C(c1...ci-1ci) And C (C)1...ci-1) Are respectively a character c1...ci-1ciAnd c1...ci-1In the number of times the corpus is present,C(ci-4...ci-1ci) And C (C)i-4...ci-1) Are respectively a character ci-4...ci-1ciAnd ci-4...ci-1Number of occurrences in the corpus.
In this embodiment, the specific method of step S3 is as follows:
The corrected Sentence C _ sequence is transmitted to the command line execution file espeak of the speech generator espeak.
In this embodiment, the P300 spelling matrix is adjustable, and its size and the included characters are not the core content of this patent.
In the present embodiment, the size of the matrix a in the P300 spelling matrix probability model is determined according to the size of the P300 spelling matrix.
The above description is only a preferred embodiment of the present invention, and all equivalent changes and modifications made in accordance with the claims of the present invention should be covered by the present invention.
Claims (6)
1. A realization method of a brain-controlled speech generator based on P300 is characterized in that: the method comprises the following steps:
Step S1: user spells the Sentence sequence c by the P300 spelling matrix1c2,…,cnthe P300 spelling matrix comprises letters A-Z, 36 characters in total from 0 to 9, ciI is 1, … n is the character in the P300 spelling matrix;
Step S2: correcting the sequence, inserting the character which is missed to be input into the sequence, and correcting the error character to obtain a new Sentence C _ sequence;
Step S3: transmitting the C _ Sennce to a voice generator and playing;
Wherein, the step S2 specifically includes the following steps:
Step S21: setting structural variables Cur, cur.sen ═ sequence, cur.loc ═ 1, cur.len ═ length (sequence); initializing a stack S, listing a table L, and pressing Cur into the stack S;
Step S22: if the stack S is not empty, popping the stack to update Cur, and turning to the next step; otherwise, go to step S26;
Step S23: judging whether a character is to be inserted into the Cur.loc position; if so, ins.sen ═ Insert (cur.sen, cur.loc), ins.loc ═ cur.loc +1, ins.len ═ cur.len +1, Ins is pushed into the stack S;
Step S24: correcting a character at a position of cur.loc, cur.sen ═ modification (cur.sen, cur.loc); cor. loc ═ cur. loc + 1;
Step S25: if Cur.loc is larger than Cur.len, inserting Cur into a table L, otherwise, pressing Cur into a stack S; proceed to step S22;
Step S26: the probabilities of all sentences in the table L are calculated using the word language model, and the Sentence C _ sequence with the highest probability is output.
2. The implementation method of the P300-based brain-controlled speech sound generator according to claim 1, wherein: the specific method for judging whether to Insert a character and an Insert (cur.sen, cur.loc) in the cur.loc position in step S23 includes:
Taking the Cur.loc position as the center, taking a character subsequence out of Cur.sen and marking as c1c2...ck(ii) a At c1c2...ckInserting character c at the position corresponding to Curi,ciE C, C contains the space character and all the characters in the P300 spelling matrix, resulting in C1c2...ci...ck+1(ii) a Computing c with a 5-gram character language model1c2...ckAnd c1c2...ci...ck+1,cie probability of C, from C1c2...ci...ck+1,ciE C, selecting the character sequence with the highest probability, and comparing it with C1c2...ckIf the probability is higher, inserting the character;
When a character is to be inserted, Insert (cur. sen, cur. loc) is inserted at the cur.loc position of the cur.sen character sequence so that c.sen1c2...ci...ck+1,ciE C the one with the highest probability of Ci。
3. the implementation method of the P300-based brain-controlled speech sound generator according to claim 1, wherein: the specific method for correcting the character at the cur.loc position, modify (cur.sen, cur.loc) described in step S24 is as follows:
Selecting a plurality of characters with high possibility to be input actually to form a character set according to the character of Cur.sen at the Cur.loc position and the P300 spelling matrix probability modelLet i ═ curwherein c islSen in the original character of the l position, cl'is a character corrected in the l position by Cur.sen, P (c'l|cl) Taken from the P300 spelling matrix probability model, if clIs an inserted space, then P (c'l|cl) Taking 1; c. C1c2...ci...cnSen or its corrected result, P (c)1c2...ci...cn) Calculating according to a 5-gram character language model, wherein alpha is a scale factor; is calculated to obtain cbBy cbReplacement of c in CuriAs output of modify (cur. sen, cur. loc).
4. The implementation method of the P300-based brain-controlled speech sound generator according to claim 1, wherein: the specific method for calculating the probability of the sentence in step S26 is as follows:
Sen in the sentence of the table L are read, the space is used as a separator to separate the words, and the words are sequentially stored in the wiI 1.. m, then the probability of the sentence is calculated using a 3-gram word language model, the formula is as follows,
wherein C (w)i-2wi-1wi) And C (w)i-2wi-1) Are respectively words wi-2wi-1wiAnd wi-2wi-1Number of occurrences in the corpus.
5. the implementation method of the P300-based brain-controlled speech generator according to claim 3, wherein: selecting a plurality of characters with high possibility to be input actually according to the character of Cur.sen at the Cur.loc position and the probability model of the P300 spelling matrix to form a character setAnd P (c'l|cl) The specific method is taken from a P300 spelling matrix probability model and comprises the following steps:
The user carries out P300 spelling training before using the user, and a P300 spelling matrix probability model is obtained through calculation and is represented as a matrix A; element a in Aij=P(cj|ci),ciSpelling the resulting character for the user, cjFor the character to be spelled actually, P (c)j|ci) The character obtained when spelling is ciWhen the character actually intended to be spelled is cjThe probability of (a) of (b) being,
ci,cj∈{'A','B',...,'Z','0',...,'9'},i=1,2,...,36,j=1,2,..36;
For the character of Cur.sen at the Cur.loc position, querying the row corresponding to the matrix A to obtain the characters with high possibility of actually spelling;
P(c′l|cl) C in (1)lAnd c'lall are characters, which can correspond to the rows and columns of the matrix A respectively, and the corresponding probabilities are taken out from A.
6. The method for realizing the P300-based brain-controlled speech generator according to claim 2 or 3, wherein: the specific method for calculating by adopting the 5-gram character language model comprises the following steps:
5-gram character language model calculates any character sequence c1c2...cnthe probability of (a) is determined by using,Wherein the content of the first and second substances,C(c1...ci-1ci) And C (C)1...ci-1) Are respectively a character c1...ci-1ciAnd c1...ci-1In the number of times the corpus is present,C(ci-4...ci-1ci) And C (C)i-4...ci-1) Are respectively a character ci-4...ci-1ciAnd ci-4...ci-1number of occurrences in the corpus.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710162409.7A CN106951081B (en) | 2017-03-18 | 2017-03-18 | implementation method of brain-controlled speech generator based on P300 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710162409.7A CN106951081B (en) | 2017-03-18 | 2017-03-18 | implementation method of brain-controlled speech generator based on P300 |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106951081A CN106951081A (en) | 2017-07-14 |
CN106951081B true CN106951081B (en) | 2019-12-17 |
Family
ID=59472613
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710162409.7A Expired - Fee Related CN106951081B (en) | 2017-03-18 | 2017-03-18 | implementation method of brain-controlled speech generator based on P300 |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106951081B (en) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101350004A (en) * | 2008-09-11 | 2009-01-21 | 北京搜狗科技发展有限公司 | Method for forming personalized error correcting model and input method system of personalized error correcting |
KR101149002B1 (en) * | 2011-06-09 | 2012-05-23 | 한국과학기술원 | Adaptive brain-computer interface device |
CN103412640A (en) * | 2013-05-16 | 2013-11-27 | 胡三清 | Device and method for character or command input controlled by teeth |
CN106354270A (en) * | 2016-11-11 | 2017-01-25 | 北京理工大学 | Mobile head-mounted terminal and system based on brain-computer interface |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160342706A1 (en) * | 2015-05-18 | 2016-11-24 | Xerox Corporation | SYSTEM AND METHOD FOR ADDING NOISE TO n-GRAM STATISTICS |
-
2017
- 2017-03-18 CN CN201710162409.7A patent/CN106951081B/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101350004A (en) * | 2008-09-11 | 2009-01-21 | 北京搜狗科技发展有限公司 | Method for forming personalized error correcting model and input method system of personalized error correcting |
KR101149002B1 (en) * | 2011-06-09 | 2012-05-23 | 한국과학기술원 | Adaptive brain-computer interface device |
CN103412640A (en) * | 2013-05-16 | 2013-11-27 | 胡三清 | Device and method for character or command input controlled by teeth |
CN106354270A (en) * | 2016-11-11 | 2017-01-25 | 北京理工大学 | Mobile head-mounted terminal and system based on brain-computer interface |
Also Published As
Publication number | Publication date |
---|---|
CN106951081A (en) | 2017-07-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7831911B2 (en) | Spell checking system including a phonetic speller | |
TWI455111B (en) | Methods, computer systems for grapheme-to-phoneme conversion using data, and computer-readable medium related therewith | |
US9069753B2 (en) | Determining proximity measurements indicating respective intended inputs | |
US20210193121A1 (en) | Speech recognition method, apparatus, and device, and storage medium | |
KR20220035222A (en) | Speech recognition error correction method, related devices, and readable storage medium | |
Damper et al. | Evaluating the pronunciation component of text-to-speech systems for English: A performance comparison of different approaches | |
JP4818683B2 (en) | How to create a language model | |
CN101105894B (en) | Multifunctional language learning machine | |
JP5932869B2 (en) | N-gram language model unsupervised learning method, learning apparatus, and learning program | |
WO2014101826A1 (en) | Method and system for improving accuracy of voice recognition | |
JP2005258439A (en) | Generating large unit of graphoneme with mutual information criterion for character-to-sound conversion | |
Bollmann et al. | Manual and semi-automatic normalization of historical spelling-case studies from Early New High German. | |
CN110096705B (en) | Unsupervised English sentence automatic simplification algorithm | |
CN110870004A (en) | Syllable-based automatic speech recognition | |
CN111985234B (en) | Voice text error correction method | |
CN110335608A (en) | Voice print verification method, apparatus, equipment and storage medium | |
US20210312901A1 (en) | Automatic learning of entities, words, pronunciations, and parts of speech | |
CN103810993B (en) | Text phonetic notation method and device | |
CN110008471A (en) | A kind of intelligent semantic matching process based on phonetic conversion | |
US8170865B2 (en) | Speech recognition device and method thereof | |
CN113177114B (en) | Natural language semantic understanding method based on deep learning | |
Ostrogonac et al. | Morphology-based vs unsupervised word clustering for training language models for Serbian | |
JP6300394B2 (en) | Error correction model learning device and program | |
CN106951081B (en) | implementation method of brain-controlled speech generator based on P300 | |
Dufraux et al. | Lead2Gold: Towards exploiting the full potential of noisy transcriptions for speech recognition |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191217 |