- Audio of the call is converted to text
- 5 words are essential from a 1000 words text file...
The words imp for a policy company will be policy no. and customer name.
Company: How May i help u...
Person : I have an issue.
Company : Sir may I know your Policy no. and your Name?
Person: XYZ policy no. ABC name
Company: Please tell us our issue?
.....
Now in this conversation the policy no, name and issue are important keywords and the answer replied to is stored respectively in database.
If the same person calls again.. then it is updated in the database rather than creating a new record.
- these words depends on the conversation.
- For an Insurance company: words asked will be policy number and issue of the user.
- I know JAVA. Is this sufficient to code the best solution?
- I don't want to code the basic solution. Searching a keyword with each string in the text. I would want a more sophisticated solution to it.
- Should I learn courses like AI, NLP to get best outcomes
- Which are the Best algorithms ?
I would recommend a BufferedReader as shown here: http://www.coderslexicon.com/search-a-text-file-in-java/
I think this cousera course would provide a good background: https://www.coursera.org/learn/text-retrieval
Are those 5 words decided previously? Or these words are what you need to find in the text (that is, you do not know yet what words will appear). If the case is the former, I think you deal with regular expression (regex). I am not sure if there is any Java regex library, but I think it indeed exists in Java.
You surely can extract the keywords, but normally, the concepts you look for in the text can be represented in various forms (both semantically and morphologically). So the best choice is to do some investigation of the language processing and machine learning techniques. You can definitely can code that in Java. But consider collaboration with an experienced team for that project. We have one, so feel free to contact me, if interested.
Search for the first character of the word in the text (call LOC). If there is a match, then compare the next character in the word with the next one in the text (LOC + x: x is worth from 1 to word length), until all match or fail. If it fails check the first character of the word with LOC + 1 locas on the text. etc.
- Badges
- Science topic
- Similar topics
- Psychology
- Mental Processes
- Learning