Method for extracting entries from a database

• US 10,467,265 B2
• Filed: 11/27/2017
• Issued: 11/05/2019
• Est. Priority Date: 05/22/2017
• Status: Active Grant

• Current Assignee: Searchmetrics GmbH
• Original Assignee: Searchmetrics GmbH
• Inventors: Xu, Fang, Tober, Marcus
• Primary Examiner(s): Saeed, Usmaan
• Assistant Examiner(s): Zhao, Yu
• Application Number:
  US15/822,738
• Publication Number:
  US 20180336268A1
• Time in Patent Office: 708 Days
• Field of Search: None
• CPC Class Codes: G06F 16/3334 Selection or weighting of terms from queries, including natural language queries
• CPC Class Codes: G06F 16/3344 using natural language analysis
• CPC Class Codes: G06F 16/3347 using vector based model
• CPC Class Codes: G06F 18/22 Matching criteria, e.g. proximity measures
• CPC Class Codes: G06F 40/295 Named entity recognition
• CPC Class Codes: G06V 30/1983 Syntactic or structural pattern recognition, e.g. symbolic string recognition

Abstract

The present teachings generally relate to a method for extracting one or more matched entries from a first database using a second database, including the steps of: identifying a plurality of second entities from the second database by filtering a plurality of entities of the second database according to one or more identification rules; inputting at least one keyword as a query to extract the one or more matched entries from the first database; linking the at least one keyword to one or more second entities according to one or more linking rules to define one or more linked second entities; matching the one or more linked second entities to one or more entries in the first database according to one or more matching rules to define the one or more matched entries; and extracting the one or more matched entries from the first database.

Claims

1. A computer-implemented method for creating and editing content of a website to be ranked higher by one or more search engines by extracting one or more matched entries from a first database using a second database comprising the steps of:

(a) identifying a plurality of second entities from the second database by filtering a plurality of entities of the second database according to one or more identification rules by one or more processors,

wherein the second database is;

(i) stored within one or more non-transient storage devices;

(ii) a text representation of at least part of an Internet-based encyclopedia;

wherein the one or more identification rules comprise;

(i) filtering the plurality of entities of the second database according to a named-entity recognition filter to recognize and isolate named entities within the second database;

(ii) calculating a vector form of each of the named entities; and

(iii) outputting the vector form of each of the named entities as the plurality of second entities;

(b) inputting into one or more user interfaces by a user at least one keyword which is related to the content of the web site as a query to extract the one or more matched entries from the first database, wherein the first database is;

(i) stored within the one or more non-transient storage devices;

(ii) is smaller than the second database; and

(iii) includes one or more text files related to goods, services, or clients of the user;

(c) automatically linking the at least one keyword to one or more second entities by the one or more processors according to one or more linking rules to define one or more linked second entities, wherein;

i) the at least one keyword is related to the content of the website;

ii) the one or more linking rules comprise linking the at least one keyword to one or more linked entities which comprise at least a part of the at least one keyword; and

iii) the part of the at least one keyword is between 60% or more of a length of the keyword and 100% or less of the length of the keyword;

wherein the one or more linking rules include calculating how much of a portion of the at least one keyword is present in the one or more second entities, a vector distance between a vector representation of the at least one keyword and the one or more second entities, or both;

wherein the one or more linking rules specify a predetermined quantity the portion of the at least one keyword which must be present in the one or more second entities to link the at least one keyword with the one or more linked second entities;

(d) automatically matching the one or more linked second entities to one or more entries in the first database by the one or more processors according to one or more matching rules to define the one or more matched entries;

(e) automatically extracting the one or more matched entries from the first database by the one or more processors; and

(f) creating and editing the content of the website by the user by including the one or more matched entries on the website so that the webpage will become more relevant according to the one or more keywords and will be ranked higher by the one or more search engines to attract traffic to the website.

2. The method according to claim 1, wherein the second database comprises a volume of text equal to or larger than 40 GB.

3. The method according to claim 2, wherein the volume of text is retrieved from the Internet.

