Introducing Word Order Within the LSA Framework

Handbook of Latent Semantic Analysis

Volumn , Issue , 2007, Pages 449-464

  Dennis, Simon ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 50849102802     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4324/9780203936399-30     Document Type: Chapter

References (29)

1. Allison, L., Wallace, C. S., andYee, C. N. (1992). Finite-state models in the alignment of macromolecules. Journal of Molecular Evolution, 35(1), 77-89.
2. Blaheta, D., andCharniak, E. (2000, May). Assigning function tags to parsed text. Proceedings of the First Annual Meeting the North American Chapter of the ACL (NAACL), 234-240.
3. Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977). Maximum liklelihood from incomplete data via theemalgorithm (with discussion). Journal of the Royal Statistical Society, series B, 39, 1-38.
4. Dennis, S. (2003a). An alignment-based account of serial recall. In R. AltermanandD. Kirsh (Eds.), Proceedings of the 25th Annual Conference of the Cognitive Science Society (pp. 336-341). Mahwah, NJ: Lawrence Erlbaum Associates.
5. Dennis, S. (2003b). Acomparison of statistical models for the extraction of lexical information from text corpora. In R. Alterman and D. Kirsh (Eds.), Proceedings of the 25th Annual Conference of the Cognitive Science Society. Mahwah, NJ: Lawrence Erlbaum Associates.
6. Dennis, S. (2004). Anunsupervised method for the extraction of propositional information fromtext. Proceedings of the National Academy of Sciences, 101, 5206-5213.
7. Dennis, S. (2005). A memory-based theory of verbal cognition. Cognitive Science, 29(2), 145-193.
8. Dennis, S., and Kintsch, W. (in press). The text mapping and inference generation problems in text comprehension. In C. A. PerfettiandF. Schmalhofer (Eds.), Higher level language processes in the brain: Inference and comprehension processes.
9. Dumais, S. T. (2003). Data-driven approach to information access. Cognitive Science, 27, 491-524.
10. Ervin, S. M. (1961). Changes with age in the verbal determinants of word association. American Journal of Psychology, 74, 361-372.
11. Ervin-Tripp, S. M. (1970). Substitution, context and association. In L. PostmanandG. Keppel (Eds.), Norms of word association (p. 383-467). New York: Academic Press.
12. Gildea, D., and Jurafsky, D. (2002). Automatic labeling of semantic roles. Computational Linguistics, 28(3), 245-288.
13. Griffiths, T. L., and Steyvers, M. (2003). Prediction and semantic association. In S. Becker, S. Thrun, and K. Obermayer (Eds.), Advances in neural information proccessing 15 (pp. 11-18). Cambridge, MA: MIT Press.
14. Harrington, M., and Dennis, S. (2003). Structural priming in sentence comprehension. In R. AltermanandD. Kirsh (Eds.), Proceedings of the 25th Annual Conference of the Cognitive Science Society (pp. 510-515). Mahwah, NJ: Lawrence Erlbaum Associates.
15. Hofmann, T. (2001). Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42 (1-2), 177-196.
16. Kashket, M. (1986). Parsing a free-word order language:Warlpiri. Proceedings of the 24th Conference on Association for Computational Linguistics, 60-66.
17. Kintsch, W. (1998). Comprehension: A paradigm for cognition. Cambridge, England: Cambridge University Press.
18. Kintsch, W. (2001). Predication. Cognitive Science, 25, 173-202.
19. Klein, D., and Manning, C. D. (2001). Distributional phrase structure induction. In W. Daelemans and R. Zajac (Eds.), Proceedings of the Fifth Conference on Computational Language Learning (CoNNL-2001) (pp. 113-120). Morristown, NJ: Association for Computational Linguistics.
20. Landauer, T.K. (2002). On the computational basis of learning and cognition: Arguments from lsa. In N. Ross (Ed.), The psychology of learning and motivation (Vol. 41, pp. 43-84). New York: Academic Press.
21. Landauer, T. K., Laham, D., Rehder, B., andSchreiner, M. E. (1997). How well can passage meaning be derived without using word order? Acomparison of latent semantic analysis and humans. In P. Langley (Ed.), Proceedings of the 19th Annual Conference of the Cognitive Science Society (p. 412-417). Mahwah, NJ: Lawrence Erlbaum Associates.
22. Levenshtein, V. I. (1965). Binary codes capable of correcting deletions, insertions and reversals. Dokl. Akad. Nauk. SSSR, 163, 845-848.
23. Marcus, M., Kim, G., Marcinkiewicz, M. A., MacIntyre, R., Bies, A., Ferguson, M., et al. (1993). Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19(2), 313-330.
24. McNeill, D. (1966). Astudy of word association. Journal of Verbal Learning and Verbal Behavior, 2, 250-262.
25. Needleman, S. B., andWunsch, C. D. (1970). Ageneral method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48, 443-453.
26. Palmer, M., Rosenzweig, J., andCotton, S. (2001). Automatic predicate argument analysis of the penn treebank. In J. Allan (Ed.), Proceedings of hlt 2001, First International Conference on Human Language Technology Research. San Francisco: Morgan Kaufmann.
27. Radford, A. (1988). Transformational grammar: A first course. Cambridge, England: Cambridge University Press.
28. Sankoff, D., andKruskal, J. B. (1983).Time warps, string edits and macromolecules: The theory and practise of sequence comparison. Reading, MA: Addison Wesley.
29. Sellers, P. H. (1974). An algorithm for the distance between two finite sequences. Journal of Combinatorial Theory, 16, 253-258.