| US 7,603,272 B1 | ||
| System and method of word graph matrix decomposition | ||
| Dilek Z. Hakkani-Tur, Morris Plains, N.J. (US); and Giuseppe Riccardi, Hoboken, N.J. (US) | ||
| Assigned to AT&T Intellectual Property II, L.P., New York, N.Y. (US) | ||
| Filed on Jun. 19, 2007, as Appl. No. 11/765,008. | ||
| Application 11/765008 is a continuation of application No. 10/405535, filed on Apr. 02, 2003, granted, now 7,277,850. | ||
| This patent is subject to a terminal disclaimer. | ||
| Int. Cl. G10L 15/00 (2006.01) | ||
| U.S. Cl. 704—232 [704/243; 704/244; 704/256] | 21 Claims |
| 1. A system for generating a block diagonal matrix from a lattice, the system comprising:
(1) a processor;
(2) a module configured to control the processor to compute posterior probability of all transitions T in a graph, if a lattice
having transitions T is weighted;
(3) a module configured to control the processor to extract a pivot baseline path from the lattice; and
(4) a module configured to control the processor to align the transitions T in the lattice with the transitions in the pivot
baseline path.
|