kent ridge - Profile on Academia.edu (original) (raw)
Related Authors
Uploads
Papers by kent ridge
Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics -, 2000
This paper proposes a new error-driven HMMbased text chunk tagger with context-dependent lexicon.... more This paper proposes a new error-driven HMMbased text chunk tagger with context-dependent lexicon. Compared with standard HMM-based tagger, this tagger uses a new Hidden Markov Modelling approach which incorporates more contextual information into a lexical entry. Moreover, an error-driven learning approach is adopted to decrease the memory requirement by keeping only positive lexical entries and makes it possible to further incorporate more contextdependent lexical entries. Experiments show that this technique achieves overall precision and recall rates of 93.40% and 93.95% for all chunk types, 93.60% and 94.64% for noun phrases, and 94.64% and 94.75% for verb phrases when trained on PENN WSJ TreeBank section 00-19 and tested on section 20-24, while 25-fold validation experiments of PENN WSJ TreeBank show overall precision and recall rates of 96.40% and 96.47% for all chunk types, 96.49% and 96.99% for noun phrases, and 97.13% and 97.36% for verb phrases.
Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning -, 2000
Lecture Notes in Computer Science, 2002
Filiol and Fontaine recently proposed a family of stream ciphers named COS. COS is based on nonli... more Filiol and Fontaine recently proposed a family of stream ciphers named COS. COS is based on nonlinear feedback shift registers and was claimed to be highly secure. Babbage showed that COS (2, 128) Mode II is extremely weak. But Babbage's attack is very expensive to break the COS (2, 128) Mode I (the complexity is around 2 52 ). In this paper, we show that the COS (2, 128) Mode I is very weak. Secret information could be recovered easily with about 2 16 -bit known plaintext.
Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics -, 2000
This paper proposes a new error-driven HMMbased text chunk tagger with context-dependent lexicon.... more This paper proposes a new error-driven HMMbased text chunk tagger with context-dependent lexicon. Compared with standard HMM-based tagger, this tagger uses a new Hidden Markov Modelling approach which incorporates more contextual information into a lexical entry. Moreover, an error-driven learning approach is adopted to decrease the memory requirement by keeping only positive lexical entries and makes it possible to further incorporate more contextdependent lexical entries. Experiments show that this technique achieves overall precision and recall rates of 93.40% and 93.95% for all chunk types, 93.60% and 94.64% for noun phrases, and 94.64% and 94.75% for verb phrases when trained on PENN WSJ TreeBank section 00-19 and tested on section 20-24, while 25-fold validation experiments of PENN WSJ TreeBank show overall precision and recall rates of 96.40% and 96.47% for all chunk types, 96.49% and 96.99% for noun phrases, and 97.13% and 97.36% for verb phrases.
Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning -, 2000
Lecture Notes in Computer Science, 2002
Filiol and Fontaine recently proposed a family of stream ciphers named COS. COS is based on nonli... more Filiol and Fontaine recently proposed a family of stream ciphers named COS. COS is based on nonlinear feedback shift registers and was claimed to be highly secure. Babbage showed that COS (2, 128) Mode II is extremely weak. But Babbage's attack is very expensive to break the COS (2, 128) Mode I (the complexity is around 2 52 ). In this paper, we show that the COS (2, 128) Mode I is very weak. Secret information could be recovered easily with about 2 16 -bit known plaintext.