4. The method according to claim 1, wherein the one or more entries, the plurality of second entities, and/or the at least one keyword comprise a string and a vector.

5. The method according to claim 1, wherein the one or more identification rules further comprise, between the filtering the plurality of entities and the outputting:

annotating one or more of the named entities of the second database to associate the named entities with one or more logical entities; and

disambiguating at least one of the entities of the second database which are ambiguous according to one or more disambiguation rules.

6. The method according to claim 5, wherein the one or more disambiguation rules comprise:

calculating a cosine distance between at least one ambiguous named entity and each of the plurality of recognized named entities close to the ambiguous named entity,

outputting one of the plurality of recognized named entities corresponding to a smallest distance among those calculated in the calculating step.

7. The method according to claim 1, wherein the part of the at least one keyword is between 80% or more of the length of the keyword and 100% or less of the length of the keyword.

8. The method according to claim 1, wherein the one or more matching rules comprise calculating a distance between the one or more linked second entities and the one or more entries.

9. The method according to claim 1, wherein the one or more identification rules include evaluating text within the second database to identify one or more logical entities within the text and discarding text which does not represent the one or more logical entities.

10. The method according to claim 1, wherein the method includes a step of populating the first database with the one or more entries by the user.

11. The method according to claim 1, wherein the method includes initiating population of the second database with a plurality of entries from the Internet-based encyclopedia.

12. A computer-implemented method for creating and editing content of a website to be ranked higher by one or more search engines by extracting one or more matched entries from a first database using a second database comprising the steps of:

a) providing a first database and a second database, each populated with a plurality of entities, wherein the first database and the second database reside within one or more non-transient storage devices, wherein the first database includes text files of information related to goods, services, or clients of a user, and wherein the second database is a text representation of at least part of an Internet-based encyclopedia;

b) based upon user input via one or more user interfaces by the user in communication with the first database and the second database, automatically generating a plurality of identified second entities by one or more processors by filtering the entities of the second database according to one or more identification rules, wherein the identification rules comprise;

i) filtering the plurality of entities of the second database according to a named-entity recognition filter to recognize and isolate named entities within the second database;

(ii) calculating a vector form of each of the named entities; and

(iii) outputting the vector form of each of the named entities as the plurality of second entities;

c) automatically evaluating by the one or more processors one or more keywords inputted by the user into the one or more user interfaces and the plurality of identified second entities according to one or more linking rules to filter the plurality of identified second entities and define a plurality of linked second entities, wherein the one or more keywords are related to content of a website, and wherein the one or more linking rules include;

(i) calculating a plurality of vector distances between a vector representation of the one or more keywords and the plurality of identified second entities;

(ii) sorting the plurality of vector distances;

(iii) selecting an individual vector distance which is the smallest from the plurality of vector distances; and

(iv) linking the one or more keywords and an identified second entity associated with the individual vector distance;

d) automatically generating one or more matched entries with the one or more processors by applying one or more matching rules to the plurality of linked second entities and matching with one or more entries of the first database;

e) automatically extracting the matched one or more entries by the one or more processors; and

f) creating and editing the content of the website by the user by including the one or more matched entries on the website so that the webpage will become more relevant according to the one or more keywords and will be ranked higher by the one or more search engines to attract traffic to the website.

13. The method of claim 12, wherein the one or more linking rules include calculating how much of a portion of the one or more keywords is present in one or more of the plurality of identified second entities;

wherein the one or more linking rules include linking the one or more keywords to one or more of the identified second entities if the portion of the one or more keywords is between 60% to 100% of the one or more keywords.

14. The method of claim 12, wherein the one or more matching rules include:

calculating a plurality of vector distances between a vector representation of the plurality of linked second entities and the one or more entries of the first database;

sorting the plurality of vector distances;

selecting an individual vector distance which is the smallest from the plurality of vector distances; and

linking the one or more entries of the first database and a linked second entity associated with the individual vector distance.

15. The method according to claim 12, wherein the second database comprises a volume of text equal to or larger than 40 GB.

16. The method according to claim 12, wherein the method includes initiating population of the second database with a plurality of entries from the Internet-based encyclopedia.