Patents by Inventor Taufique Samdani

Taufique Samdani has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • System and method for resolving decoding ambiguity via dialog
    Patent number: 6587818
    Abstract: A method of language recognition wherein decoding ambiguities are identified and at least partially resolved intermediate to the language decoding procedures to reduce the subsequent number of final decoding alternatives. The user is questioned about identified decoding ambiguities as they are being decoded. There are two language decoding levels: fast match and detailed match. During the fast match decoding level a large potential candidate list is generated, very quickly. Then, during the more comprehensive (and slower) detailed match decoding level, the fast match candidate list is applied to the ambiguity to reduce the potential selections for final recognition. During the detailed match decoding level a unique candidate is selected for decoding. Decoding may be interactive and, as each ambiguity is encountered, recognition suspended to present questions to the user that will discriminate between potential response classes.
    Type: Grant
    Filed: October 28, 1999
    Date of Patent: July 1, 2003
    Assignee: International Business Machines Corporation
    Inventors: Dimitri Kanevsky, Taufique Samdani, Wlodek Zadrozny, Alexander Zlatsin
  • SYSTEM AND METHOD FOR RESOLVING DECODING AMBIGUITY VIA DIALOG
    Publication number: 20030004714
    Abstract: A method of language recognition wherein decoding ambiguities are identified and at least partially resolved intermediate to the language decoding procedures to reduce the subsequent number of final decoding alternatives. The user is questioned about identified decoding ambiguities as they are being decoded. There are two language decoding levels: fast match and detailed match. During the fast match decoding level a large potential candidate list is generated, very quickly. Then, during the more comprehensive (and slower) detailed match decoding level, the fast match candidate list is applied to the ambiguity to reduce the potential selections for final recognition. During the detailed match decoding level a unique candidate is selected for decoding. Decoding may be interactive and, as each ambiguity is encountered, recognition suspended to present questions to the user that will discriminate between potential response classes.
    Type: Application
    Filed: October 28, 1999
    Publication date: January 2, 2003
    Inventors: DIMITRI KANEVSKY, TAUFIQUE SAMDANI, WLODEK ZADROZNY, ALEXANDER ZLATSIN