System and method for processing speech

Information

  • Patent Grant
  • 8306192
  • Patent Number
    8,306,192
  • Date Filed
    Wednesday, March 31, 2010
    14 years ago
  • Date Issued
    Tuesday, November 6, 2012
    11 years ago
Abstract
Systems and methods for processing speech are provided. A system may include a speech recognition interface and a processor. The processor may convert speech received from a call at the speech recognition interface to at least one word string. The processor may parse each word string of the at least one word string into first objects and first actions. The processor may access a synonym table to determine second objects and second actions based on the first objects and the first actions. The processor may also select a preferred object and a preferred action from the second objects and the second actions.
Description
FIELD OF THE DISCLOSURE

The present disclosure relates generally to speech recognition and, more particularly, to speech recognition-enabled automatic call routing service systems and methods.


BACKGROUND

Speech recognition systems are specialized computers that are configured to process and recognize human speech and may also take action or carry out further processes. Developments in speech recognition technologies support “natural language” type interactions between automated systems and users. A natural language interaction allows a person to speak naturally. Voice recognition systems can react responsively to a spoken request. An application of natural language processing is speech recognition with automatic call routing (ACR). A goal of an ACR application is to determine why a customer is calling a service center and to route the customer to an appropriate agent or destination for servicing a customer request. Speech recognition technology generally allows an ACR application to recognize natural language statements so that the caller does not have to rely on a menu system. Natural language systems allow the customer to state the purpose of their call “in their own words.”


In order for an ACR application to properly route calls, the ACR system attempts to interpret the intent of the customer and selects a routing destination. When a speech recognition system partially understands or misunderstands the caller's intent, significant problems can result. Further, even in touch-tone ACR systems, the caller can depress the wrong button and have a call routed to a wrong location. When a caller is routed to an undesired system and realizes that there is a mistake, the caller often hangs up and retries the call. Another common problem occurs when a caller gets “caught” or “trapped” in a menu that does not provide an acceptable selection to exit the menu. Trapping a caller or routing the caller to an undesired location leads to abandoned calls. Most call routing systems handle a huge volume of calls and, even if a small percentage of calls are abandoned, the costs associated with abandoned calls are significant.


Current speech recognition systems, such as those sold by Speechworks™, operate utilizing a dynamic semantic model. The semantic model recognizes human speech and creates multiple word strings based on phonemes that the semantic model can recognize. The semantic model assigns probabilities to each of the word strings using rules and other criteria. However, the semantic model has extensive tables and business rules, many that are “learned” by the speech recognition system. The learning portion of the system is difficult to set up and modify. Further, changing the word string tables in the semantic model can be an inefficient process. For example, when a call center moves or is assigned a different area code, the semantic system is retrained using an iterative process.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a simplified configuration of a telecommunication system;



FIG. 2 is a general diagram that illustrates a method of routing calls;



FIG. 3 is a flow diagram that illustrates a method of processing and routing calls;



FIG. 4 is a table that depicts speech input and mapped synonym terms; and



FIG. 5 is a table illustrating action-object pairs and call destinations relating to the action object pairs.





DETAILED DESCRIPTION

In a particular embodiment, a speech recognition system includes a speech recognition interface and a processor coupled to the speech recognition interface. The processor converts speech received from a call at the speech recognition interface to at least one word string. The processor parses each word string of the at least one word string into first objects and first actions. The processor accesses a synonym table to determine second objects and second actions based on the first objects and the first actions. The processor also selects a preferred object and a preferred action from the second objects and the second actions.


In a particular embodiment, a computerized method of processing speech includes determining a plurality of objects based on speech input and determining a plurality of actions based on the speech input. The computerized method includes comparing the objects and the actions with entries in a synonym table to determine synonym objects and synonym actions. The computerized method includes selecting a preferred object and a preferred action from the synonym objects and the synonym actions. The computerized method also includes routing a call that provided the speech input to a destination based on the preferred object and the preferred action.


