US 7,450,698 B2Grant
System and method of utilizing a hybrid semantic model for speech recognition
Issue Date:2008-11-11
•18 Claims
•4 Drawing Sheets
Abstract
A method for processing a call is disclosed. The method receives a speech input in connection with a call and transforms at least a segment of the speech input into a first textual format. The method also generates a first list of entries based, at least partially, on a consideration of the first textual format, the first list comprising at least one action with a corresponding confidence level and at least one object with another corresponding confidence level, selects an entry of the first list having a higher corresponding confidence level, outputs a second textual format. The method further generates a second list based, at least partially on consideration of the selected entry and the second textual format and suggesting a routing option for the call based on the selected entry and a pairing entry in the second list having a high corresponding confidence level.
Metadata
Assignee
- AT&T Intellectual Property 1, L.P.
Inventors
- Robert R. Bushey
- Benjamin Anthony Knott
- John Mills Martin
Application Information
Application Number:US 11/036,204
Filing Date:2005-01-14
Priority Date:2005-01-14
Art Unit:2614
Classifications
IPC:
H04M11/00
Patent Drawings (4 sheets)
Description
Field of the Disclosure
[0001] The present disclosure relates generally to speech recognition and, more particularly, to a system and method of utilizing a hybrid semantic model for speech recognition.
Background
[0002] Many speech recognition systems utilize specialized computers that are configured to process human speech and carry out some task based on the speech. Some of these systems support “natural language” type interactions between users and automated call routing (ACR) systems. Natural language call routing allows callers to state the purpose of the call “in their own words.”
[0003] A goal of a typical ACR application is to accurately determine why a customer is calling and to quickly route the customer to an appropriate agent or destination for servicing. Research has shown that callers prefer speech recognition systems to keypad entry or touchtone menu driven systems.
[0004] As suggested above, natural language ACR systems attempt to interpret the intent of the customer based on the spoken language. When a speech recognition system partially misinterprets the caller's intent significant problems can result. A caller who is misrouted is generally an unhappy customer. Misrouted callers often terminate the call or hang-up when they realize that there has been a mistake. If a caller does not hang up they will typically talk to an operator who tries to route the call. Routing a caller to an undesired location and then to a human operator leads to considerable inefficiencies for a business. Most call routing systems handle a huge volume of calls and, even if a small percentage of calls are mishandled, the costs associated with the mishandled calls can be significant.
Brief Description of the Drawings
[0005] FIG. 1 illustrates a simplified configuration of a telecommunication system;
[0006] FIG. 2 is a general diagram that illustrates a method of routing calls;
[0007] FIG. 3 is a flow diagram that illustrates a method of processing and routing calls;
[0008] FIG. 4 is a table that depicts speech input and mapped synonym terms; and
[0009] FIG. 5 is a table illustrating action-object pairs and call destinations relating to the action-object pairs.
Detailed Description of the Drawings
[0010] The present disclosure is directed generally to integrating speech enabled automated call routing with action-object technology. Traditional automatic call routing systems assign a correct destination for a call 50% to 80% of the time. Particular embodiments of the disclosed system and method using action-object tables may achieve a correct destination assignment 85 to 95% of the time. In some embodiments, a semantic model may be used to create an action-object pair that further increases call routing accuracy while reducing costs. In particular implementations, the correct call destination routing rate may approach the theoretical limit of 100%. Due to higher effective call placement rates, the number of abandoned calls (e.g., caller hang-ups prior to completing their task) may be significantly reduced, thereby reducing operating costs and enhancing customer satisfaction.
[0011] In accordance with the teachings of the present disclosure, a call may be routed based on a selectable action-object pair. In practice, a call is received from a caller and a received speech input is converted into text or “text configurations,” which may be the same as, similar to, or can be associated with, known actions and objects. Generally, objects are related to nouns and actions are related to verbs. The converted text may be compared to tables of known text configurations representing objects and actions. A confidence level may be assigned to the recognized actions and objects based on text similarities and other rules. An action-object list may be created that contains recognized actions and objects and their confidence levels. In some embodiments, the entry (action or object) in the list with the highest confidence level may be selected as a dominant item. If an action is dominant a system incorporating teachings disclosed herein may look for a complementary object. Likewise, if an object is dominant, the system may look for a complementary action.
[0012] In some implementations, when an action is dominant, remaining actions may be masked and the confidence level of the complementary objects in the action-object list may be adjusted. Conversely, if an object is dominant, the remaining objects may be masked and the confidence level of complementary actions in the action-object list may be adjusted. An adjustment to an assigned confidence level may be based, for example, on the likelihood that the prospective complement in the action-object list is consistent with the dominant entry. Depending upon implementation details, a call may be routed based on a dominant action and a complementary object or a dominant object and a complementary action.
[0013] Referring now to FIG. 1 , an illustrated communications system 100 that includes a call routing support system is shown. Communications system 100 includes a speech-enabled call routing system (SECRS) 118, such as an interactive voice response system having a speech recognition module. Communications system 100 also includes a plurality of potential call destinations. Illustrative call destinations shown include service departments, such as billing department 120, balance information 122, technical support 124, employee directory 126, and new customer service departments 128. In practice, communication network 116 may receive calls from a variety of callers, such as the illustrated callers 110, 112, and 114. In a particular embodiment, communication network 116 may be a public telephone network, a wireless telephone network, a voice over Internet protocol (VOIP) type network, or some other network capable of supporting communication. As depicted, SECRS 118 may include components, such as a processor 142, memory 143, a synonym table 144, and a routing module 140. Depending upon implementation details, SECRS 118 may be coupled to and may route calls to various destinations across a LAN, an Intranet, an extranet, the Public Internet, and/or some other communication link or network, as shown. In addition, SECRS 118 may route calls to an agent, such as the illustrated live operator 130.
[0014] An illustrative embodiment of SECRS 118 may be a call center having a plurality of agent terminals attached. Thus, while only a single operator 130 is shown in FIG. 1 , it should be understood that a plurality of different agent terminals or types of terminals may be coupled to SECRS 118, such that a variety of agents may service incoming calls. Moreover, and as indicated above, SECRS 118 may be operable as an automated call routing system.
[0015] In a particular embodiment, action-object routing module 140 includes an action-object lookup table for matching action-object pairs to desired call routing destinations. This process may be better understood through consideration of FIG. 2 . Referring to FIG. 2 , an illustrative block diagram of SECRS 118 is depicted. In this particular embodiment, processor 142 in SECR 118 includes an acoustic processing model 210, semantic processing model 220, and action-object routing table 230. In a first conversion, acoustic model 210 may receive speech input 202 and provide text as its output 204. Semantic model 220 may receive text 204 directly or indirectly from acoustic model 210 and produce an action-object table. The action(s) and object(s) in the action-object table may be ordered or ranked according to a confidence level. The confidence level may be used to indicate how likely a given action or object reflects a correct and useable customer instruction.
[0016] When a speech input conversion creates a dominant action (e.g., an action has the highest confidence level in the action-object list), a system like SECRS 118 of FIG. 1 may initiate a secondary conversion that creates an object list from the initial speech input. The call may then be routed based on several criteria, such as the overall highest confidence level in the action-object list (a dominant list entry) and the highest confidence level complimentary term from the secondary conversion (a complement to the dominant entry).
[0017] In practice, the secondary conversion or a second list can be generated that may take the initial speech received from the caller and processes the initial speech a second time. During the second conversion the semantic model 220 may look specifically for consistent objects while ignoring actions if an action had the highest overall confidence level. In such a case, the high scoring action may have been selected, the actions may have been masked, and objects that are inconsistent with the selected action may be tagged as invalid. Examples of invalid action-object combinations can be understood by referring to FIG. 5 , where objects are listed on the left of the chart, and actions are listed across the top of the chart. For example, if the action of “acquire” has the highest confidence level in the action-object list then during the secondary conversion, objects such as “bill,” “payment,” “other providers,” “coupon specials” “name/number” and “store locations” may be masked or tagged as invalid selections.
[0018] If the speech input conversion creates a dominant object, a secondary conversion may be initiated to create an action list to assist in selecting a complementary action. The secondary conversion may take the initial speech received from the caller and processes the initial speech a second time. It may also rely on an output from the processing performed in connection with the earlier conversion. During the second conversion, semantic model 220 may look specifically for actions while ignoring objects. The confidence levels of actions may also be adjusted based on actions that are inconsistent with the selected object. Thus, in either case a call may be routed based on a dominant entry and a valid complement to the dominant entry.
[0019] The results of a reiterative speech recognition process may be provided to action-object routing table 230. Routing table 230 may receive action-object pairs 206 and produce a call routing destination 208. Based on the call routing destination 208, a call received at a call routing network like SECRS 118 may be routed to a final destination, such as the billing department 120 or the technical support service destination 124 depicted in FIG. 1 . In a particular embodiment, the action-object routing table 230 may be a look up table or a spreadsheet, such as a Microsoft Excel™ spreadsheet.
[0020] Referring to FIG. 3 , an illustrative embodiment of a method of processing a call using an automated call routing system such as the system of FIG. 1 is illustrated. The method starts at 300 and proceeds to step 302 where a speech input signal, such as a received utterance, is received or detected. Using phonemes or some other effective techniques, the received speech input may be converted into a plurality of word strings or text in accordance with an acoustic model, as shown at steps 304 and 306. In a particular embodiment, probability values may be assigned to word strings based on established rules and the content and coherency of the word string. At step 308, the word strings may be parsed into objects and actions. Objects generally represent nouns and adjective-noun combinations, while actions generally represent verbs and adverb-verb combinations. The actions and objects are assigned confidence values or probability values based on how likely they are to reflect the intent of the caller. In a particular embodiment a probability value or confidence level for the detected action and the detected object is determined utilizing a priority value of the word string used to create the selected action and the selected object.
[0021] In some cases, many possible actions and objects may be detected or created from the word strings. A method incorporating teachings of the present disclosure may attempt to determine and select a most probable action and object from a list of preferred objects and actions. To aid in this resolution, a synonym table such as the synonym table of FIG. 4 may be utilized to convert detected actions and objects into actions and objects that the system expects and/or is configured to “listen for.” Thus, detected objects and actions may be converted to expected actions and objects and assigned a confidence level. The process may also utilize the synonym table, for example, to adjust confidence levels of the actions and objects. The synonym table may store natural language phrases and their relationship with a set of actions and objects. In practice, natural language spoken by the caller may be compared to the natural language phrases in the table. Using the synonym table, the system and method may map portions of the natural phrases to detected objects and maps portions of the natural spoken phrase to detected actions. Thus, the word strings can be converted into expected objects and actions, at step 308. In summary, at step 310 multiple actions and multiple objects can be detected and provided with a confidence level according to the likelihood that a particular action or object identifies a customer's intent and thus will lead to a successful routing of the call.
[0022] The confidence level may be assigned to an action and/or an object based on many criteria, such as the textual similarities, business rules, etc., in step 310. Confidence levels may also be assigned based on a combination of factors, and some of these factors may not involved speech recognition. For example, in a particular example, if a caller does not currently have service, a caller's number (caller ID) may be utilized to assign a high confidence level to the action “acquire” and a low confidence value the actions “change” or “cancel.” In the event that a confidence level for an action-object pair is below a predetermined level, the call may be routed to a human operator or agent terminal.
[0023] An action-object list may be utilized at step 312 to select a dominant entry. If an action is selected as the dominant entry at step 334, other actions in the action-object list may be masked and objects that are inconsistent with the selected action may be tagged as invalid at step 336. The process of invalidating objects based on a dominant action can be further explained by referring to FIG. 5 where objects are listed on the left side of the chart and actions are listed across the top of the chart. For example if the action of “cancel” has the highest confidence level in the action-object list, the objects described as “bill,” “payment,” “other providers,” “coupon specials” “name/number” and “store locations” may be masked or tagged as invalid selections because a caller would not likely want to, for example, “cancel-store locations.” Thus, the method may ignore objects and invalid actions when a dominant object has been selected. The entries at the intersection of valid action-object illustrate routing destinations or phone extension where a call is routed when the system determines a dominant entry and it's complement.
[0024] Based on a dominant action, the confidence level of the objects can be adjusted at step 338. The caller's input of the utterance may be sent through the acoustic model, again in step 340, and the acoustic model may create and store word strings, as shown in step 342. Word strings may be parsed into objects using the semantic model in step 344, and an object list may be formed where each object in the list is assigned a confidence level in step 346. When a list is sufficiently complete, the object having the highest confidence level may be selected to complement the dominant action and an action-object pair may be created at step 330.
[0025] If at step 312 it is determined that an object has the highest confidence level or is dominant then a search for a complementary action may be conducted. Objects remaining in the action-object list and action that are inconsistent with the selected object may be masked or tagged as invalid, as shown in step 316. Thus such a method may ignore objects and invalid actions in the search for a complementary action when a dominant object has been elected.
[0026] Based on the dominant object, the confidence level of listed actions may be adjusted at step 318. The original caller input may be sent through the acoustic model, again in step 320 and the acoustic model may create and store word strings as in step 322. Words strings may then be parsed into objects using the semantic model in step 324 and an actions list may be formed where actions in the list is assigned a confidence level at step 326. The action having the highest confidence level (at step 328) may be selected to complement the dominant object and an action-object pair may be passed at step 330. The call may then be routed at step 331, the process ending at 332.
[0027] In practice, it may be beneficial to convert word strings such as “I want to have” to an action such as “get.” This substantially reduces the size of the action and object tables. As shown in FIG. 4 , differently expressed or “differently spoken” inputs that have the same or similar caller intent may be converted to a single detected action-object, and/or action-object pair. Further, improper and informal sentences as well as slang may be connected to an action-object pair that may not bear phonetic resemblance to the words uttered by the caller. With a mapped lookup table such as the table in FIG. 4 , speech training and learning behaviors found in conventional call routing systems may not be required. The tables in the present disclosure may be updated easily, leading to a lower cost of system maintenance. The above-disclosed subject matter is to be considered illustrative, and not restrictive, and the appended claims are intended to cover all such modifications, enhancements, and other embodiments that fall within the true spirit and scope of the present invention. Thus, to the maximum extent allowed by law, the scope of the present invention is to be determined by the broadest permissible interpretation of the following claims and their equivalents, and shall not be restricted or limited by the foregoing detailed description.
Claims
What is claimed is:
1. A method for processing a call comprising:
receiving a speech input in connection with a call;
transforming at least a segment of the speech input into a first textual format;
generating a first list of entries based, at least partially, on a consideration of the first textual format, the first list comprising at least one action with a corresponding confidence level and at least one object with another corresponding confidence level;
selecting an entry of the first list having a higher corresponding confidence level;
outputting a second textual format;
generating a second list based, at least partially on consideration of the selected entry and the second textual format; and
suggesting a routing option for the call based on the selected entry and a pairing entry in the second list having a high corresponding confidence level.
2. The method of claim 1, further comprising re-processing the speech input to create an object list when an action is the selected entry.
3. The method of claim 1, further comprising re-processing the speech input to create an action list when an object is the selected entry.
4. The method of claim 2, further comprising:
including an associated confidence level with an object entry in the object list; and
selecting an object as the pairing entry based on the associated confidence level.
5. The method of claim 3, further comprising:
reprocessing the speech input to produce the action list with confidence levels; and
selecting an action based on the confidence levels in the action list.
6. The method of claim 1, further comprising comparing the first textual format to a list of word strings and assigning a probability to at least one word string included in the list of word strings.
7. The method of claim 6, further comprising assigning an appropriate confidence level to the at least one word string.
8. The method of claim 1, wherein the entry selected is one of a verb and an adverb-verb combination.
9. The method of claim 1, wherein the entry selected is one of a noun or an adjective-noun combination.
10. The method of claim 1, further comprising utilizing a synonym table to assist in converting the speech input into action and objects.
11. A computer readable medium tangibly embodying a program of instructions to manipulate a processor to:
receive a speech input in connection with a call;
transform at least a portion of the speech input into a first textual format;
generate a first list based, at least partially, on a consideration of the first textual format, the list comprising at least one action with a corresponding confidence level and at least one object with its own corresponding confidence level;
select an entry of the first list having a high corresponding confidence level;
transform at least some of the speech input into a second textual format;
generate a second list based, at least partially on consideration of the selected entry and the second textual format, wherein entries in the second list have corresponding confidence levels; and
suggest a routing option for the call based at least partially on the selected entry and a pairing entry in the second list having a corresponding confidence level above a threshold value.
12. The computer readable medium of claim 11, further including instruction to re-process the speech input to create a list of potential objects to pair with an action when the action is the selected entry from the first list.
13. The computer readable medium of claim 11, further including instructions to re-process the speech input to create a list of potential actions when an object is the selected entry from the first.
14. The computer readable medium of claim 12, further including instructions to produce confidence levels of objects in the object list; and to select an object based on the object list confidence levels.
15. The computer readable medium of claim 13, further including instructions to produce confidence levels of actions in the action list; and to select an action based on the action list confidence levels.
16. The computer readable medium of claim 11, wherein the entry selected is one of a verb and an adverb-verb combination.
17. The computer readable medium of claim 11, wherein the entry selected is one of a noun or an adjective-noun combination.
18. The computer readable medium of claim 11, further comprising instruction to utilize a synonym table to select one of an action and an object.
Patent Citations (217)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4696028(A) | 1987-09-01 | Morganstein et al. | Applicant |
| US4788715(A) | 1988-11-01 | Lee | Applicant |
| US4953204(A) | 1990-08-01 | Cuschelg, Jr. et al. | Applicant |
| US4964077(A) | 1990-10-01 | Eisen et al. | Applicant |
| US4967405(A) | 1990-10-01 | Upp et al. | Applicant |
| US5042006(A) | 1991-08-01 | Flohrer | Applicant |
| US5235679(A) | 1993-08-01 | Yoshizawa et al. | Applicant |
| US5335269(A) | 1994-08-01 | Steinlicht | Applicant |
| US5416830(A) | 1995-05-01 | MacMillan, Jr. et al. | Applicant |
| US5455903(A) | 1995-10-01 | Jolissaint et al. | Applicant |
| US5497373(A) | 1996-03-01 | Hulen et al. | Applicant |
| US5522046(A) | 1996-05-01 | McMillen et al. | Applicant |
| US5530744(A) | 1996-06-01 | Charalambous et al. | Applicant |
| US5555299(A) | 1996-09-01 | Maloney et al. | Applicant |
| US5590186(A) | 1996-12-01 | Liao et al. | Applicant |
| US5632002(A) | 1997-05-01 | Hashimoto et al. | Applicant |
| US5652789(A) | 1997-07-01 | Miner et al. | Applicant |
| US5754639(A) | 1998-05-01 | Flockhart et al. | Applicant |
| US5754978(A) | 1998-05-01 | Perez-Mendez et al. | Applicant |
| US5923745(A) | 1999-07-01 | Hurd | Applicant |
| US5940476(A) | 1999-08-01 | Morganstein et al. | Applicant |
| US5946388(A) | 1999-08-01 | Walker et al. | Applicant |
| US5953704(A) | 1999-09-01 | McIlroy et al. | Applicant |
| US5991756(A) | 1999-11-01 | Wu | Applicant |
| US5995979(A) | 1999-11-01 | Cochran | Applicant |
| US5999965(A) | 1999-12-01 | Kelly | Applicant |
| US6002689(A) | 1999-12-01 | Christie et al. | Applicant |
| US6002760(A) | 1999-12-01 | Gisby | Applicant |
| US6003011(A) | 1999-12-01 | Sarin et al. | Applicant |
| US6028601(A) | 2000-02-01 | Machiraju et al. | Applicant |
| US6038293(A) | 2000-03-01 | McNerney et al. | Applicant |
| US6038305(A) | 2000-03-01 | McAllister et al. | Applicant |
| US6049594(A) | 2000-04-01 | Furman et al. | Applicant |
| US6064731(A) | 2000-05-01 | Flockhart et al. | Applicant |
| US6118866(A) | 2000-09-01 | Shtivelman | Applicant |
| US6119101(A) | 2000-09-01 | Peckover | Applicant |
| USRE37001(E) | 2000-12-01 | Morganstein et al. | Applicant |
| US6173266(B1) | 2001-01-01 | Marx et al. | Applicant |
| US6173289(B1) | 2001-01-01 | Sonderegger et al. | Applicant |
| US6173399(B1) | 2001-01-01 | Gilbrech | Applicant |
| US6175621(B1) | 2001-01-01 | Begeja | Applicant |
| US6259786(B1) | 2001-07-01 | Gisby | Applicant |
| US6269153(B1) | 2001-07-01 | Carpenter et al. | Applicant |
| US6317439(B1) | 2001-11-01 | Cardona et al. | Applicant |
| US6333980(B1) | 2001-12-01 | Hollatz et al. | Applicant |
| US6353608(B1) | 2002-03-01 | Cullers et al. | Applicant |
| US6366658(B1) | 2002-04-01 | Bjornberg et al. | Applicant |
| US6366668(B1) | 2002-04-01 | Borst et al. | Applicant |
| US6381329(B1) | 2002-04-01 | Uppaluru et al. | Applicant |
| US6385584(B1) | 2002-05-01 | McAllister et al. | Applicant |
| US6389400(B1) | 2002-05-01 | Bushey et al. | Applicant |
| US6400804(B1) | 2002-06-01 | Bilder | Applicant |
| US6400996(B1) | 2002-06-01 | Hoffberg et al. | Applicant |
| US6405159(B2) | 2002-06-01 | Bushey et al. | Applicant |
| US6411687(B1) | 2002-06-01 | Bohacek et al. | Applicant |
| US6414966(B1) | 2002-07-01 | Kulkarni et al. | Applicant |
| US6418424(B1) | 2002-07-01 | Hoffberg et al. | Applicant |
| US6421433(B1) | 2002-07-01 | Arsenault | Applicant |
| US6434546(B1) | 2002-08-01 | Williamowski et al. | Applicant |
| US6442247(B1) | 2002-08-01 | Garcia | Applicant |
| US6510414(B1) | 2003-01-01 | Chaves | Applicant |
| US6519562(B1) | 2003-02-01 | Phillips et al. | Applicant |
| US6526126(B1) | 2003-02-01 | Morganstein et al. | Applicant |
| US6529871(B1) | 2003-03-01 | Kanevsky et al. | Applicant |
| US6546087(B2) | 2003-04-01 | Shaffer et al. | Applicant |
| US6553112(B2) | 2003-04-01 | Ishikawa | Applicant |
| US6553113(B1) | 2003-04-01 | Dhir et al. | Applicant |
| US6570967(B2) | 2003-05-01 | Katz | Applicant |
| US6571240(B1) | 2003-05-01 | Ho et al. | Applicant |
| US6574599(B1) | 2003-06-01 | Lim et al. | Applicant |
| US6584180(B2) | 2003-06-01 | Nemoto | Applicant |
| US6584191(B1) | 2003-06-01 | McPartlan et al. | Applicant |
| US6587556(B1) | 2003-07-01 | Judkins et al. | Applicant |
| US6598021(B1) | 2003-07-01 | Shambaugh et al. | Applicant |
| US6598136(B1) | 2003-07-01 | Norrod et al. | Applicant |
| US6600736(B1) | 2003-07-01 | Ball et al. | Applicant |
| US6603854(B1) | 2003-08-01 | Judkins et al. | Applicant |
| US6614781(B1) | 2003-09-01 | Elliott et al. | Applicant |
| US6615248(B1) | 2003-09-01 | Smith | Applicant |
| US6631186(B1) | 2003-10-01 | Adams et al. | Applicant |
| US6662163(B1) | 2003-12-01 | Albayrak et al. | Applicant |
| US6678360(B1) | 2004-01-01 | Katz | Applicant |
| US6678718(B1) | 2004-01-01 | Khouri et al. | Applicant |
| US6690788(B1) | 2004-02-01 | Bauer et al. | Applicant |
| US6694012(B1) | 2004-02-01 | Posthuma | Applicant |
| US6697460(B2) | 2004-02-01 | Knott et al. | Applicant |
| US6700972(B1) | 2004-03-01 | McHugh et al. | Applicant |
| US6704404(B1) | 2004-03-01 | Burnett | Applicant |
| US6707789(B1) | 2004-03-01 | Arslan et al. | Applicant |
| US6714631(B1) | 2004-03-01 | Martin et al. | Applicant |
| US6714643(B1) | 2004-03-01 | Gargeya et al. | Applicant |
| US6721416(B1) | 2004-04-01 | Farrell | Applicant |
| US6731722(B2) | 2004-05-01 | Coffey | Applicant |
| US6738082(B1) | 2004-05-01 | Dong et al. | Applicant |
| US6738473(B1) | 2004-05-01 | Burg et al. | Applicant |
| US6744861(B1) | 2004-06-01 | Pershan et al. | Applicant |
| US6744877(B1) | 2004-06-01 | Edwards | Applicant |
| US6751306(B2) | 2004-06-01 | Himmel et al. | Applicant |
| US6757306(B1) | 2004-06-01 | Klish, II et al. | Applicant |
| US6766320(B1) | 2004-07-01 | Wang et al. | Applicant |
| US6775359(B1) | 2004-08-01 | Ron et al. | Applicant |
| US6778643(B1) | 2004-08-01 | Bushey et al. | Applicant |
| US6792096(B2) | 2004-09-01 | Martin et al. | Applicant |
| US6807274(B2) | 2004-10-01 | Joseph et al. | Applicant |
| US6823307(B1) | 2004-11-01 | Steinbiss et al. | Applicant |
| US6831932(B1) | 2004-12-01 | Boyle et al. | Applicant |
| US6832224(B2) | 2004-12-01 | Gilmour | Applicant |
| US6842504(B2) | 2005-01-01 | Mills et al. | Applicant |
| US6847711(B2) | 2005-01-01 | Knott et al. | Applicant |
| US6853722(B2) | 2005-02-01 | Joseph et al. | Applicant |
| US6853966(B2) | 2005-02-01 | Bushey et al. | Applicant |
| US6859529(B2) | 2005-02-01 | Duncan et al. | Applicant |
| US6871212(B2) | 2005-03-01 | Khouri et al. | Applicant |
| US6879683(B1) | 2005-04-01 | Fain et al. | Applicant |
| US6885734(B1) | 2005-04-01 | Eberle et al. | Applicant |
| US6891932(B2) | 2005-05-01 | Bhargava et al. | Applicant |
| US6895083(B1) | 2005-05-01 | Bers et al. | Applicant |
| US6901366(B1) | 2005-05-01 | Kuhn et al. | Applicant |
| US6907119(B2) | 2005-06-01 | Case et al. | Applicant |
| US6915246(B2) | 2005-07-01 | Gusler et al. | Applicant |
| US6922689(B2) | 2005-07-01 | Shtivelman | Applicant |
| US6925155(B2) | 2005-08-01 | Reynolds et al. | Applicant |
| US6944592(B1) | 2005-09-01 | Pickering | Examiner |
| US6963983(B2) | 2005-11-01 | Munson et al. | Applicant |
| US6964023(B2) | 2005-11-01 | Maes et al. | Applicant |
| US6970554(B1) | 2005-11-01 | Peterson et al. | Applicant |
| US7003079(B1) | 2006-02-01 | McCarthy et al. | Applicant |
| US7006605(B1) | 2006-02-01 | Morganstein et al. | Applicant |
| US7027975(B1) | 2006-04-01 | Pazandak et al. | Applicant |
| US7031444(B2) | 2006-04-01 | Shen et al. | Applicant |
| US7035388(B2) | 2006-04-01 | Kurosaki | Applicant |
| US7039166(B1) | 2006-05-01 | Peterson et al. | Applicant |
| US7062505(B2) | 2006-06-01 | Lane et al. | Applicant |
| US7072457(B2) | 2006-07-01 | Brown et al. | Applicant |
| US7106850(B2) | 2006-09-01 | Campbell et al. | Applicant |
| US7142652(B2) | 2006-11-01 | Ho | Applicant |
| US7177792(B2) | 2007-02-01 | Knight et al. | Applicant |
| US7200614(B2) | 2007-04-01 | Reid et al. | Applicant |
| US2001/0011211(A1) | 2001-08-01 | Bushey et al. | Applicant |
| US2001/0018672(A1) | 2001-08-01 | Petters et al. | Applicant |
| US2001/0032211(A1) | 2001-10-01 | Kuzumaki | Applicant |
| US2001/0032229(A1) | 2001-10-01 | Hulls et al. | Applicant |
| US2001/0034662(A1) | 2001-10-01 | Morris | Applicant |
| US2002/0046030(A1) | 2002-04-01 | Haritsa et al. | Applicant |
| US2002/0049874(A1) | 2002-04-01 | Kimura | Applicant |
| US2002/0059169(A1) | 2002-05-01 | Quarterman et al. | Applicant |
| US2002/0067714(A1) | 2002-06-01 | Crain et al. | Applicant |
| US2002/0087385(A1) | 2002-07-01 | Vincent | Applicant |
| US2002/0133394(A1) | 2002-09-01 | Bushey et al. | Applicant |
| US2002/0133413(A1) | 2002-09-01 | Chang et al. | Applicant |
| US2002/0156699(A1) | 2002-10-01 | Gray et al. | Applicant |
| US2002/0165732(A1) | 2002-11-01 | Ezzeddine et al. | Applicant |
| US2002/0196277(A1) | 2002-12-01 | Bushey et al. | Applicant |
| US2003/0018659(A1) | 2003-01-01 | Fuks et al. | Applicant |
| US2003/0026409(A1) | 2003-02-01 | Bushey et al. | Applicant |
| US2003/0035381(A1) | 2003-02-01 | Chen et al. | Applicant |
| US2003/0069937(A1) | 2003-04-01 | Khouri et al. | Applicant |
| US2003/0125945(A1) | 2003-07-01 | Doyle | Examiner |
| US2003/0143981(A1) | 2003-07-01 | Kortum et al. | Applicant |
| US2003/0144919(A1) | 2003-07-01 | Trompette et al. | Applicant |
| US2003/0156133(A1) | 2003-08-01 | Martin et al. | Applicant |
| US2003/0187732(A1) | 2003-10-01 | Seta | Applicant |
| US2003/0187773(A1) | 2003-10-01 | Santos et al. | Applicant |
| US2003/0194063(A1) | 2003-10-01 | Martin et al. | Applicant |
| US2003/0202640(A1) | 2003-10-01 | Knott et al. | Applicant |
| US2003/0202643(A1) | 2003-10-01 | Joseph et al. | Applicant |
| US2003/0202649(A1) | 2003-10-01 | Haug, Jr. et al. | Applicant |
| US2003/0204435(A1) | 2003-10-01 | McQuilkin et al. | Applicant |
| US2003/0235282(A1) | 2003-12-01 | Sichelman et al. | Applicant |
| US2004/0005047(A1) | 2004-01-01 | Joseph et al. | Applicant |
| US2004/0006473(A1) | 2004-01-01 | Mills et al. | Applicant |
| US2004/0032862(A1) | 2004-02-01 | Schoeneberger et al. | Applicant |
| US2004/0032935(A1) | 2004-02-01 | Mills et al. | Applicant |
| US2004/0042592(A1) | 2004-03-01 | Knott et al. | Applicant |
| US2004/0044950(A1) | 2004-03-01 | Mills et al. | Applicant |
| US2004/0066401(A1) | 2004-04-01 | Bushey et al. | Applicant |
| US2004/0066416(A1) | 2004-04-01 | Knott et al. | Applicant |
| US2004/0073569(A1) | 2004-04-01 | Knott et al. | Applicant |
| US2004/0088285(A1) | 2004-05-01 | Martin et al. | Applicant |
| US2004/0103017(A1) | 2004-05-01 | Reed et al. | Applicant |
| US2004/0109555(A1) | 2004-06-01 | Williams | Applicant |
| US2004/0125937(A1) | 2004-07-01 | Turcan et al. | Applicant |
| US2004/0125938(A1) | 2004-07-01 | Turcan et al. | Applicant |
| US2004/0125940(A1) | 2004-07-01 | Turcan et al. | Applicant |
| US2004/0161078(A1) | 2004-08-01 | Knott et al. | Applicant |
| US2004/0161094(A1) | 2004-08-01 | Martin et al. | Applicant |
| US2004/0161096(A1) | 2004-08-01 | Knott et al. | Applicant |
| US2004/0174980(A1) | 2004-09-01 | Knott et al. | Applicant |
| US2004/0230438(A1) | 2004-11-01 | Pasquale et al. | Applicant |
| US2004/0240635(A1) | 2004-12-01 | Bushey et al. | Applicant |
| US2004/0243568(A1) | 2004-12-01 | Wang et al. | Applicant |
| US2005/0008141(A1) | 2005-01-01 | Kortum et al. | Applicant |
| US2005/0015197(A1) | 2005-01-01 | Ohtsuji et al. | Applicant |
| US2005/0015744(A1) | 2005-01-01 | Bushey et al. | Applicant |
| US2005/0027535(A1) | 2005-02-01 | Martin et al. | Applicant |
| US2005/0041796(A1) | 2005-02-01 | Joseph et al. | Applicant |
| US2005/0047578(A1) | 2005-03-01 | Knott et al. | Applicant |
| US2005/0055216(A1) | 2005-03-01 | Bushey et al. | Applicant |
| US2005/0058264(A1) | 2005-03-01 | Joseph et al. | Applicant |
| US2005/0075894(A1) | 2005-04-01 | Bushey et al. | Applicant |
| US2005/0078805(A1) | 2005-04-01 | Mills et al. | Applicant |
| US2005/0080630(A1) | 2005-04-01 | Mills et al. | Applicant |
| US2005/0080667(A1) | 2005-04-01 | Knott et al. | Applicant |
| US2005/0131892(A1) | 2005-06-01 | Knott et al. | Applicant |
| US2005/0132262(A1) | 2005-06-01 | Bushey et al. | Applicant |
| US2005/0135595(A1) | 2005-06-01 | Bushey et al. | Applicant |
| US2005/0147218(A1) | 2005-07-01 | Novack et al. | Applicant |
| US2005/0169453(A1) | 2005-08-01 | Knott et al. | Applicant |
| EP424015(A2) | 1991-04-01 | Applicant | |
| EP424015(A3) | 1991-04-01 | Applicant | |
| EP424015(B1) | 1991-04-01 | Applicant | |
| EP876652(A4) | 1996-09-01 | Applicant | |
| WO97/26612 | 1997-07-01 | Applicant | |
| WO1/37539(A2) | 2001-05-01 | Applicant | |
| WO1/37539(A3) | 2001-05-01 | Applicant | |
| WO2004/017584 | 2004-02-01 | Applicant | |
| WO2004/049222(A2) | 2004-06-01 | Applicant |
Non-Patent Literature (26)
- U.S. Appl. No. 10/898,722, filed Jul. 23, 2004.Applicant
- U.S. Appl. No. 10/901,926, filed Jul. 28, 2004.Applicant
- U.S. Appl. No. 10/901,925, filed Jul. 28, 2004.Applicant
- U.S. Appl. No. 10/917,233, filed Aug. 12, 2004.Applicant
- U.S. Appl. No. 10/935,726, filed Sep. 7, 2004.Applicant
- U.S. Appl. No. 10/999,199, filed Nov. 29, 2004.Applicant
- U.S. Appl. No. 11/005,498, filed Dec. 6, 2004.Applicant
- U.S. Appl. No. 11/005,494, filed Dec. 6, 2004.Applicant
- U.S. Appl. No. 11/010,633, filed Dec. 13, 2004.Applicant
- U.S. Appl. No. 11/032,495, filed Jan. 10, 2005.Applicant
- U.S. Appl. No. 10/975,023, filed Oct. 27, 2004.Applicant
- U.S. Appl. No. 11/036,201, filed Jan. 14, 2005.Applicant
- U.S. Appl. No. 11/062,100, filed Feb. 18, 2005.Applicant
- U.S. Appl. No. 11/071,068, filed Mar. 3, 2005.Applicant
- U.S. Appl. No. 11/086,796, filed Mar. 23, 2005.Applicant
- U.S. Appl. No. 11/129,051, filed May 13, 2005.Applicant
- U.S. Appl. No. 11/145,513, filed Jun. 3, 2005.Applicant
- U.S. Appl. No. 11/173,227, filed Jul. 1, 2005.Applicant
- U.S. Appl. No. 11/176,972, filed Jul. 7, 2005.Applicant
- U.S. Appl. No. 11/086,794, filed Mar. 22, 2005.Applicant
- U.S. Appl. No. 10/996,127, filed Nov. 23, 2004.Applicant
- U.S. Appl. No. 10/920,719, filed Dec. 13, 2004.Applicant
- U.S. Appl. No. 10/920,720, filed Aug. 18, 2004.Applicant
- U.S. Appl. No. 10/948,089, filed Sep. 23, 2004.Applicant
- U.S. Appl. No. 10/979,784, filed Nov. 2, 2004.Applicant
- U.S. Appl. No. 11/212,939, filed Aug. 25, 2005.Applicant