Compact easily parseable binary format for a context-free...

Details Compact easily parseable binary format for a context-free... Compact easily parseable binary format for a context-free...

2007-10-16

2007-10-16

{hacek over (S)}mits, Talivaldis Ivars (Department: 2626)

Data processing: speech signal processing, linguistics, language

Speech signal processing

Recognition

C704S255000, C704S009000

Reexamination Certificate

active

11178043

ABSTRACT:
A computer-loadable data structure is provided that represents a state-and-transition-based description of a speech grammar. The data structure includes first and second transition entries that both represent transitions from a first state. The second transition entry is contiguous with the first transition entry in the data structure and includes a last-transition value. The last-transition value indicating that the second transition is the last transition from the first state in the data structure. A method is also provided for retrieving information from a binary grammar. The method includes receiving an index into a set of transition entries and converting the index into a memory offset relative to the beginning of the binary grammar, where the offset is based on a memory offset to the beginning of the set of transition entries, the fixed size of each transition entry and the index.

REFERENCES:
patent: 5619718 (1997-04-01), Correa
patent: 5719997 (1998-02-01), Brown et al.
patent: 5778341 (1998-07-01), Zeljkovic
patent: 5812975 (1998-09-01), Komori et al.
patent: 5870706 (1999-02-01), Alshawi
patent: 5907634 (1999-05-01), Brown et al.
patent: 5995918 (1999-11-01), Kendall et al.
patent: 6023697 (2000-02-01), Bates et al.
patent: 6260186 (2001-07-01), James
patent: 6266634 (2001-07-01), Buchsbaum et al.
patent: 6278973 (2001-08-01), Chung et al.
patent: 6374222 (2002-04-01), Kao
patent: 6757652 (2004-06-01), Lund et al.
patent: 6839669 (2005-01-01), Gould et al.
patent: 6895117 (2005-05-01), Klemm et al.
J. H. Reed, “Compiling Phrase Structure Grammar Rules Into Register Vector Grammar,” Proceedings of the Annual AI Systems in Government Conference, IEEE Cat. No. 89CH2715-1, pp. 244-249 (Mar. 27-31, 1989).
T. B. Williams, “Hierarchical Parsing”, Second Annual Phoenix Conference on Computers and Communications, pp. 427-430 (Mar. 14-16, 1983).
L.A. Harris, “SLR (1) and LALR (1) Parsing For Unrestricted Grammars,”Acta Informatica, vol. 24, No. 2, pp. 191-209 (1987).
T. Aizawa et al. “English-to-Japanese Machine Translation For Wire-Service Economic News,”Transactions of the Information Processing Society of Japan, vol. 37, No. 6, pp. 1041-1048 (Jun. 1996).
Shapiro, Stuart, “Generalized Augmented Transition Network Grammars for Generation From Semantic Networks,” Mar. 1982, American Journal of Computational Linguistics, vol. 8, No. 1, pp. 12-25.
Woods, W.A., “Transition Network Grammars for Natural Language Analysis,” Oct. 1970, Communications of the ACM, vol. 13, No. 10, pp. 591-606.
Green, Mark, “A Survey of Three Dialogue Models,” Jul. 1986, ACM Transactions on Graphics, vol. 5, No. 3, pp. 244-275.

Affiliated with

Also associated with

Rating

Compact easily parseable binary format for a context-free... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compact easily parseable binary format for a context-free..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact easily parseable binary format for a context-free... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3861192