http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2018081451-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_1af8df51ce24ca931ae718fb747f6aa0 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06K9-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06K9-72 |
| filingDate | 2016-11-15-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_8fe8441c4528f0904a79af90c0319859 |
| publicationDate | 2018-05-24-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | JP-2018081451-A |
| titleOfInvention | Information processing apparatus and control method thereof |
| abstract | A technique for enabling more efficient character string search is provided. An information processing apparatus for searching for a specific term included in a given dictionary from a character string searches a partial string of the character string with respect to the given dictionary using an n-gram method, Extraction means for extracting one or more specific term candidates included in a character string from a given dictionary, and for each of the one or more specific term candidates, a specific term candidate and the specific term candidate using the DP matching method Derivation means for deriving an edit distance with a partial character string in a character string corresponding to, and outputting a partial character string in the character string corresponding to the one or more specific term candidates whose edit distance is shorter than a predetermined threshold Output means. [Selection] Figure 2 |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-7268389-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2019187622-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2019187621-A |
| priorityDate | 2016-11-15-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: 29.