# US 2008/0077405 A1 · Grammar Generation for Password Recognition

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0077405 A1
- Document ID: US20080077405A1
- Status: Published application
- Kind: A1
- Application number: 11/859,317
- Filed: 2007-09-21
- Published: 2008-03-27
- Earliest claimed: 2006-09-21
- Assignees: Nuance Communications, Inc.
- Inventors: Richard Breuer
- Web page: https://patentgrep.com/patent/US20080077405A1

## CPC

- G10L 15/193: Formal grammars, e.g. finite state automata, context free grammars or word networks
- G10L 17/24: the user being prompted to utter a password or a predefined phrase
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

A password grammar for speech recognition is described. A password is normalized into a list of strings of a plurality of character types such as letters and numerals. For each string of letters, one or more corresponding letter permutations are determined which represent pronounceable combinations of that string. Then, for each letter permutation, a corresponding recognition grammar entry is created for a speech recognition grammar.

## Claims

### Claim 1

A method for creating a password grammar for speech recognition comprising:
normalizing a password into a list of strings of a plurality of character types, the character types including letters and numerals;
for each string of letters, determining one or more corresponding letter permutations representing pronounceable combinations of the string; and
for each letter permutation, creating a corresponding recognition grammar entry for a speech recognition grammar.

### Claim 2 (depends on 1)

A method according to claim 1, further comprising:
for each string of numerals, determining one or more corresponding number permutations representing pronounceable combinations of the string; and
for each number permutation, creating a corresponding recognition grammar entry for the speech recognition grammar.

### Claim 3 (depends on 1)

A method according to claim 1, further comprising:
for each string of non-alphanumeric characters, determining one or more corresponding character permutations representing pronounceable combinations of the string; and
for each character permutation, creating a corresponding recognition grammar entry for the speech recognition grammar.

### Claim 4 (depends on 1)

A method according to claim 1, wherein the grammar is a Speech Recognition Grammar Specification (SRGS) grammar.

### Claim 5

A speech recognition grammar for password recognition comprising:
a recognition rule for each pronounceable permutation of each substring of letters.

### Claim 6 (depends on 5)

A speech recognition grammar according to claim 5, further comprising:
a recognition rule for each pronounceable permutation of each substring of numerals.

### Claim 7 (depends on 5)

A speech recognition grammar according to claim 5, further comprising:
a recognition rule for each pronounceable permutation of each substring of non-alphanumeric characters.

### Claim 8 (depends on 5)

A speech recognition grammar according to claim 5, wherein the grammar is a Speech Recognition Grammar Specification (SRGS) grammar.

### Claim 9

A computer program product for creating a password grammar for speech recognition, the product comprising:
program code for normalizing a password into a list of strings of a plurality of character types, the character types including letters and numerals;
program code for determining, for each string of letters, one or more corresponding letter permutations representing pronounceable combinations of the string; and
program code for creating, for each letter permutation, a corresponding recognition grammar entry for a speech recognition grammar.

### Claim 10 (depends on 9)

A computer program product according to claim 9, further comprising:
program code for determining, for each string of numerals, one or more corresponding number permutations representing pronounceable combinations of the string; and
program code for creating, for each number permutation, a corresponding recognition grammar entry for the speech recognition grammar.

### Claim 11 (depends on 1)

A computer program product according to claim 1, further comprising:
program code for determining, for each string of non-alphanumeric characters, one or more corresponding character permutations representing pronounceable combinations of the string; and
program code for creating, for each character permutation, a corresponding recognition grammar entry for the speech recognition grammar.

### Claim 12 (depends on 1)

A computer program product according to claim 1, wherein the grammar is a Speech Recognition Grammar Specification (SRGS) grammar.
