Data processing: speech signal processing – linguistics – language – Linguistics – Natural language
Reexamination Certificate
2006-04-04
2006-04-04
Dorvil, Richemond (Department: 2654)
Data processing: speech signal processing, linguistics, language
Linguistics
Natural language
C704S001000, C704S010000, C704S004000
Reexamination Certificate
active
07024350
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: 5642519 (1997-06-01), Martin
patent: 5778341 (1998-07-01), Zeljkovic
patent: 5812975 (1998-09-01), Komori et al.
patent: 5870706 (1999-02-01), Alshawi
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: 6839669 (2005-01-01), Gould et al.
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 Netowrk 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.
J. H. Reed, “Compiling Phrase Structure Grammer Rules Into Register Vector Grammer,” 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).
Lipe Ralph
Schmid Philipp H.
Dorvil Richemond
Magee Theodore M.
Microsoft Corporation
Shortledge Thomas
Westman Champlin & Kelly P.A.
LandOfFree
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.
Profile ID: LFUS-PAI-O-3525240