Maximal Phrases Based Analysis for Prototyping Online Discussion Forums Postings

International Workshop on Adaptation of Language Resources and Technology to New Domains, AdaptLRTtoND 2009 - held in conjunction with the International Conference RANLP 2009 - Proceedings

Volumn , Issue , 2009, Pages 12-18

  Burek, Gaston ^a   Gerdemann, Dale ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DOCUMENT MATRICES; EDUCATIONAL ENVIRONMENT; LEARNING PROJECTS; NON-PARAMETRIC PERMUTATION; ONLINE DISCUSSION FORUMS; PERMUTATION TESTS; SHORT TEXTS; VECTOR SPACE MODELS;

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

References (12)

1. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. Replacing suffix trees with enhanced suffix arrays. J. of Discrete Algorithms, 2(1):53–86, 2004.
2. H. Åhlfeldt, L. Borin, P. Daumke, N. Grabar, C. Hallett, D. Hardcastle, D. Kokkinakis, C. Mancini, K. Markó, M. Merkel, C. Pietsch, R. Power, D. Scott, A. Silvervarg, M. T. Gronostaj, S. Williams, and A. Willis. Literature review on patient-friendly documentation systems. Technical Report 2006/04, Centre for Research in Computing, The Open University, Milton Keynes, UK, May 2006. ISSN: 1744-1986.
3. R. Bekkerman and J. Allan. Using bigrams in text categorization. Technical Report IR-408, Center of Intelligent Information Retrieval, UMass Amherst, 2004.
4. J. S. Brown and P. Duguid. Knowledge and organization: A social-practice perspective. Organization Science, 12(2):198–213, March 2001.
5. T. Cover and P. Hart. Nearest neighbor pattern classification. Information Theory, IEEE Transactions on, 13(1):21–27, 1967.
6. A. Davies and C. Elder, editors. The Handbook of Applied Linguistics. Blackwell Handbooks in Linguistics. Wiley-Blackwell, Malden, 2006.
7. D. K. Kim, M. Kim, and H. Park. Linearized suffix tree: an efficient index data structure with the capabilities of suffix trees and suffix arrays. Algorithmica, 52(3):350–377, 2008.
8. T. K. Landauer and S. T. Dumais. A solution to plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge. Psychological Review, 104(2):211–240, April 1997.
9. G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. In Information Processing and Management, pages 513–523, 1988.
10. J. van Bruggen, P. Sloep, P. van Rosmalen, F. Brouns, H. Vogten, R. Koper, and C. Tattersall. Latent semantic analysis as a tool for learner positioning in learning networks for lifelong learning. In British Journal of Educational Technology, number 6, pages 729–738, 2004.
11. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, September 2004.
12. M. Yamamoto and K. W. Church. Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus. Comput. Linguist., 27(1):1–30, 2001.