On vocabulary size of grammar-based codes

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, accepted to ISIT 2007 and corrected

Scientific paper

We discuss inequalities holding between the vocabulary size, i.e., the number of distinct nonterminal symbols in a grammar-based compression for a string, and the excess length of the respective universal code, i.e., the code-based analog of algorithmic mutual information. The aim is to strengthen inequalities which were discussed in a weaker form in linguistics but shed some light on redundancy of efficiently computable codes. The main contribution of the paper is a construction of universal grammar-based codes for which the excess lengths can be bounded easily.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On vocabulary size of grammar-based codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On vocabulary size of grammar-based codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On vocabulary size of grammar-based codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-721697

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.