In a particular embodiment, a computerized method includes transforming speech input from a caller into a plurality of word strings. The computerized method includes converting the word strings into pairs of objects and actions. The computerized method includes determining from a synonym table synonym pairs from the pairs. The computerized method also includes selecting a preferred pair from the synonym pairs.


Particular systems and particular methods are disclosed for processing a call by receiving caller input in a speech format and utilizing phonemes to convert the speech input into word strings. The word strings are then converted into at least one object and at least one action. A synonym table is utilized to determine actions and objects. Objects generally represent nouns and adjective-noun combinations while actions generally represent verbs and adverb-verb combinations. The synonym table stores natural language phrases and their relationship with actions and objects. The actions and objects are utilized to determine a routing destination utilizing a routing table. The call is then routed based on the routing table. During the process, the word string, the actions, the objects and an action-object pair can be assigned a probability value. The probability value represents a probability that the word string, the action, or the object accurately represent the purpose or intent of the caller.


Referring to FIG. 1, an illustrated communications system 100 that includes a call routing support system is shown. The communications system 100 includes a speech enabled call routing system (SECRS) 118, such as an interactive voice response system having a speech recognition module. The system 100 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. The communication network 116 receives calls from a variety of callers, such as the illustrated callers 110, 112, and 114. In a particular embodiment, the communication network 116 may be a public telephone network or may be provided by a voice over Internet protocol (VoIP) type network. The SECRS 118 may include components, such as a processor 142, a synonym table 144, and an action-object routing module 140. The SECRS 118 is coupled to and may route calls to any of the destinations, as shown. In addition, the SECRS 118 may route calls to an agent, such as the illustrated live operator 130. An illustrative embodiment of the SECRS 118 may be a call center having a plurality of agent terminals attached (not shown). Thus, while only a single operator 130 is shown, it should be understood that a plurality of different agent terminals or types of terminals may be coupled to the SECRS 118, such that a variety of agents may service incoming calls. In addition, the SECRS 118 may be an automated call routing system. In a particular embodiment, the action-object routing module 140 includes an action-object lookup table for matching action-object pairs to desired call routing destinations.


Referring to FIG. 2, an illustrative embodiment of an action-object routing module 140 is shown. In this particular embodiment, the action-object routing module 140 includes an acoustic processing model 210, semantic processing model 220, and action-object routing table 230. The acoustic model 210 receives speech input 202 and provides text 204 as its output. Semantic model 220 receives text 204 from the acoustic model 210 and produces an action-object pair 206 that is provided to the action-object routing table 230. The routing table 230 receives action-object pairs 206 from semantic model 220 and produces a desired call routing destination 208. Based on the call routing destination 208, a call received at a call routing network 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 Microsoft Excel™.


Referring to FIG. 3, an illustrative embodiment of a method of processing a call using an automated call routing system 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, the received speech input is 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 are assigned to word strings based on established rules and the coherency of the word string. Next, at step 308, the word strings are 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 the probability value of the word string used to create the selected action and the selected object.


Many possible actions and objects may be detected or created from the word strings. The method attempts 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 can be utilized to convert detected actions and objects into preferred actions and objects. Thus, detected objects and actions are converted to preferred actions and objects and assigned a confidence level. The process of utilizing the synonym table can alter the confidence level. The synonym table stores natural language phrases and their relationship with a set of actions and objects. Natural language spoken by the caller can be compared to the natural language phrases in the table. Using the synonym table, the system and method maps portions of the natural phrases to detected objects and maps portions of the natural spoken phrase to detected actions. Thus, the word strings are converted into objects and actions, at steps 310 and 312 respectively and the selected action and object are set to the action and object that will be utilized to route the call. The action and object with the highest confidence value are selected based on many criteria such as confidence value, business rules, etc., in steps 310 and 312.


At step 310 and 312, multiple actions and objects can be detected and provided with a probability value 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 and a dominant action and dominant object are determined. Next, at step 314, dominant objects and actions are paired together. At step 316, a paired action-object is compared to an action-object routing table, such as the action object routing table of FIG. 5. The action-object routing table in FIG. 5 is generally a predetermined list. When objects and actions find a match, then the destination of the call can be selected at step 318, and the call is routed, at step 320. The process ends at step 322.


