Patent US6327561B1 successfully refreshed from Google Patents.
US6327561B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Customized tokenization of domain specific text via rules corresponding to a speech recognition vocabulary
Assignee: Nuance Communications Inc
•
Filing: 1999-07-07
•
Granted: 2001-12-04
•
Expires: 2019-07-07
Abstract
Abstract A method for supporting customized tokenization of domain-specific text acomprises the steps of: loading domain-specific tokenization rules corresponding to the customized tokenization of the domain-specific text; tokenizing the domain-specific text using the loaded domain-specific tokenization rules; and, further tokenizing the domain-specific text using general purpose tokenization rules. The loading step of the inventive method can comprise: loading a speech recognition vocabulary; and, loading domain-specific tokenization rules corresponding to the speech recognition vocabulary. In addition, the tokenizing step can comprise identifying each substring in the domain-specific text matching a regular expression having a corresponding replacement pattern in the loaded domain-specific tokenization rules, and replacing each substring identified in the identifying step with the replacement pattern corresponding to the matched regular expression. Alternatively, the tokenizing step can comprise identifying substrings in the domain-specific text matching a regular expression having a corresponding replacement pattern in the second loaded domain-specific tokenization rules; excluding from further processing the identified substrings having a do-not-replace marker associated with the identified substring; and, replacing each non-excluded identified substring with the replacement pattern corresponding to the matched regular expression.
Inventors
- 👤 Maria E. Smith
- 👤 Bernard John Grainger
- 👤 Hubert Crépy
- 👤 Martin Herzog
- 👤 Gerhard Backfried
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 01:00
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/279; G06F40/284
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
60 words
A method for supporting customized tokenization of a segment of domain-specific text comprising the steps of: loading domain-specific tokenizaticn rules corresponding to said customized tokenization of said segment of domain-specific text; fully tokenizing said segment of domain-specific text using said loaded domain-specific tokenization rules; and, further fully tokenizing said fully tokenized segment of domain-specific text using general purpose tokenization rules.
Claim 2
Independent Claim
60 words
A method for supporting customized tokenization of a segment of domain-specific text comprising the steps of: loading domain-specific tokenizaticn rules corresponding to said customized tokenization of said segment of domain-specific text; fully tokenizing said segment of domain-specific text using said loaded domain-specific tokenization rules; and, further fully tokenizing said fully tokenized segment of domain-specific text using general purpose tokenization rules.
Claim 3
Dependent Claim
28 words
The method according to claim 1 , wherein said loading step comprises: loading a speech recognition vocabulary; and, loading domain-specific tokenization rules corresponding to said speech recognition vocabulary.
Claim 4
Dependent Claim
38 words
The method according to claim 1 , wherein said loading step comprises: first loading an active vocabulary; identifying domain-specific tokenization rules corresponding to said active vocabulary; and, second loading said domain-specific tokenization rules identified in said identifying step.
Claim 5
Dependent Claim
53 words
The method according to claim 1 , wherein said tokenizing step comprises: identifying each substring in said domain-specific text matching a regular expression having a corresponding replacement pattern in said loaded domain-specific tokenization rules; and, replacing each substring identified in said identifying step with said replacement pattern corresponding to said matched regular expression.
Claim 6
Dependent Claim
46 words
The method according to claim 3 , wherein said tokenizing step comprises: checking for said second loaded domain-specific tokenization rules; and, processing said domain-specific text using said second loaded domain-specific tokenization rules only if said second loaded domain-specific tokenization rules are identified in said checking step.
Claim 7
Dependent Claim
54 words
The method according to claim 5 , wherein said processing step comprises: identifying each substring in said domain-specific text matching a regular expression having a corresponding replacement pattern in said second loaded domain-specific tokenization rules; and, replacing each substring identified in said identifying step with said replacement pattern corresponding to said matched regular expression.
Claim 8
Dependent Claim
66 words
The method according to claim 5 , wherein said processing step comprises: identifying substrings in said domain-specific text matching a regular expression having a corresponding replacement pattern in said second loaded domain-specific tokenization rules; excluding from further processing said identified substrings having a do-not-replace marker associated with said identified substring; and, replacing each non-excluded identified substring with said replacement pattern corresponding to said matched regular expression.
Claim 9
Dependent Claim
68 words
A computer apparatus programmed with a routine set of instructions stored in a fixed medium, said computer apparatus comprising: means for loading domain-specific tokenization rules corresponding to a customized tokenization of a segment of domain-specific text; first means for fully tokenizing said segment of domain-specific text using said loaded domain-specific rules; and, second means for further fully tokenizing said segment of domain-specific text using general purpose tokenization rules.
Claim 10
Dependent Claim
68 words
A computer apparatus programmed with a routine set of instructions stored in a fixed medium, said computer apparatus comprising: means for loading domain-specific tokenization rules corresponding to a customized tokenization of a segment of domain-specific text; first means for fully tokenizing said segment of domain-specific text using said loaded domain-specific rules; and, second means for further fully tokenizing said segment of domain-specific text using general purpose tokenization rules.
Claim 11
Dependent Claim
35 words
The computer apparatus according to claim 8 , wherein said loading means comprises: first means for loading a speech recognition vocabulary; and, second means for loading domain-specific tokenization rules corresponding to said speech recognition vocabulary.
Claim 12
Dependent Claim
46 words
The computer apparatus according to claim 8 , wherein said loading means comprises: first means for loading an active vocabulary; means for identifying any domain-specific tokenization rules corresponding to said active vocabulary; and, second means for loading said domain-specific tokenization rules identified by said identifying means.
Claim 13
Dependent Claim
59 words
The computer apparatus according to claim 8 , wherein said first tokenizing means comprises: means for identifying each substring in said domain-specific text matching a regular expression having a corresponding replacement pattern in said loaded domain-specific tokenization rules; and, means for replacing each substring identified by said identifying means with said replacement pattern corresponding to said matched regular expression.
Claim 14
Dependent Claim
49 words
The computer apparatus according to claim 10 , wherein said first tokenizing means comprises: means for checking for said loaded domain-specific tokenization rules; and, means for processing said domain-specific text using said loaded domain-specific tokenization rules only if said loaded domain-specific tokenization rules are identified by said checking means.
Claim 15
Dependent Claim
58 words
The computer apparatus according to claim 12 , wherein said processing means comprises: means for identifying each substring in said domain-specific text matching a regular expression having a corresponding replacement pattern in said loaded domain-specific tokenization rules; and, means for replacing each substring identified by said identifying means with said replacement pattern corresponding to said matched regular expression.
Claim 16
Dependent Claim
72 words
The computer apparatus according to claim 12 , wherein said processing means comprises: means for identifying substrings in said domain-specific text matching a regular expression having a corresponding replacement pattern in said loaded domain-specific tokenization rules; means for excluding from further processing said identified substrings having a do-not-replace marker associated with said identified substring; and, means for replacing each non-excluded identified substring with said replacement pattern corresponding to said matched regular expression.
Claim 17
Independent Claim
67 words
A system for supporting customized tokenization of a segment of domain-specific text in a speech recognition system comprising: a loader for loading domain-specific tokenization rules corresponding to said segment of domain-specific text; a first domain-specific tokenizer for fully tokenizing said segment of domain-specific text according to said loaded domain-specific tokenization rules; and, a second general purpose tokenizer for further fully tokenizing said fully tokenized segment of text.
Claim 18
Independent Claim
67 words
A system for supporting customized tokenization of a segment of domain-specific text in a speech recognition system comprising: a loader for loading domain-specific tokenization rules corresponding to said segment of domain-specific text; a first domain-specific tokenizer for fully tokenizing said segment of domain-specific text according to said loaded domain-specific tokenization rules; and, a second general purpose tokenizer for further fully tokenizing said fully tokenized segment of text.
Claim 19
Dependent Claim
37 words
The system according to claim 15 , wherein said loader comprises: a vocabulary loader for loading a customized vocabulary database; and, a rule loader for loading a domain-specific tokenization rules database corresponding to said customized vocabulary database.
Claim 20
Dependent Claim
33 words
The system according to claim 16 , wherein said first tokenizer comprises a customized tokenizer for tokenizing said domain-specific text according to said domain-specific tokenization rules database corresponding to said customized vocabulary database.
References Cited (Backward Citations)
EP0287310A2
Cited
US4991094A
Cited
US5687384A
Cited
US5890103A
Cited
US5721939A
Cited
US6125377A
Cited
US5774888A
Cited
US5937422A
Cited
US5960384A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-12-03 | 2005-06-04 | 2005-12-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-12-03 | 2009-06-04 | 2009-12-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-12-03 | 2013-06-04 | 2013-12-04 | $7700.00 | Window Closed / Lapsed |