Claims1. computer-implemented method of generating answers to questions based on any corpus of data comprising the steps of:
2. The computer-implemented method of claim 1, wherein an input query comprises a string, a string with context, or a string with context wherein the context includes another string or data structure. 3. The computer-implemented method of claim 1, wherein said computing a LAT includes implementing a detection rule for detecting said LAT in a question or a candidate answer. 4. The computer-implemented method of claim 1, wherein said computing a LAT includes implementing a parser and/or semantic interpreter. 5. The computer-implemented method of claim 1, wherein said step of utilizing an automated scoring function for producing a score for each candidate answer received includes:
6. The computer-implemented method of claim 5, wherein the candidate answer type and LAT(s) comprise a lexical string, the matching is performed by using string matching. 7. The computer-implemented method of claim 5, wherein the candidate answer and LAT(s) comprise a lexical string or a set of strings, the matching including checking for one or more of synonym or hyponym relation between the LAT and a type. 8. The computer-implemented method of claim 1, wherein a type is a lexical item and is or is not part of a predetermined ontology. 9. The computer-implemented method as claimed in claim 1, further comprising:
10. A system for generating answers to questions based on any corpus of data comprising:
11. The system as claimed in claim 10, wherein each said plurality of scoring modules includes utilizing an automated scoring function means for producing a score for each candidate answer received, said automated scoring function means includes:
12. The system as claimed in claim 1, wherein the candidate answer type and LAT(s) comprise a lexical string, the matching is performed by using a matching means for string matching. 13. The system as claimed in claim 11, wherein the candidate answer and LAT(s) comprise a lexical string or a set of strings, said matching is performed using a matching means for checking for one of synonymy or hyponymy relation between the LAT and a type. 14. The system as claimed in claim 11, further comprising:
15. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for generating answers to questions based on any corpus of data, said method steps including the steps of:
16. The program storage device readable by a machine as claimed in claim 15, wherein said computing a LAT includes one of: implementing a detection rule for detecting said LAT in a question or a candidate answer, or implementing a parser and/or semantic interpreter. 17. The program storage device readable by a machine as claimed in claim 16, wherein said step of utilizing an automated scoring function for producing a score for each candidate answer received includes:
18. The program storage device readable by a machine of claim 17, wherein the candidate answer and LAT(s) comprise a lexical string, the matching is performed by using string matching. 19. The program storage device readable by a machine of claim 17, wherein the candidate answer type and LAT(s) comprise a lexical string or a set of strings, the matching including checking for one or more of synonym or hyponym relation between the LAT and a type. 20. A method of deploying a computer program product for generating answers to questions based on any corpus of data, wherein, when executed, the computer program performs the steps of:
21. The method of deploying a computer program product as claimed in claim 20, wherein said step of utilizing an automated scoring function for producing a score for each candidate answer received includes:
22. The method of deploying a computer program product as claimed in claim 20, wherein said degree of match represents a degree to which a candidate answer is coerced to the LAT. 23. The method of deploying a computer program product as claimed in claim 20, wherein the candidate answer type and LAT(s) comprise a lexical string, the matching is performed by using string matching. 24. The method of deploying a computer program product as claimed in claim 20, wherein the candidate answer and LAT(s) comprise a lexical string or a set of strings, the matching including checking for one or more of synonym or hyponym relation between the LAT and a type. 25. The method of deploying a computer program product as claimed in claim 20, further comprising:
|