Referring to FIG. 4, as an example, it is beneficial to convert word strings such as “I want to have” to actions such as “get.” This substantially reduces the size of the routing table. When a call destination has a phone number change, a single entry in the routing table may accommodate the change. Prior systems may require locating numerous entries in a voluminous database, or retraining a sophisticated system. In accordance with the present system, dozens of differently expressed or “differently spoken” inputs that have the same caller intent can be converted to a single detected action-object pair. Further, improper and informal sentences as well as slang can be connected to an action-object pair that may not bear phonetic resemblance to the words uttered by the caller. With a directly mapped lookup table such as the table in FIG. 4, speech training and learning behaviors found in conventional call routing systems are not required. The lookup table may be updated easily, leading to a low cost of system maintenance.


In addition, the method may include using a set of rules to convert a word string into an object or action. In a particular example, geographic designation information, such as an area code, may be used to distinguish between two potential selections or to modify the probability value. In the event that the lookup table of the action-object pair does not provide a suitable response, such as where no entry is found in the routing table, the call may be routed to a human operator or agent terminal in response to a failed access to the action-object lookup table.


Traditional automatic call routing systems are able to assign a correct destination 50-80% of the time. Particular embodiments of the disclosed system and method using action-object tables can assign a correct destination 85-95% of the time. Due to higher effective call placement rates, the number of abandoned calls (i.e., caller hang-ups prior to completing their task) is significantly reduced, thereby reducing operating costs and enhancing customer satisfaction. In addition, the automated call-routing system offers a speech recognition interface that is preferred by many customers to touch tone systems.


The disclosed system and method offers significant improvements through decreased reliance on the conventional iterative semantic model training process. With the disclosed system, a semantic model assigns an action-object pair leading to increased call routing accuracy and reduced costs. In particular implementations, the correct call destination routing rate may reach the theoretical limit of 100%, depending upon particular circumstances. In some cases, certain action-object systems have been implemented that achieve a 100% coverage rate, hit rate, and call destination accuracy rate.


