Unsupervised Learning of Word Boundary with Description Length Gain

CoNLL 1999 - Computational Natural Language Learning, Held in cooperation with 9th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1999 - Proceedings of a Workshop

Volumn , Issue , 1999, Pages 1-6

  Kit, Chunyu ^a,b   Wilks, Yorick ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; MACHINE LEARNING;

CLASSIC INFORMATION; DESCRIPTION LENGTH GAINS; LARGE-SCALES; LEXICAL ACQUISITION; LEXICAL ITEMS; MINIMUM DESCRIPTION LENGTH; NATURAL LANGUAGES; OPTIMAL SEGMENTATION; UNSUPERVISED APPROACHES;

LEARNING ALGORITHMS;

EID: 85090807987     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [Cover and Thomas 1991] Cover, T. M., and J. A. Thomas, 1991. Elements of Information Theory. John Wiley and Sons, Inc. New York.
2. [de Marken 1995] de Marken, C. 1995. The Unsupervised Acquisition of a Lexicon from Continuous Speech. Technical Report A.I. Memo No. 1558, AI Lab., MIT. Cambridge, Massachusetts.
3. [de Marken 1996] de Marken, C. 1996. Unsupervised Language Acquisition. Ph.D. dissertation, MIT, Cambridge, Massachusetts.
4. [Dempster et al. 1977] Dempster, A. P., N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(B): 1-38.
5. [Francis and Kucera 1982] Francis, W. N., and H. Kucera. 1982. Frequency Analysis of English Usage: Lexical and Grammar. Houghton-Mifflin, Boston.
6. [Kit 1998] Kit, C. 1998. A goodness measure for phrase learning via compression with the MDL principle. In The ESSLLI-98 Student Session, Chapter 13, pp. 175-187. Aug. 17-28, Saarbrüken.
7. [Kit and Wilks 1998] Kit, C, and Y. Wilks. 1998. The Virtual Corpus approach to deriving n-gram statistics from large scale corpora. In C. N. Huang (ed.), Proceedings of 1998 International Conference on Chinese Information Processing, pp. 223-229. Nov. 18-20, Beijing.
8. [Li and Vitányi 1993] Li, M., and P. M. B. Vitányi. 1993. Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, New York. Second edition, 1997.
9. [Marcus et al. 1993] Marcus, M., B. Santorini and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
10. [Nevill-Manning 1996] Nevill-Manning, C. G. Inferring Sequential Structure. Ph.D. dissertation, University of Waikato, New Zealand.
11. [Powers 1997] Powers, D. M. W. Unsupervised learning of linguistic structure: an empirical evaluation. International Journal of Corpus Linguistics. 2(1):91-131.
12. [Rissanen 1978] Rissanen, J. 1978. Modelling by shortest data description. Automatica, 14:465-471.
13. [Rissanen 1982] Rissanen, J. 1982. A universal prior for integers and estimation by minimum description length. Ann. Statist. 11:416-431.
14. [Rissanen 1989] Rissanen, J. 1989. Stochastic Com-plexity in Statistical Inquiry. World Scientific, N.J.
15. [Shannon 1948] Shannon, C. 1948. A mathematical theory of communication. Bell System Technical Journal, 27:379-423, 623-656.
16. [Solomonoff 1964] Solomonoff, R. J. 1964. A formal theory of inductive inference, part 1 and 2. Information Control, 7:1-22, 224-256.
17. [Stolcke 1994] Stolcke, A. 1994. Bayesian Learning of Probabilistic Language Models. Ph.D. dissertation, UC Berkeley, CA.
18. [Vitányi and Li 1996] Vitányi, P. M. B., and M. Li. 1996. Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity. Manuscript, CWI, Amsterdam.
19. [Wolff 1975] Wolff, J. G. An algorithm for the segmentation of an artificial language analogue. British Journal of Psychology, 66:79-90.
20. [Wolff 1977] Wolff, J. G. The discovery of segments in natural language. British Journal of Psychology, 68:97-106.
21. [Wolff 1982] Wolff, J. G. Language acquisition, data compression and generalization. Language and Communication, 2:57-89.