, Ajouter(W pa,dictionnaire)

. Incrémenter,

, Incrémenter(fréquence(p)) les affectations sont : -Arbre 0 : mots séparateurs. -Arbre 1 : mots linguistiquesàlinguistiquesà l'ordre 0

, Arbre 2 : mots précédés de mots comportant des majuscules. -Arbre i+3 : mots précédés du i i` eme mot de la liste (1 ? i ? k)

L. Indexabilité, index d'un texte comprend pour chaque mot du texte la liste de ses poutilisant ce principe, p.3

, En ce qui concerne la mesure 3, on peut considérer un mot modifiant l, p.3

, Remarquons qu'il est possible d'utiliser une notion de contexte musical comparablècomparablè a celle de contexte linguistique (par exemple, accord déterminant nom, mots interdits)

, En se rappelant, qu'une altération portée par une note affecte toutes les notes identiques de la mesure courante, p.2

D. M. Abrahamson, An adaptive dependency source model for data compression, Commununications of the ACM, vol.32, issue.1, pp.77-83, 1989.
DOI : 10.1145/63238.63243

N. Abramson, Information Theory and Coding, Electronic Sciences Series. McGraw-Hill, 1963.

Y. Bar-ness and C. Peckman, Word-based data compression schemes, IEEE, pp.300-303, 1989.
DOI : 10.1109/iscas.1989.100350

D. Basu, Compression with several Huffman trees, Data Compression Conference, 1991.
DOI : 10.1109/dcc.1991.213309

J. C. Bell, T. C. Cleary, and I. H. Witten, Text Compression. Advanced Reference Series, 1990.

J. L. Mc-eilroy and M. D. Bentley, Engeeniring sorting function. Software Practice and Experience, vol.23, pp.1249-1265, 1993.

J. L. Sleator, D. , T. Bentley, and W. V. , A locally adaptative data compression scheme, Communications of ACM, vol.29, issue.4, pp.320-330, 1986.

. Bred and . Burrows, Communications of ACM, vol.29, issue.4, pp.320-330, 1986.

D. J. Wheeler and M. Burrows, A block-sorting lossless data compression algorithme, Digital Equipement Corporation, 1994.

J. G. Cleary and W. J. Teahan, IEEE Trans. Comm, vol.24, issue.5, pp.396-402, 1997.

J. G. Cleary and I. H. Witten, Data Compression Using Adaptative Coding and Partial Matching, IEEE Trans. Comm, vol.24, issue.5, pp.396-402, 1984.

W. J. Cleary, J. G. Teahan, and I. H. Witten, Unbounded Lenth Contexts for PPM. Data Compression Conference, 1995.

J. B. Connell, A Huffman-Shannon-Fanno code. Data Compression Conference, vol.61, pp.1046-1047, 1973.

G. V. Cormack and R. N. Horspool, Constructing Word-based Text Compression Algorithms. The computer journal, vol.30, pp.541-550, 1987.

G. V. Cormack and R. N. Horspool, Constructing Word-based Text Compression Algorithms, Data Compression Conference, 1992.

C. E. Rivest, R. L. Cormen, and T. H. Leiserson, Introduction to Algorithms, 1998.

M. Crochemore and R. Rytter, Text Algoritms, 1994.

N. Faller, An adaptative system for data compressio, IEEE Transaction on Information Theory, vol.24, issue.5, pp.668-674, 1973.

A. Fenwick, A new data structure for cumulative frequency tables. Software-Practice and Experience, vol.24, pp.327-336, 1994.

J. Gailly, Documentation for gzip. IEEE Transaction on Information Theory, 1993.

R. Gallager, Variations on a theme by Huffman, IEEE Transaction on Information Theory, vol.24, issue.5, pp.668-674, 1978.

M. Guazzo, A general minimum-redudancy source coding algorithm, IEEE Transaction on Information Theory, vol.26, issue.1, pp.15-25, 1980.

R. W. Hamming, Coding and Information Theory, 1980.

D. Hirschberg and D. Lelewer, Data Compression. Computing Surveys, vol.19, pp.261-296, 1987.

D. S. Hirschberg and D. A. Lelewer, Efficient decoding of prefix codes, Commununications of the ACM, vol.33, pp.449-459, 1990.

R. N. Horspool, Improving lzw. Data Compression Conference, 1991.

D. A. Huffman, A method for the construction on minimum redundancy codes, Proc. IRE, vol.40, pp.1098-1101, 1952.

S. W. Thomas, J. Mckie, S. Davies, K. Turkovsky, J. A. Wood et al., Compress (version 4.0) program and documentation, 1985.

J. Jiang and S. Jones, Word-based dynamic algorithms for data compression, IEE. Proceedings, vol.139, issue.6, pp.582-586, 1992.

A. Katajainen, J. Moffat, and A. Turpin, A fast and space-economical algorithm for length-limited coding, Data Compression Conference, pp.393-402, 1996.

A. Katajainen, J. Moffat, and A. Turpin, A fast and space-economical algorithm for length-limited coding, Data Compression Conference, pp.393-402, 1996.
DOI : 10.1007/bfb0015404

T. Shmuel and . Klein, Space and Time-Efficient Decoding with Canonical Huffman Trees, pp.65-75, 1997.

. Knuth, Dynamic Huffman coding, Journal od Algorithms, pp.163-180, 1985.
DOI : 10.1016/0196-6774(85)90036-7

A. Lempel and J. Ziv, Universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.

A. Lempel and J. Ziv, Compression of individual sequences via variable rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.

C. Liu and C. Yu, Data compression using word encoding with Huffman codes, Journal of the American Society for Information Science, pp.685-697, 1991.
DOI : 10.1002/(sici)1097-4571(199110)42:9<685::aid-asi7>3.0.co;2-1

U. Manber, A text compression scheme that allows fast searching in the compressed file. Software-Practice and Experience, vol.19, pp.11-124, 1993.

V. S. Miller and W. M. , Ziv and Lempel. Combinatorial algorithms on words, vol.12, pp.131-140, 1984.

A. Moffat, Word-based text compression. Software-Practice and Experience, vol.19, pp.185-198, 1989.
DOI : 10.1002/spe.4380190207

A. Moffat, Implementing the PPM data compression scheme, IEEE Transactions on Communications, vol.38, issue.11, pp.1917-1921, 1990.
DOI : 10.1109/26.61469
URL : http://www.cs.toronto.edu/~roweis/csc310-2006/extras/implementing_ppm.pdf

R. M. Moffat, A. Neal, and I. H. Witten, Arithmetic coding revisited. Data Compression Conference, pp.202-211, 1995.
DOI : 10.1109/dcc.1995.515510
URL : https://researchcommons.waikato.ac.nz/bitstream/10289/78/1/content.pdf

J. and M. A. Katajainen, -place calculation of the minimum redudancy codes. Data Compression Conference, pp.393-402, 1996.

A. Moffat and A. Turpin, On the implementation of the minimum redudancy prefix codes, Data Compression Conference, pp.170-179, 1996.

J. and M. A. Zobel, Word-based text compression. Software-Practice and Experience, vol.25, pp.891-903, 1995.

M. Nelson, The Data Compression Book, 1992.

E. Norwood, The number of different possibles compact codes and its application to efficient codin and decoding, IEEE Transaction on Information Theory, pp.613-616, 1967.

D. Revuz and . Dictionnaires, , 1989.

D. Revuz and M. Zipstein, Dz an universal compression algorithm specialized in text, Data Compression Conference, 1992.

J. Rissanen,

J. Langdon and G. Rissanen, Arithmetic coding, IBM Journal of Reasearch and Developpement, vol.29, issue.2, pp.149-162, 1979.

E. Roches, Analyse syntaxique, 1993.

K. Sayood, Introduction to Data Compression, 1996.

E. S. Schwartz, An optimum encoding with minimum longest code and total number of digits, Commununications of the ACM, vol.7, pp.166-169, 1964.

E. S. Schwartz and B. Kallick, Generating a canonical prefix encoding, Commununications of the ACM, vol.7, pp.166-169, 1964.
DOI : 10.1145/363958.363991

J. Seward, Documentation for bzip2, 2000.

C. E. Shannon, Prediction and entropy of printed english, Bell Systeme Technical Journal, pp.379-423, 1951.

C. E. Weaver and W. Shannon, A mathematical theory of communication, Bell Systeme Technical Journal, 1948.

A. Sieminski, Fast decoding of the Huffman codes, Information Processing Letters, vol.26, pp.237-241, 1988.

H. Tanaka, Data structure of Huffman codes and its application to efficient codin and decoding, IEEE Transaction on Information Theory, vol.33, issue.1, pp.155-160, 1987.

D. Taupin and . Musixdoc, , 2001.

W. J. Teahan, Modelling English Text, 1998.

P. Tischer, A modified Lempel-Ziv-Welch data compression scheme, Australian Computer Science, vol.9, issue.1, pp.261-272, 1987.

J. S. Vitter, A technique for high-performance data compression, Journal of ACM, vol.34, issue.4, pp.825-845, 1985.

C. Walshaw, , 2001.

T. A. Welch, A technique for high-performance data compression, IEEE Computer, vol.17, issue.6, pp.8-19, 1984.
DOI : 10.1109/mc.1984.1659158

I. H. Moffat, A. Witten, and T. C. Bell, Managing Gigabytes : Compressing and Indexing Documents and Images, Advanced Reference Series, 1994.

J. C. Witten and I. H. Cleary, The zero frequency problem : Estimating the probabilities of novel events in adaptative text compression, IEEE Transaction on Information Theory, vol.37, issue.4, pp.1085-1094, 1991.

R. M. Witten, I. H. Neal, and J. C. Cleary, Arithmetic coding for data compression, Commununications of the ACM, vol.30, issue.6, pp.520-540, 1987.

M. Zipstein, Les methodes de compression de texte algorithmes et performances, 1990.