The disclosed system and method is directed generally to integration of action-object technology with speech enabled automated call routing technology. The integration of these two technologies produces a beneficial combination as illustrated. The illustrated system has been described in connection with a call center environment, but it should be understood that the disclosed system and method is applicable to other user interface modalities, such as web-based interfaces, touchtone interfaces, and other speech recognition type systems. The disclosed system and method provides for enhanced customer satisfaction because the customer's intent can be recognized by an action-object pair and a high percentage of calls reach the intended destination.


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 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
  • 1. A speech recognition system, comprising: a speech recognition interface; anda processor coupled to the speech recognition interface to: convert speech received from a caller at the speech recognition interface to at least one word string;parse each word string of the at least one word string into first objects and first actions;access a synonym table to determine second objects and second actions based on the first objects and the first actions; andselect a preferred object and a preferred action from the second objects and the second actions.
  • 2. The speech recognition system of claim 1, wherein the processor is configured to route the caller to a destination based on the preferred action and the preferred object.
  • 3. The speech recognition system of claim 2, wherein the destination is determined from an action-object routing table based on the preferred action and the preferred object.
  • 4. The speech recognition system of claim 1, wherein the processor converts the speech received from the caller at the speech recognition interface to the at least one word string based on phonemes.
  • 5. The speech recognition system of claim 1, wherein the processor is configured to assign a probability value to each word string of the at least one word string based at least in part on a coherency of the word string.
  • 6. The speech recognition system of claim 5, wherein the processor creates first action-object pairs from the first actions and the first objects of each word string of the at least one word string, wherein the processor is configured to assign a confidence value to each first action-object pair, and wherein the confidence value for a particular first action-object pair is based at least in part on the probability value of the word string used to create the particular first action-object pair.
  • 7. The speech recognition system of claim 6, wherein the processor creates a second action-object pair from each first action-object pair when the processor accesses the synonym table to determine the second objects and the second actions, wherein the processor is configured to assign a confidence level to each second action-object pair, wherein a particular confidence level for a particular second action-object pair is based at least in part on the confidence value of the first action-object pair used to obtain the particular second action-object pair.
  • 8. The speech recognition system of claim 7, wherein the preferred object and the preferred action are selected from the second action-object pairs based at least in part on the preferred object and the preferred action having a high confidence level compared to other second action-object pairs.
  • 9. The speech recognition system of claim 1, wherein the first objects correspond in part to nouns in the at least one word string.
  • 10. The speech recognition system of claim 1, wherein the first actions correspond in part to verbs in the at least one word string.
  • 11. A computerized method of processing speech, the method comprising: determining a plurality of objects based on speech input;determining a plurality of actions based on the speech input;comparing the plurality of objects and the plurality of actions with entries in a synonym table to determine synonym objects and synonym actions;selecting a preferred object and a preferred action from the synonym objects and the synonym actions; androuting a call that provided the speech input to a destination based on the preferred object and the preferred action.
  • 12. The computerized method of claim 11, wherein determining the plurality of objects and the plurality of actions comprises: converting the speech input to word strings based on the speech input; andparsing the word strings into the plurality of objects and the plurality of actions.
  • 13. The computerized method of claim 11, wherein the preferred object and the preferred action are selected at least in part based on confidence levels of the synonym objects and the synonym actions.
  • 14. The computerized method of claim 11, wherein the destination comprises one of a billing department, a balance information service, a new services department, and a technical support department.
  • 15. The computerized method of claim 11, wherein the preferred object is not phonetically related to content of the speech input.
  • 16. The computerized method of claim 11, wherein a particular object determined based on the speech input comprises a natural language phrase and the preferred object associated with the particular object comprises a term related to the natural language phrase.
  • 17. The computerized method of claim 11, wherein a particular action determined based on the speech input comprises a natural language phrase and the preferred action associated with the particular action comprises a term related to the natural language phrase.
  • 18. A computerized method, comprising: transforming speech input from a call into a plurality of word strings;converting the word strings into pairs of objects and actions;determining, from a synonym table, synonym pairs based on the pairs of objects and actions;selecting a preferred pair from the synonym pairs; anddetermining a destination for the call based on an object and an action of the referred pair.
  • 19. The computerized method of claim 18, wherein selecting the preferred pair comprises choosing a synonym pair based at least in part on a confidence value of the synonym pair.
  • 20. The computerized method of claim 11, wherein the preferred object is phonetically unrelated to content of the speech input.
CLAIM OF PRIORITY

This application is a Continuation Patent Application of, and claims priority from, U.S. patent application Ser. No. 11/809,817, filed on Jun. 1, 2007, and entitled “SYSTEM AND METHOD FOR PROCESSING SPEECH,” which is a continuation of U.S. Pat. No. 7,242,751, filed on Dec. 6, 2004, each of which is hereby incorporated by reference in its entirety.

