Automatic LSA-Based Retrieval of Synonyms (for Search Space Extension)
This paper describes a research, experiments, and theoretical considerations leading towards automatic computational thesaurus construction based upon identification of synonyms in large sets of texts for the needs of question-answering (QA) systems. The method benefits from and is founded on Latent Semantic Analysis (LSA) technique. LSA serves as a hypothesis generator which produces hypotheses about the words that might be synonyms. Subsequently, the generated hypotheses are proven right or wrong by means of examination of morphologic bindings between the two words and of the overall syntactic structure of the context in which they appear, namely the subject-object relation. The retrieved synonyms are used to extend the search space where a QA system mines the answers.
KeywordsLatent Semantic Anal Question Answering Question Answering System Search Phrase Synonym Pair
Unable to display preview. Download preview PDF.
- 1.Konopík, M., Rohlík, O.: Question Answering for Not Quite Semantic Web. In: Proc. of 13th International Conference on Text, Speech and Dialogue TSD 2010, Brno, Czech Republic. Springer (2010)Google Scholar
- 2.Hajič, J.: Disambiguation of Rich Inflection (Computational Morphology of Czech), Prague, Czech Republic. Charles Univeristy Press, Karolinum (2004)Google Scholar
- 3.Hajič, J., Böhmová, A., Hajičová, E., Vidová Hladká, B.: The Prague Dependency Treebank: A Three-Level Annotation Scenario. In: Abeillé, A. (ed.) Treebanks: Building and Using Parsed Corpora, pp. 103–127. Kluwer, Amsterdam (2000)Google Scholar
- 5.Moraliyski, R., Dias, G.: Combination of Global and Local Attributional Similarities for Synonym Detection (2007), http://www.di.ubi.pt/~ddg/publications/Pliska2007.pdf
- 7.Jurgens, D., Stevens, K.: The S-Space Package: An Open Source Package for Word Space Models. System Papers of the Association of Computational Linguistics. University of California Los Angeles, Los Angeles (2010)Google Scholar