IP Library Granted Patent US 12,299,023
Granted Patent B2
US 12,299,023 · App. 17/766,557 · Granted May 13, 2025

Document retrieval system

Inventors: Junpei Momo (Sagamihara, JP); Hiromichi Godo (Isehara, JP)
Assignee: Semiconductor Energy Laboratory Co., Ltd.
G06F16/3347G06F40/268G06F40/284
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,299,023
App. No.
17/766,557
Granted
May 13, 2025
Kind
B2
Abstract

A document retrieval system that retrieves documents, with concepts of the documents taken into account, is provided. The document retrieval system ( 100 ) includes an input unit ( 101 ), a first processing unit ( 102 ), a storage unit ( 105 ), a second processing unit ( 103 ), and an output unit ( 104 ). The input unit ( 101 ) has a function of inputting a first document ( 20 ), the first processing unit ( 102 ) has a function of creating a first graph structure ( 21 ) from the first document ( 20 ), the storage unit ( 105 ) has a function of storing a second graph structure ( 11 ), the second processing unit ( 103 ) has a function of calculating a similarity between the first graph structure ( 21 ) and the second graph structure ( 11 ), the output unit ( 104 ) has a function of supplying information, the first processing unit ( 102 ) has a function of dividing the first document ( 20 ) into a plurality of tokens, a node and an edge of the first graph structure ( 21 ) have a label, and the label includes the plurality of tokens.

Claims (20)

1. A non-transitory computer readable storage medium having instructions stored thereon which, when executed by one or more processers, cause the one or more processers to perform operations for document retrieval, the operations comprising:

inputting a first document;

creating a first graph structure from the first document;

storing a second graph structure;

vectorizing the first graph structure and the second graph structure;

comparing the vectorized first graph structure and the vectorized second graph structure to perform document retrieval;

supplying information; and

dividing the first document into a plurality of tokens;

wherein an edge of the first graph structure comprises a label,

wherein the label comprises the plurality of tokens, and

wherein, in a case where the label has an antonym, generating a new graph structure by reversing a direction of the edge of the first graph structure and replacing the label of the edge by the antonym.

2. The non-transitory computer readable storage medium according to claim 1 , the operations further comprising giving a part of speech to a token.

3. The non-transitory computer readable storage medium according to claim 1 , the operations further comprising:

performing a modification analysis, and

wherein the processing unit is configured to combine some of the tokens in accordance with a result of the modification analysis.

4. The non-transitory computer readable storage medium according to claim 1 , the operations further comprising replacing a token having a representative word or a superordinate by the representative word or the superordinate.

5. The non-transitory computer readable storage medium according to claim 1 , wherein the second graph structure is created in the processing unit, from a second document.

6. The non-transitory computer readable storage medium according to claim 1 , the operations further comprising vectorizing the first graph structure and the second graph structure using Weisfeiler-Lehman Kernels.

7. The non-transitory computer readable storage medium according to claim 2 , the operations further comprising, in a case where a part of speech given to a first token is a noun and a part of speech given to a second token that is placed right before the first token is an adjective, combining the second token to the first token.

8. The non-transitory computer readable storage medium according to claim 2 , the operations further comprising, in a case where a part of speech given to a third token and a part of speech given to a fourth token that is placed right after the third token are each a noun, combining the third token to the fourth token.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 5, 2022
From: MOMO, JUNPEI; GODO, HIROMICHI
To: SEMICONDUCTOR ENERGY LABORATORY CO., LTD.
Reel/Frame 059501/0291 →
Priority Claims (1)
JP 2019-194187 · Oct 25, 2019 · national
Continuity (1)
Related Publication 20230026321A1 · Jan 26, 2023
References Cited (21)
US 20110270851A1 · Mishina et al. · 2011 [cited by applicant]
US 20130124525A1 · Anderson · 2013 [cited by examiner]
US 20140278362A1 · Gerken, III · 2014 [cited by examiner]
US 20160055196A1 · Collins · 2016 [cited by examiner]
US 20170262530A1 · Okura · 2017 [cited by examiner]
US 20180260474A1 · Surdeanu · 2018 [cited by examiner]
US 20190005035A1 · Yamazaki et al. · 2019 [cited by applicant]
US 20200349208A1 · Bajaj · 2020 [cited by examiner]
US 20200409963A1 · Higashi et al. · 2020 [cited by applicant]
US 20220004570A1 · Okano et al. · 2022 [cited by applicant]
CN 102236693A · 2011 [cited by applicant]
JP 2004272352A · 2004 [cited by applicant]
JP 2005258624A · 2005 [cited by applicant]
JP 2011233023A · 2011 [cited by applicant]
JP 2014052863A · 2014 [cited by applicant]
WO WO2020240312 · 2020 [cited by applicant]
Machine Translation of JP 2014052863A, by Yabe, Published on Mar. 20, 2014 (Year: 2014). [cited by examiner]
Article entitled “Node Ranking in Labeled Directed Graphs”, by Chitrapura et al., dated Nov. 13, 2004 (Year: 2004). [cited by examiner]
Article entitled “Detecting Similar Programs via the Weisdeiler-Leman Graph Kernel”, by Li et al., dated May 10, 2016 (Year: 2016). [cited by examiner]
International Search Report (Application No. PCT/IB2020/059619) Dated Dec. 15, 2020. [cited by applicant]
Written Opinion (Application No. PCT/IB2020/059619) Dated Dec. 15, 2020. [cited by applicant]