IP Library Granted Patent US 7,251,599
Granted Patent B2
US 7,251,599 · App. 10/315,411 · Granted Jul 31, 2007

Automatic construction of unique signatures and confusable sets for database access

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,251,599
App. No.
10/315,411
Granted
Jul 31, 2007
Kind
B2
Abstract

Methods and arrangements for facilitating database access in speech recognition. A plurality of possible subsequences corresponding to a database entry are ascertained, a record of such subsequences and their correspondence to database entries is created, and either or both of the following are carried out: unique signatures are ascertained via determining whether a subsequence corresponding to a given database entry does not also correspond to at least one other database entry; and/or multiple occurrences of a given subsequence are found, with corresponding database entries being grouped into a confusion set.

Claims (57)

1. A method of facilitating database access in speech recognition, said method comprising the steps of:

ascertaining a plurality of possible subsequences corresponding to a database entry;

creating a record of subsequences and their correspondence to database entries;

at least one of:

ascertaining unique signatures via determining whether a subsequence corresponding to a given database entry does not also correspond to at least one other database entry; and

finding multiple occurrences of a given subsequence and grouping corresponding database entries into a confusion set; and

at least one of:

returning to a user the database entries corresponding to the ascertained unique signatures; and

returning to a user the database entries in the confusion set.

2. The method according to claim 1 , wherein the subsequences comprise word subsequences.

3. The method according to claim 1 , wherein the database entries correspond to directory listings.

4. The method according to claim 3 , wherein the directory listings correspond to telephone directory listings.

5. The method according to claim 1 , further comprising:

sorting database entries into a predetermined order;

said method comprising said step of performing said step of ascertaining unique signatures;

said step of ascertaining unique signatures comprising determining whether a subsequence corresponding to a given database entry does not also correspond to an adjacent database entry in the predetermined order.

6. The method according to claim 5 , wherein the predetermined order corresponds to a lexicographical order.

7. The method according to claim 1 , further comprising the step of creating a grammar for identifying given database entries.

8. The method according to claim 7 , wherein:

said step of ascertaining unique signatures is performed; and

said method further comprises the step of adding an entry to the grammar corresponding to each unique signature.

9. The method according to claim 7 , wherein:

said step of finding and grouping is performed; and

said method further comprising the step of adding, for each confusion set, an entry to the grammar that recognizes a multiply occurring subsequence and thereupon returns a confusion set value.

10. An apparatus for facilitating database access in speech recognition, said apparatus comprising:

an arrangement for ascertaining a plurality of possible subsequences corresponding to a database entry;

an arrangement for creating a record of such subsequences and their correspondence to database entries; and

at least one of:

an arrangement for ascertaining unique signatures via determining whether a subsequence corresponding to a given database entry does not also correspond to at least one other database entry; and

an arrangement for finding multiple occurrences of a given subsequence and grouping corresponding database entries into a confusion set; and

at least one of:

an arrangement for returning to a user the database entries corresponding to the ascertained unique signatures; and

an arrangement for returning to a user the database entries in the confusion set.

11. The apparatus according to claim 10 , wherein the subsequences comprise word subsequences.

12. The apparatus according to claim 10 , wherein the database entries correspond to directory listings.

13. The apparatus according to claim 12 , wherein the directory listings correspond to telephone directory listings.

14. The apparatus according to claim 10 , further comprising:

an arrangement for sorting database entries into a predetermined order;

said apparatus comprising said arrangement for ascertaining unique signatures;

said arrangement for identifying unique signatures being adapted to determine whether a subsequence corresponding to a given database entry does not also correspond to an adjacent database entry in the predetermined order.

15. The apparatus according to claim 14 , wherein the predetermined order corresponds to a lexicographical order.

16. The apparatus according to claim 10 , further comprising an arrangement for creating a grammar for identifying given database entries.

17. The apparatus according to claim 16 , wherein:

said apparatus comprises said arrangement for ascertaining unique signatures; and

said apparatus further comprises an arrangement for adding an entry to the grammar corresponding to each unique signature.

18. The apparatus according to claim 16 , wherein:

said apparatus comprises said arrangement for finding and grouping; and

an arrangement for adding, for each confusion set, an entry to the grammar that recognizes a multiply occurring subsequence and thereupon returns a confusion set value.

19. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for facilitating database access in speech recognition, said method comprising the steps of:

ascertaining a plurality of possible subsequences corresponding to a database entry;

creating a record of such subsequences and their correspondence to database entries; and

at least one of:

ascertaining unique signatures via determining whether a subsequence corresponding to a given database entry does not also correspond to at least one other database entry; and

finding multiple occurrences of a given subsequence and grouping corresponding database entries into a confusion set; and

at least one of:

returning to a user the database entries corresponding to the ascertained unique signatures; and

returning to a user the database entries in the confusion set.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 14, 2023
From: NUANCE COMMUNICATIONS, INC.
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 065566/0013 →