Table of Contents
- IMPORTANT NOTICE
- Introduction to the Project
- Some information about LSA-Bot
- The software is by no means complete and is still at a very early stage.
- I am in the process of cleaning the code a bit, removing the unnecessary files and finding a solution to host the large raw data files needed by the software.
- The preliminary scripts needed to preprocess the text are included in the repository but it is not given yet a clear set of instructions to run them.
- the data folder, due to its large dimension, has been compressed and needs
to be extracted in order to work with LSA-Bot.
The archive is also hosted at: https://bitbucket.org/slabua/lsabot/downloads/data.tar.bz2
Introduction to the Project
- LSA-Bot is a new, powerful kind of Chat-bot incentred on Latent Semantic Analysis.
- Using LSA it is possible to make relationships among words and vectors, permitting to realize an intelligent chat-bot that can understand human language and answer as well.
Some information about LSA-Bot
- I developed LSA-bot at university since 12-sept-2004 (first class birthdate).
- LSA-Bot is written in Java and it works thanks to the LSA (Latent Semantic Analysis) theory applied to a large amount of text documents (corpus). There are many Chat-bot systems, most of them are using the AIML language to recognize users’ questions and bots can answer to the users, but the botmaster has to think about all kind of question a user can make to the bot.
- Using LSA is possible to give something intelligence to the chat-bot, permitting to ignore, for instance, wrong words, stop-words and all isn’t needed in the meaning of a sentence.
- LSA-bot uses the vectors related to every words found in the corpus to compute the ‘distance’ between user’s question and all possible answers, that can be simpliest sentences, small documents, or whatever the programmer wish to do. Word’s vectors are obtaines using the Singular Value Decomposition (SVD) onto the matrix built from words’ occurrences in the documents, using Matlab or other software that permit a singular value decomposition. Obtained the vectors we need, LSA-bot uses them to create vectors for every words, and every question a user can make. The distance among the question and verosimilar answers can be done by compute the cosine distance, rejection over projection, tanimoto… The answer related to the vector that satisfy the minimum distance will be shown to the user.
- Another feature is that the knowledge-base of LSA-bot can be improved (learn-mode) by specify a new sentence the bot has to learn; a new representing vector will be computed and added to others.
This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.