http://rdf.ncbi.nlm.nih.gov/pubchem/patent/AU-2010285122-A1
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_b07535daf514bb95da97363e5085da8a |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24522 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24578 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-9537 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-3338 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
| filingDate | 2010-08-10-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_455aee925fab1dac15059d93c1e77768 |
| publicationDate | 2012-03-08-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | AU-2010285122-A1 |
| titleOfInvention | Method and means for data searching and language translation |
| abstract | The invention relates to data searching and translation. In particular, the invention relates to searching documents from the Internet or databases. Even further, the invention also relates to translating words in documents, WebPages, images or speech from one language to the next. A computer implemented method comprising at least one computer in accordance with the invention is characterised by the following steps: receiving a search query comprising at least one search term, deriving at least one synonym for at least one search term, expanding the received search query with the at least one synonym, searching at least one document using the said expanded search query, retrieving the search results obtained with the said expanded query, ranking the said search results based on context of occurrence of at least one search term. The best mode of the invention is considered to be an Internet search engine that delivers better search results. |
| priorityDate | 2009-08-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 20.