US Referenced Citations (248)
Number Name Date Kind
4953204 Cuschleg, Jr. et al. Aug 1990 A
4967405 Upp et al. Oct 1990 A
5335269 Steinlicht Aug 1994 A
5455903 Jolissaint et al. Oct 1995 A
5497373 Hulen et al. Mar 1996 A
5522046 McMillen et al. May 1996 A
5530744 Charalambous et al. Jun 1996 A
5555299 Maloney et al. Sep 1996 A
5590186 Liao et al. Dec 1996 A
5630121 Braden-Harder et al. May 1997 A
5652789 Miner et al. Jul 1997 A
5737723 Riley et al. Apr 1998 A
5754639 Flockhart et al. May 1998 A
5754978 Perez-Mendez et al. May 1998 A
5797723 Frost et al. Aug 1998 A
5809269 Favot et al. Sep 1998 A
5923745 Hurd Jul 1999 A
5940476 Morganstein et al. Aug 1999 A
5946388 Walker et al. Aug 1999 A
5953704 McIlroy et al. Sep 1999 A
5960384 Brash Sep 1999 A
5999965 Kelly Dec 1999 A
6002689 Christie et al. Dec 1999 A
6002760 Gisby Dec 1999 A
6003011 Sarin et al. Dec 1999 A
6049594 Furman et al. Apr 2000 A
6100885 Donnelly et al. Aug 2000 A
6118866 Shtivelmann Sep 2000 A
6119101 Peckover Sep 2000 A
6173266 Marx et al. Jan 2001 B1
6173289 Sonderegger et al. Jan 2001 B1
6173399 Gilbrech Jan 2001 B1
6175621 Begeja Jan 2001 B1
6233546 Datig May 2001 B1
6259786 Gisby Jul 2001 B1
6269153 Carpenter et al. Jul 2001 B1
6317439 Cardona et al. Nov 2001 B1
6333980 Hollatz et al. Dec 2001 B1
6353608 Cullers et al. Mar 2002 B1
6366658 Bjornberg et al. Apr 2002 B1
6366668 Borst et al. Apr 2002 B1
6381329 Uppaluru et al. Apr 2002 B1
6385584 McAllister et al. May 2002 B1
6389400 Bushey et al. May 2002 B1
6400804 Bilder Jun 2002 B1
6400996 Hoffberg et al. Jun 2002 B1
6405159 Bushey et al. Jun 2002 B2
6414966 Kulkarni et al. Jul 2002 B1
6418424 Hoffberg et al. Jul 2002 B1
6442247 Garcia Aug 2002 B1
6510414 Chaves Jan 2003 B1
6513010 Lewin et al. Jan 2003 B1
6519562 Phillips et al. Feb 2003 B1
6529871 Kanevsky et al. Mar 2003 B1
6532444 Weber Mar 2003 B1
6538666 Ozawa et al. Mar 2003 B1
6553113 Dhir et al. Apr 2003 B1
6570967 Katz May 2003 B2
6574599 Lim et al. Jun 2003 B1
6584180 Nemoto Jun 2003 B2
6587556 Judkins et al. Jul 2003 B1
6598136 Norrod et al. Jul 2003 B1
6600736 Ball et al. Jul 2003 B1
6603854 Judkins et al. Aug 2003 B1
6614781 Elliott et al. Sep 2003 B1
6631186 Adams et al. Oct 2003 B1
6662163 Albayradk et al. Dec 2003 B1
6678360 Katz Jan 2004 B1
6678718 Khouri et al. Jan 2004 B1
6690788 Bauer et al. Feb 2004 B1
6694012 Posthuma Feb 2004 B1
6694482 Arellano et al. Feb 2004 B1
6697460 Knott et al. Feb 2004 B2
6700972 McHugh et al. Mar 2004 B1
6704404 Burnett Mar 2004 B1
6707789 Arlsan et al. Mar 2004 B1
6714631 Martin et al. Mar 2004 B1
6721416 Farrell Apr 2004 B1
6731722 Coffey May 2004 B2
6738473 Burg et al. May 2004 B1
6744861 Pershan et al. Jun 2004 B1
6744877 Edwards Jun 2004 B1
6751306 Himmel et al. Jun 2004 B2
6757306 Klish, II et al. Jun 2004 B1
6766320 Wang et al. Jul 2004 B1
6775359 Ron et al. Aug 2004 B1
6778643 Bushey et al. Aug 2004 B1
6792096 Martin et al. Sep 2004 B2
6795806 Lewis et al. Sep 2004 B1
6807274 Joseph et al. Oct 2004 B2
6823307 Steinbiss et al. Nov 2004 B1
6831932 Boyle et al. Dec 2004 B1
6832224 Gilmour Dec 2004 B2
6836760 Silverman et al. Dec 2004 B1
6842504 Mills et al. Jan 2005 B2
6847711 Knott et al. Jan 2005 B2
6853722 Joseph et al. Feb 2005 B2
6853966 Bushey et al. Feb 2005 B2
6859529 Duncan et al. Feb 2005 B2
6871212 Khouri et al. Mar 2005 B2
6879683 Fain et al. Apr 2005 B1
6885734 Eberle et al. Apr 2005 B1
6891932 Bhargava et al. May 2005 B2
6895083 Bers et al. May 2005 B1
6901366 Kuhn et al. May 2005 B1
6907119 Case et al. Jun 2005 B2
6915246 Gusler et al. Jul 2005 B2
6944592 Pickering Sep 2005 B1
6963983 Munson et al. Nov 2005 B2
7006605 Morganstein et al. Feb 2006 B1
7024368 Matheson Apr 2006 B1
7031444 Shen et al. Apr 2006 B2
7031908 Huang et al. Apr 2006 B1
7035388 Kurosaki Apr 2006 B2
7043435 Knott et al. May 2006 B2
7127398 Yamagishi et al. Oct 2006 B1
7231343 Treadgold et al. Jun 2007 B1
7242751 Bushey et al. Jul 2007 B2
7370086 Kroeker et al. May 2008 B2
7379876 Nakata May 2008 B2
7450698 Bushey Nov 2008 B2
20010011211 Bushey et al. Aug 2001 A1
20010018672 Petters et al. Aug 2001 A1
20010021948 Khouri et al. Sep 2001 A1
20010032229 Hulls et al. Oct 2001 A1
20010034662 Morris Oct 2001 A1
20020046030 Haritsa et al. Apr 2002 A1
20020057678 Jiang et al. May 2002 A1
20020059164 Shtivelman May 2002 A1
20020059169 Quarterman et al. May 2002 A1
20020067714 Crain et al. Jun 2002 A1
20020087385 Vincent Jul 2002 A1
20020114432 Shaffer et al. Aug 2002 A1
20020133394 Bushey et al. Sep 2002 A1
20020133413 Chang et al. Sep 2002 A1
20020135618 Maes et al. Sep 2002 A1
20020156699 Gray et al. Oct 2002 A1
20020165732 Ezzeddine et al. Nov 2002 A1
20020178005 Dusan et al. Nov 2002 A1
20020196277 Bushey et al. Dec 2002 A1
20020198714 Zhou Dec 2002 A1
20030026409 Bushey et al. Feb 2003 A1
20030035381 Chen et al. Feb 2003 A1
20030035516 Guedalia Feb 2003 A1
20030069937 Khouri et al. Apr 2003 A1
20030097428 Afkhami et al. May 2003 A1
20030103619 Brown et al. Jun 2003 A1
20030114105 Haller et al. Jun 2003 A1
20030130841 Bangalore et al. Jul 2003 A1
20030130864 Ho et al. Jul 2003 A1
20030143981 Kortum et al. Jul 2003 A1
20030144846 Denenberg et al. Jul 2003 A1
20030144919 Trompette et al. Jul 2003 A1
20030156133 Martin et al. Aug 2003 A1
20030165223 Timmins et al. Sep 2003 A1
20030187632 Menich Oct 2003 A1
20030187732 Seta Oct 2003 A1
20030187773 Santos et al. Oct 2003 A1
20030194063 Martin et al. Oct 2003 A1
20030195753 Homuth et al. Oct 2003 A1
20030202640 Knott et al. Oct 2003 A1
20030202643 Joseph et al. Oct 2003 A1
20030202649 Haug, Jr. et al. Oct 2003 A1
20030204435 McQuilkin et al. Oct 2003 A1
20030235287 Margolis et al. Dec 2003 A1
20040005047 Joseph et al. Jan 2004 A1
20040006473 Mills et al. Jan 2004 A1
20040032862 Schoeneberger et al. Feb 2004 A1
20040032935 Mills et al. Feb 2004 A1
20040042592 Knott et al. Mar 2004 A1
20040044950 Mills et al. Mar 2004 A1
20040066401 Bushey et al. Apr 2004 A1
20040066416 Knott et al. Apr 2004 A1
20040073569 Knott et al. Apr 2004 A1
20040083479 Bondarenko et al. Apr 2004 A1
20040088285 Martin et al. May 2004 A1
20040103017 Reed et al. May 2004 A1
20040109555 Williams Jun 2004 A1
20040111479 Borden et al. Jun 2004 A1
20040120473 Birch et al. Jun 2004 A1
20040125937 Turcan et al. Jul 2004 A1
20040125938 Turcan et al. Jul 2004 A1
20040125940 Turcan et al. Jul 2004 A1
20040128624 Arellano et al. Jul 2004 A1
20040161078 Knott et al. Aug 2004 A1
20040161094 Martin et al. Aug 2004 A1
20040161096 Knott et al. Aug 2004 A1
20040174980 Knott et al. Sep 2004 A1
20040199394 Kuzunuki et al. Oct 2004 A1
20040230438 Pasquale et al. Nov 2004 A1
20040240635 Bushey et al. Dec 2004 A1
20040243568 Wang et al. Dec 2004 A1
20050008141 Kortum et al. Jan 2005 A1
20050015197 Ohtsuji et al. Jan 2005 A1
20050015744 Bushey et al. Jan 2005 A1
20050018825 Ho et al. Jan 2005 A1
20050027535 Martin et al. Feb 2005 A1
20050041796 Joseph et al. Feb 2005 A1
20050047578 Knott et al. Mar 2005 A1
20050055216 Bushey et al. Mar 2005 A1
20050058264 Joseph et al. Mar 2005 A1
20050075894 Bushey et al. Apr 2005 A1
20050078805 Mills et al. Apr 2005 A1
20050080630 Mills et al. Apr 2005 A1
20050080667 Knott et al. Apr 2005 A1
20050102141 Chikuri May 2005 A1
20050131892 Knott et al. Jun 2005 A1
20050132262 Bushey et al. Jun 2005 A1
20050135595 Bushey et al. Jun 2005 A1
20050141692 Scherer et al. Jun 2005 A1
20050147218 Novack et al. Jul 2005 A1
20050169441 Yacoub et al. Aug 2005 A1
20050169453 Knott et al. Aug 2005 A1
20050201547 Burg et al. Sep 2005 A1
20050240411 Yacoub et al. Oct 2005 A1
20050254632 Pasquale et al. Nov 2005 A1
20060018443 Knott Jan 2006 A1
20060023863 Joseph et al. Feb 2006 A1
20060026049 Joseph et al. Feb 2006 A1
20060036437 Bushey Feb 2006 A1
20060039547 Klein Feb 2006 A1
20060050865 Kortum Mar 2006 A1
20060062375 Pasquale Mar 2006 A1
20060072737 Paden et al. Apr 2006 A1
20060093097 Chang May 2006 A1
20060100998 Edwards May 2006 A1
20060109974 Paden May 2006 A1
20060115070 Bushey Jun 2006 A1
20060126808 Dallessandro Jun 2006 A1
20060126811 Bushey Jun 2006 A1
20060153345 Bushey Jul 2006 A1
20060161431 Bushey Jul 2006 A1
20060177040 Mitra et al. Aug 2006 A1
20060188087 Kortum Aug 2006 A1
20060195312 Knight et al. Aug 2006 A1
20060198505 Kortum Sep 2006 A1
20060215831 Knott Sep 2006 A1
20060215833 Mahoney Sep 2006 A1
20060256932 Bushey Nov 2006 A1
20060291642 Bushey Dec 2006 A1
20070019800 Bushey Jan 2007 A1
20070025528 Knott Feb 2007 A1
20070025542 Bushey Feb 2007 A1
20070041551 Whitecotton Feb 2007 A1
20070047718 Idler Mar 2007 A1
20070047720 Brandt Mar 2007 A1
20070116230 Brandt May 2007 A1
20080008308 Knott Jan 2008 A1
Foreign Referenced Citations (9)
Number Date Country
0424015 Apr 1991 EP
0424015 Apr 1991 EP
0424015 Apr 1991 EP
0876652 Sep 1996 EP
9726612 Jul 1997 WO
0137539 May 2001 WO
0137539 May 2001 WO
2004017584 Feb 2004 WO
2004049222 Jun 2004 WO
Related Publications (1)
Number Date Country
20100185443 A1 Jul 2010 US
Continuations (2)
Number Date Country
Parent 11809817 Jun 2007 US
Child 12750792 US
Parent 11005494 Dec 2004 US
Child 11809817 US