Compressing language models with Golomb coding

Details Compressing language models with Golomb coding Compressing language models with Golomb coding

2008-04-22

2008-04-22

Chawan, Vijay (Department: 2626)

Data processing: speech signal processing, linguistics, language

Speech signal processing

Recognition

C704S009000, C704S010000, C704S001000, C341S022000, C341S176000

Reexamination Certificate

active

11159712

ABSTRACT:
A list of integer values is generated from n-grams of a user input. The list of integer values is sorted. Differences between adjacent integer values in the list are calculated. Each calculated difference is encoded using a Golomb code. A Golomb compressed language model is accessed to identify likely matches.

REFERENCES:
patent: 5325091 (1994-06-01), Kaplan et al.
patent: 5764374 (1998-06-01), Seroussi et al.
patent: 6092038 (2000-07-01), Kanevsky et al.
patent: 6169969 (2001-01-01), Cohen
patent: 6665665 (2003-12-01), Ponte
patent: 6668092 (2003-12-01), Sriram et al.
patent: 2002/0018597 (2002-02-01), Kajiwara et al.
patent: 2003/0023420 (2003-01-01), Goodman
patent: 2003/0074183 (2003-04-01), Eisele
patent: 2004/0044534 (2004-03-01), Chen et al.
patent: 2004/0071351 (2004-04-01), Rade
patent: 2004/0138884 (2004-07-01), Whittaker et al.
patent: 2004/0243411 (2004-12-01), Li et al.
patent: WO 03/067895 (2003-08-01), None
Senecal, J. et al.; “Length-Limited Variable-to-Variable Length Codes for High Performance Entropy Coding,” IEEE Proceedings of the Data Compression Conference, 2004, pp. 1-10.
Zhang, N. and Golomb, S.W. “Polyphase Sequence with Low Autocorrelations,” IEEE Transactions on Information Theory, vol. 39, No. 3, May 1993, pp. 1085-1089.
Song, Hong and Golomb S.W.; “Some New Constructions for Simplex Codes,” IEEE Transactions on Information Theory, vol. 40, No. 2, Mar. 1994. pp. 504-507.
Fan, P.Z. and Darnell, M. Dept. of Electronic Engineering, University of Hull, United Kingom, IEEE Transactions, 1994, pp. 74.
Gabidulin, E.M. et al.; “Autocorrelation of Golomb Sequences,” IEEE Transactions of Proc.—Communications, vol. 142, No. 5, Oct. 1995, pp. 281-284.
Robinson, J.P.; “Golomb Rectangles as Folded Rulers,” IEEE Transactions on Information Theory, vol. 43, No. 1, Jan. 1997, pp. 290-293.
Seroussi G, and Weinberger, M.J.; “On Adaptive Strategies for an Extended Family of Golomb-type Codes,” IEEE Transactions, 1997, pp. 131-140.
Manor, D. and Feder, M.; “An Iterative Technique for Universal Lossy Compression of Individual Sequences,” IEEE Transactions, 1997, pp. 141.
Kato, S. et al.; “Structured “Truncated Golomb Code” for Context-Based Adaptive VLC,” IEEE Transactions, 2003, pp. 405-408.
Stein, S. and Goharian, N.; “On the Mapping of Index Compression Techniques on CSR Information Retrieval,” IEEE Proceedings of the Int'l Conference on Information Technology: Computers and Communications, 2003, pp. 1-4.
Hong, E. and Ladner, R.; “Extended Golomb Codes for Binary Markov Sources,” IEEE Proceedings of the Data Compression Conference, 2002, pp. 1.
Szpankowski, W.; “Asymptotic Average Redundancy of Huffman (and Other) Block Codes,” IEEE Transactions on Information Theory, vol. 46, No. 7, Nov. 2000, pp. 2434-2443.
PCT Search Report, PCT/US06/22042,filed Jun. 6, 2006.
Lim, K.H. and Tan, S.Y.; “Variations of Golomb Run-Length Codes,” National University of Singapore, Singapore. 1992., International Conference on Volume , Issue , Apr. 7-9, 1992 pp. 518-521.

Affiliated with

Also associated with

Rating

Compressing language models with Golomb coding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compressing language models with Golomb coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressing language models with Golomb coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3933424