Speech recognition and speech translation systems receive spoken information in one language, and translate it to another language. These systems are often based on a database that has been trained using the two different languages.
The present application teaches techniques for handling mixed multilingual communication in a speech recognition and translation system.
According to an embodiment, entities from outside the source language are isolated and preserved during machine translation of speech.
These and other aspects will now be discussed in reference to the accompanying drawings, wherein:
The general structure and techniques, and more specific embodiments, which can be used to effect different ways of carrying out the more general goals, are described herein.
The present application relates to issues arising in speech recognition and speech translation systems. These systems can use text-to-text translation system, or can be systems that listen to oral communication, e.g. speech translation systems. These systems are referred to herein as being speech systems. It should be understood that speech systems include generically all of these systems.
The inventors recognized a problem that occurs in these systems. Specifically, it is not uncommon to hear multiple different languages uttered together. For example, it is not uncommon to hear an English utterance in a foreign language. The English utterances may be English names, English words, or others. Bilingual speakers may even pronounce the foreign words with the appropriate accent for the multiple languages.
Speech systems have historically assumed that the input speech is in a specified language, and compare it against corpora formed from training information. The attempt to translate may be complicated or fooled by the foreign language words.
An embodiment described herein uses language detection for increased speech recognition and speech translation. An embodiment describes processing and/or preservation of foreign language material within information to be translated.
First, a notation is described. Consider the example of a translation from an English speaker into Arabic. In the example, the English speaker is bilingual, also fluent in Spanish, and may use Spanish words within the utterance. The languages are represented notationally as follows. The primary source language or PL is English in this example, and transcription of text(P) refers to this primary source language. The secondary source language here is Spanish, referred to as SL; transcription of text(S). The target language or TL here is Arabic, and transcription of text(T).
The operation can be carried out by a programmed computer that runs the flowcharts described herein. The computer can be as shown in
In operation, the computer is programmed to carry out a speech operation.
At 200, the system first detects words within the language that are “named entities”. The named entities may be in either the primary language or the secondary language. This detection allows the name entities to be appropriately conveyed to the target. Embodiments as described herein use proper names as the named entities; however it should be understood that other named entities can be used.
210 illustrates labeling the named entities as being separately translatable. Certain named entities, such as proper names, may be conveyed or preserved into the translated language either by re-synthesis in the translated language or by simple repetition of the primary language or secondary language after voice morphing into the translated language. In the embodiment, the names can be proper names, can be product names, they can be items which represent places, or they can simply be words in the foreign (primary or secondary source) language representing places such as city names.
The detecting and translating can be carried out as follows.
(my name is John)P becomes
(my name is)P (John)P
Translating this to the target language (P→T) yields
(my name is)T (John)P.
In this example, the word John is actually a named entity, here a name, in the primary language, and needs to stay in the primary language as part of the translation. Accordingly, the phrase is first segmented into the two parts: “my name is” first in the primary language, and “John” also in the primary language. Upon translation, the “my name is” part is translated, but “John” is maintained. The named entity may be uttered via automated speech reading, or alternatively may be recorded in the source language and replayed in the target language.
A second example includes information in both the primary and secondary languages.
(My name is Jorge)P
(My name is)P (Jorge)S
P→T
(My name is)T (Jorge)S.
In both of these examples, the “Jorge” and “John” do not have corresponding translations in the foreign language, and hence the primary language or secondary language word is kept at 230. The remainder is translated at 240.
If the label names have a translation in the foreign language, they are translated at 240. An example is:
(Take this aspirin)P
(Take this)P (aspirin)P
P→T
(Take this) T (aspirin)T.
In this example, the word “aspirin”, which can be in the primary or secondary language has a translation in the foreign language. Accordingly, this translation is used.
Many times, the named entity will also have meaning as a regular dictionary word, but identifying it as a named entity will increase its translation accuracy. For example:
(He is driving an Infinity)P
(He is driving)P (an Infinity)P.
P→T
(He is driving)T (a luxury car)T
This kind of generic word for the meaning of the term in the source language may be more meaningful in the translated language. Alternatively, the original word can be retained. However, in this example, failure to identify the word “Infinity” as a named entity would likely cause it to be mistranslated, e.g., as the number infinity.
Although only a few embodiments have been disclosed in detail above, other embodiments are possible and the inventor (s) intend these to be encompassed within this specification. The specification describes specific examples to accomplish a more general goal that may be accomplished in another way. This disclosure is intended to be exemplary, and the claims are intended to cover any modification or alternative which might be predictable to a person having ordinary skill in the art. For example, while the above has discussed identifying names within the phrases, it should be understood that it is alternatively possible to simply recognize any foreign word in the secondary language within the primary language during its segmentation Also, the inventor(s) intend that only those claims which use the words “means for” are intended to be interpreted under 35 USC 112, sixth paragraph. Moreover, no limitations from the specification are intended to be read into any claims, unless those limitations are expressly included in the claims. The computers described herein may be any kind of computer, either general purpose, or some specific purpose computer such as a workstation. The computer may be an Intel (e.g., Pentium or Core 2 duo) or AMD based computer, running Windows XP or Linux, or may be a Macintosh computer. The computer may also be a handheld computer, such as a PDA, cellphone, or laptop, or any other device such as a game console, a media console etc.
The programs may be written in C, or C++, or Python, or Java, or Brew, or any other programming language. The programs may be resident on a storage medium, e.g., magnetic or optical, e.g. the computer hard drive, a removable disk or media such as a memory stick or SD media, wired or wireless network based or Bluetooth based Network Attached Storage (NAS), or other removable medium. The programs may also be run over a network, for example, with a server or other machine sending signals to the local machine, which allows the local machine to carry out the operations described herein.
Where a specific numerical value is mentioned herein, it should be considered that the value may be increased or decreased by 20%, while still staying within the teachings of the present application, unless some different range is specifically mentioned. Where a specified logical sense is used, the opposite logical sense is also intended to be encompassed.
This application claims priority to U.S. Provisional Application 60/801,254, filed May 18, 2006. The disclosure of the prior application is considered part of (and is incorporated by reference in) the disclosure of this application.
This invention was made with government support under Grant No. N66001-02-C-6023 awarded by DARPA/SPAWAR. The government has certain rights in the invention.
Number | Name | Date | Kind |
---|---|---|---|
2177790 | Scott | Oct 1939 | A |
2674923 | William | Apr 1954 | A |
4067122 | Fernandez et al. | Jan 1978 | A |
4419080 | Erwin | Dec 1983 | A |
4599612 | Kaji et al. | Jul 1986 | A |
4604698 | Ikemoto et al. | Aug 1986 | A |
4658374 | Tanimoto et al. | Apr 1987 | A |
5161105 | Kugimiya et al. | Nov 1992 | A |
5201042 | Weisner et al. | Apr 1993 | A |
5525060 | Loebner | Jun 1996 | A |
5576953 | Hugentobler | Nov 1996 | A |
5678001 | Nagel et al. | Oct 1997 | A |
5697789 | Sameth et al. | Dec 1997 | A |
5741136 | Kirksey et al. | Apr 1998 | A |
5760788 | Chainini et al. | Jun 1998 | A |
5799267 | Siegel | Aug 1998 | A |
5855000 | Waibel et al. | Dec 1998 | A |
5882202 | Sameth et al. | Mar 1999 | A |
5926179 | Matsuda et al. | Jul 1999 | A |
5991594 | Froeber et al. | Nov 1999 | A |
5991711 | Seno et al. | Nov 1999 | A |
6073146 | Chen | Jun 2000 | A |
6234802 | Pella et al. | May 2001 | B1 |
6243675 | Ito | Jun 2001 | B1 |
6339754 | Flanagan et al. | Jan 2002 | B1 |
6374224 | Horiguchi et al. | Apr 2002 | B1 |
6394899 | Walker | May 2002 | B1 |
6669562 | Shiino | Dec 2003 | B1 |
6755657 | Wasowicz | Jun 2004 | B1 |
6859778 | Bakis et al. | Feb 2005 | B1 |
6866510 | Polanyi et al. | Mar 2005 | B2 |
6970821 | Shambaugh et al. | Nov 2005 | B1 |
7016829 | Brill et al. | Mar 2006 | B2 |
7155382 | Boys | Dec 2006 | B2 |
7238024 | Rehbein et al. | Jul 2007 | B2 |
7359849 | Palmquist | Apr 2008 | B2 |
7409348 | Wen et al. | Aug 2008 | B2 |
7461001 | Liqin et al. | Dec 2008 | B2 |
7689407 | Yang et al. | Mar 2010 | B2 |
7689422 | Eves et al. | Mar 2010 | B2 |
20020059056 | Appleby | May 2002 | A1 |
20020095281 | Cox et al. | Jul 2002 | A1 |
20020150869 | Shpiro | Oct 2002 | A1 |
20040083111 | Rehbein et al. | Apr 2004 | A1 |
20040210923 | Hudgeons et al. | Oct 2004 | A1 |
20040248068 | Davidovich | Dec 2004 | A1 |
20050014563 | Barri | Jan 2005 | A1 |
20050084829 | Peters | Apr 2005 | A1 |
20050165645 | Kirwin | Jul 2005 | A1 |
20050216256 | Lueck | Sep 2005 | A1 |
20060212288 | Sethy et al. | Sep 2006 | A1 |
20060293874 | Zhang et al. | Dec 2006 | A1 |
20070015121 | Johnson et al. | Jan 2007 | A1 |
20070136068 | Horvitz | Jun 2007 | A1 |
20070208569 | Subramanian et al. | Sep 2007 | A1 |
20070294077 | Narayanan et al. | Dec 2007 | A1 |
20080003551 | Narayanan et al. | Jan 2008 | A1 |
20080040095 | Sinha et al. | Feb 2008 | A1 |
20080065368 | Narayanan et al. | Mar 2008 | A1 |
20080255824 | Aso | Oct 2008 | A1 |
20080268955 | Spittle | Oct 2008 | A1 |
20090106016 | Athsani et al. | Apr 2009 | A1 |
20100009321 | Purushotma | Jan 2010 | A1 |
Entry |
---|
U.S. Appl. No. 11/754,148, filed May 25, 2007, in Office Action mailed Jun. 7, 2010, 16 pages. |
U.S. Patent Office, U.S. Appl. No. 11/752,227, filed May 22, 2007, in Office Action mailed Apr. 30, 2010, 11 pages. |
U.S. Patent Office, U.S. Appl. No. 11/749,677, filed May 16, 2007, in Office Action mailed Aug. 31, 2010, 20 pages. |
Number | Date | Country | |
---|---|---|---|
20080071518 A1 | Mar 2008 | US |
Number | Date | Country | |
---|---|---|---|
60801254 | May 2006 | US |