System and method of decoding a packed representation of multiple parses
First Claim
Patent Images
1. A method of decoding a packed representation of multiple parses comprising the steps of:
- providing a packed representation including at least one edgenode, each edgenode including a substitution list;
creating a current forest object;
replicating the current forest object for each edgenode having a substitution list containing greater than one edgenode; and
traversing each edgenode of the packed representation.
4 Assignments
0 Petitions
Accused Products
Abstract
A program, system and method for decoding a packed representation of multiple parses that creates an unpacked forest to be read by a semantic interpretation module from a packed representation is provided. The packaged representation includes at least one edgenode and each edgenode includes a substitution list. A current forest object is created and is replicated for each edgenode having a substitution list containing greater than one edgenode. Each replica of the current forest object is updated with one of the edgenodes from the substitution list. Each edgenode of the packed representation is traversed using a depth-first traversal.
-
Citations
21 Claims
-
1. A method of decoding a packed representation of multiple parses comprising the steps of:
-
providing a packed representation including at least one edgenode, each edgenode including a substitution list;
creating a current forest object;
replicating the current forest object for each edgenode having a substitution list containing greater than one edgenode; and
traversing each edgenode of the packed representation. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A program for decoding a packed representation of parses stored on computer readable medium comprising:
-
computer readable program code for creating a current forest object;
computer readable program code for traversing each edgenode of the packed representation; and
computer readable program code for replicating the forest object for each edgenode having a substitution list of elements greater than 1. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A system for decoding multiple parses comprising:
-
a parser which receives output from a speech recognizer and creating parses stored in a packed representation, the packed representation including a plurality of edgenodes;
each edgenode including a substitution list; and
an unpacking program stored on a computer readable medium including program code for creating an unpacked forest including the steps of creating a current forest object, traversing each edgenode of the packed representation using a depth-first traversal, replicating the current forest object a number of times equal to the number of edgenodes in the substitution list, and updating each copy of the current forest object with a treenode corresponding to one of the edgenodes of the substitution list.
-
Specification