WO2014128736A1 - Thesaurus structure and associated semantic search method - Google Patents
Thesaurus structure and associated semantic search method Download PDFInfo
- Publication number
- WO2014128736A1 WO2014128736A1 PCT/IT2013/000056 IT2013000056W WO2014128736A1 WO 2014128736 A1 WO2014128736 A1 WO 2014128736A1 IT 2013000056 W IT2013000056 W IT 2013000056W WO 2014128736 A1 WO2014128736 A1 WO 2014128736A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- card
- nodes
- section
- cards
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/374—Thesaurus
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A thesaurus structure (1) comprising: - at least one tree-like Subjects section (5) with a plurality of nodes (N), divided into sequential levels (L1-Ln), and connected together by at least one incoming branch, each node (N) having a thematic label (19); - a database (2) having a plurality of cards (3), each card comprising a description field (4) with keywords (6), a date field (4a1) with a validation date for the card (3), and a geographic location field (4b') with a geographical indication associated with the card (3), the database (2) further comprising a collection (90) of documents (8) that can be connected to the cards (3) through keywords (6); - iterative correlation means (21) that are adapted for defining direct connections (20) and descendant connections (30) between the nodes (N), as well as direct links (40) that are adapted for connecting together a node and a card (3) of the database (2) and descendant links (50) for connecting a descendant node to a card (3) connected by a direct link (40) to one of said nodes (N), - selector means (22) that are adapted for selecting a group (23) of cards (3) for a selected node (Ν') of the Subjects section (5), wherein each selected card (3') that is coupled by a direct link (40) or a descendant link (50) to the selected node (Ν') comprises a card-node weighting index (70) that is adapted for defining a sequential ranking of the selected cards (3'), the card-node weighting index (70) being defined by statistically processing the number of keywords (6) contained in the selected cards (3') and in the documents (8) of the collection (90).
Description
Thesaurus structure and associated semantic search method
DESCRIPTION
Field of the invention
The present invention relates to a thesaurus structure.
The present invention also relates to a semantic search method in a thesaurus structure of the present invention.
Description of the Background Art
The word "thesaurus" is known to designate a collection of terms that tends to provide complete information in certain technical fields and/or historical periods.
The use of a thesaurus structure is known to consist in searching text and/or multimedia contents in a connection of documents by general classes or through synonyms. A given number of terms are mutually connected by respective links or appropriate codes based on synonymic relationships or hierarchical dependencies aimed at allowing automatic document search.
In some alternative information systems the document collection is indexed, and search results are located by conventional search techniques, by introduction of appropriate queries and computational methods.
While prior art thesaurus structures and automatic document and information searches are adequate in many respects, they still suffer from certain drawbacks.
Searches are based on methodic or subject matches between the terms that compose the thesaurus structure, and hence have inherent restrictions. Furthermore, searches of indexed systems may be frustrating, due to loss of relevance in retrieved documents, and the terms that are used in queries may be restrictive or may not be exhaustive with respect to the particular interest of the query.
In other cases, a rather great number of documents is queried, whereby the retrieval of actually relevant documents is a time-consuming operation.
In the light of the above prior art, one of the objects of the present invention is to provide a thesaurus structure and a semantic search method that allow to carry out broad-spectrum
searches through a guided combination of search results.
A further object is to provide a search method that affords automatic correlation between the words of the thesaurus structure.
Another object is to provide a dynamic structure that allows fast and effective updating of documents and their relevance.
A further object of the invention is to provide a structure and a method that can be easily implemented in a multimedia and/or audiovisual medium.
Another object of the invention is to provide search results to the public in printed or digital form.
Yet another object of the invention is to provide a simple and efficient thesaurus structure that affords semantic searches with consistent search results.
A further object is to provide a dynamic search environment, with a thesaurus structure that can be easily implemented with fast updating of the document collection.
Summary of the invention
The idea of solution proposed by the present invention is in providing a dynamic correlation between the collection documents and the thesaurus structure.
Starting from this idea of solution, the technical problem is solved by a thesaurus structure as discussed hereinbefore and defined by the characterizing part of claim 1.
The problem is also solved by a semantic search method as discussed and defined by the characterizing part of claim 1 1.
The features and advantages of the present invention will appear more clearly from the following detailed description of a preferred embodiment, which is given by way of illustration and without limitation in the annexed drawings, in which:
- Figure 1 is a schematic view of a thesaurus structure according to the present invention; - Figures 2-4 are schematic views of a branch of the tree of the Subject section of Figure
1 ;
- Figure 5 is a schematic view of a node connection to a selected card and document
group according to the present invention.
- Figure 6 shows a list of documents associated with the Music node as shown in Figure 5, with the number of single and multiple occurrences for each document, according to the present invention;
- Figure 7 schematically shows the first documents of the list of Figure 6, with their respective single occurrences;
- Figure 8 schematically shows Figure 7 with the connections to two cards selected and associated with the Music node;
- Figure 9 schematically shows four different modes that can be used to define the node- card weighting;
- Figures 10 and 1 1 schematically show two results of a semantic search in a thesaurus structure of the present invention.
Disclosure
Figure 1 shows by way of illustration and without limitation a scheme of a thesaurus structure 1 according to the present invention.
The thesaurus structure 1 is a hierarchical structure and comprises at least one tree-like Subjects section 5 with a plurality of nodes N, divided into sequential levels Li-L . Each node N of a level Lx+1 is connected by at least one incoming branch to a node N of a higher level Lx. In this embodiment, each incoming branch connects a parent node to a child node, in a hereditary system.
Each node N comprises a thematic label 1 which is adapted to group such nodes N into corresponding thematic sub-sections.
In one embodiment, referring to Figure 2, in the Subject section 5 the nodes N are divided into a Discipline sub-section 15a and a Concept sub-section 15b.
The thesaurus structure 1 further comprises a database 2 in which a plurality of cards 3 are stored, each card having a description field 4 comprising a plurality of keywords 6, each keyword 6 being comprised in a base group 7 of keywords, which is preferably stored in said
database 2. The database 2 also comprises a collection 90 of documents 8, which are adapted to be connected to the cards 3 according to said keywords 6 contained in each document 8 and each card 3.
The thesaurus structure 1 further comprises iterative correlation means 21 which are adapted to define:
- direct connections 20 between the nodes N of the Subject section 5, which are substantially defined by incoming branches associated with the nodes N;
- descendant connections 30 for connecting together nodes N belonging to levels separated by two or more levels, such descendant connections 30 consisting of a first correlation defined by the thematic labels 19 of the connected nodes N.
Furthermore, the iterative correlation means 21 are adapted to define:
- direct links 40, for connecting together one node and one card 3 of the database 2, the direct links 40 consisting of a second correlation between the thematic label 19 of said node N and the keywords 6 associated with said card 3;
- descendant links 50 where, considering a descendant node connected to a node by a descendant connection 30, a descendant link 50 connects the descendant node to one of said cards 3 connected by a direct link 40 to said node N. The descendant links 50 consist of a third correlation between said thematic label 19 of said descendant node and said keywords 6 associated with the card 3.
In one embodiment, the first, second and third correlations are automatically defined according to assessment rules and criteria that comprise a preset thematic classification or a manual association.
In an illustrative, non-limiting example, as shown in Figure 4, the Music node has a direct connection 20 with the Musical Instruments node, and a descendant connection 30 with the Piano node. The Musical Instruments node has in turn a direct connection 20 with the Piano node N. The Piano node N is in turn connected by a first direct link 40 to the Mozart card and by a second direct link 40 to the Ludwig van Beethoven card. The descendant Music node of the Piano node
N is in turn connected by a first descendant link 50 to the Mozart card and by a second descendant link 50 to the Ludwig van Beethoven card.
The thesaurus structure 1 further comprises selector means 22 for selecting a group 23 of cards 3 for a selected node N' of said Subjects section 5, and for providing a spreadsheet comprising the group 23 of selected cards 3'. Particularly, each of the selected cards 3' of said group 23, which is coupled by a direct link 40 or a descendant link 50 to the selected node N', comprises a card-node weighting index 70. The card-node weighting index 70 is adapted to define a sequential ranking of the selected cards 3' of the group. Particularly, the weighting index 70 is defined by statistic processing of the number of keywords 6 in the selected card 3' and in each document 8 of the collection 90.
Furthermore, the selector means 22 comprise an indexing unit 24, which is adapted to define the card-node weighting index 70 for each of the selected cards 3'. In one embodiment, the selector means 22 comprise processing programs having appropriate data analysis algorithms.
Particularly, the indexing unit 24 comprises correlation means 25, which are adapted to analyze each document 8 of the collection 90 and define an occurrence 26 for each keyword 6 comprised both in the document 8 and in the description field 4 of the selected card 3'.
Each document 8 might score multiple occurrences 26 of keywords 6 to the selected card 3'. In this case, in one embodiment, a single occurrence 26 is counted for each keyword 6.
The indexing unit 24 further comprises adder means 27, that are designed to determine, for each document 8, the sum of the single occurrences 26 to said selected cards 3' of said group 23, associated with each selected node N', thereby defining a partial document-card weighting index 28.
Furthermore, the adder means 27 are adapted to define, for each of the selected cards 3', the card-node weighting index 70, by a weighted sum of the occurrences 26, using said partial document-card weighting indices 28. Thus an occurrence 26 that reaches the selected card 3' from a document 8 having a higher partial document-card weighting index 28 as compared with another document 8, has a higher weight in the definition of the weighting index 70.
This will provide a guided combination of the selected cards 3' in said group 23 that may be displayed as results of a search that comprises said selected node N'.
Preferably, the collection 90 of documents 8 and the base group 7 of keywords 6 are dynamically updated using updating means, not shown, which are activated periodically or upon request. Furthermore, the interactive correlation means 25 are controlled by control means that are designed to activate the indexing unit 24 at every update of the collection 90 of documents 8 and the basegroup 7 of keywords 6. Thus, the card-node weighting index 70 of each of the selected cards 3' is updated, and the ranking of said selected cards 3' in said group 23 associated with the selected node N' is also updated.
Advantageously, the selected nodes N' are comprised in the Discipline sub-section 15a only. Thus, each node N of the Concept sub-section 15b displays the sequential ranking of the selected cards 3' connected to a descendant node N', which belongs to the Discipline sub-section 15a and is connected thereto by a descendant connection 30. Therefore, the computational and updating load is reduced, while guided searches in said Subject section 5 still achieve optimal results.
In one embodiment, each card 3 comprises a hypertext in the description field 4, with connections to further documents 8 or portions of documents 8, images, multimedia inserts, videos, pictures, graphics and else, all of these documents 8 being appropriately stored in the database 2. Furthermore the description field 4 is written in a XML (extensible Markup Language) language, comprising special tags for assigning semantics to the text contained in the description field 4, a type character, the text structure divided into chapters, paragraphs, etc.
The card 3 may comprise a date field 4a' designed to contain a validation date for the card 3 and a geographic location field 4b1, designed to contain a geographic indication associated with the card 3.
It shall be noted that the description field 4 of each card 3 has a dynamic content, that can be inherently updated by a simple update through the tags. Otherwise, the description field 4 may be updated in extrinsic fashion through iterative correlation means 21, which can change and/or
update the links/connections to the nodes N of the Subjects section 5 and to the documents 8 if new nodes N or new documents 8 are added in the thesaurus structure 1 or if the keywords 6 contained in the base group 7 are changed.
Furthermore, the thesaurus structure 1 comprises:
- a second tree-like Persons section 105 with a second plurality of nodes N2, which are divided into groups of persons, and
- a third tree-like Geography section 115 comprising a third plurality of nodes N3.
The iterative correlation means 21 define, through further correlations, appropriate stepchild links 45, allowing connection of a selected node N' of the Discipline sub-section 15a of the Subjects section 5 with a second node N2 or a group of Persons of said second Persons section
105, or with a third node N3 of the third Geography section 115.
Advantageously, the third Geography section 115 is divided into a plurality of tree-like geographical sections 118, in which each geographical section 1 18 is defined according to a time base. Preferably, the time base is a solar year.
Therefore, the iterative correlation means 21 define step-child links 45 between the third nodes N3 of each geographical section 118 of said plurality and each selected node N' of the
Subjects section 5.
As an alternative to the above, the adder means 27 of said indexing unit 24 may assign to each selected card 3' a card-node weighting index 70 defined according to combinations of factors other than those indicated above, to define sequential rankings of cards alternative to that described above.
Particularly, as schematically shown in Figure 9, by the codes:
-a ALPHA: the indexing unit 24 counts the single occurrences 26 for each of the selected cards 3', whereas the document/book 8 is only considered if it is comprised in a previously defined ranking of the selected node N'.
-β BETA - the indexing unit 24 counts all the multiple occurrences 26 for each of the selected cards 3', whereas the document/book 8 is only considered if it is comprised in the
predefined ranking of the selected node N'. In this case, the occurrences 26 are counted multiple times for each keyword 6 through which they are retrieved.
-γ GAMMA: the above described arrangement applies, in which the indexing unit 24 counts the single occurrences 26, which are counted according to a sum weighted using the partial document-card weighting indices 28. In this case, retrieval from documents/books 8 having a higher partial weighting index 28 for the selected node N' has a higher value, whereby the selected card 3' is highlighted.
δ DELTA - the indexing unit 24 counts the total, i.e. multiple occurrences 26 for each selected card 3', and further considers occurrences 26 according to a sum weighted using the partial document-card weighting indices 28.
The Applicant found that the method γ GAMMA has the highest perfomance in terms of computational effectiveness and efficiency.
The present invention also relates to a semantic search method in a thesaurus structure 1 as described and illustrated above. In the following description, parts and details that have been described above with the same structure and function will be designated by the same reference numerals and letters.
The semantic search method comprises a previous correlation step in which direct connections 20 and descendant connections 30 are created between the nodes N of the Subjects section 5 and direct links 40 and descendant links 50 are also created between the nodes N and the cards 3.
Furthermore, the method comprises a selection step, for definition of selected nodes N' and selection of the cards 3 that will define, for each selected node N', a group of selected cards 3'. Therefore the group 23 of selected cards 3' may be formed and stored as an ordered information spreadsheet.
During the correlation step, correlation rules are used, which are defined by iterative correlation means 21, having processing programs with one or more assignment algorithms for correlation of the thematic labels 19 of the nodes N. Likewise, the selection step uses other
selection rules having an assignment algorithm for correlation of the thematic labels 19 of the nodes N and the keywords 6 contained in the description field 4 of each selected card 3'.
Furthermore, according to the invention, the selection step comprises an indexing step that processes the number of occurrences 26 in each selected card 3 ' and defines, by an algorithmic combination of the number of occurrences 26, the card-node weighting index 70 for each selected card 3' of the group 23 associated with the selected node N'. The occurrences 26 combine the keywords 6 contained in the selected cards 3', as well as in the documents 8 of the collection 90.
Preferably, this algorithmic combination comprises previous definition of a partial document-card weighting index 28 according to the number of the occurrence 26 that associates the selected card 3' from each document 8. Therefore, the algorithm combination involves a weighted sum of the occurrences 26 that reach each card 3' according to the partial document- card weighting index 28.
The method of the invention further comprises the steps of:
- acquiring a query comprising at least one search element;
- processing the query by:
generating, for each search element, a connection network between one node N of the Suject section 5 and at least one of the selected nodes N'. The connection network is a plurality of cascade links and is defined through the direct connections 20 and the descendant connections 30 which are sequentially connected from one node N to a selection node N'.
Queries are thus processed by displaying the selected cards 3' for each selected node N' of the defined connection network, and by displaying said selected cards 3' in a sequential list based on the associated weighting index 70.
Also, with this method, when the connection networks reach two or more selected nodes N', the sequential list of the selected cards 3' is defined through a further weighted combination of the selected cards 3' associated with said two or more selected nodes N', said weighted combination being still defined through the weighting indices 70 associated with each selected
card 3'.
Also, in this method, if the thesaurus structure 1 also comprises the second Persons section 105 and a third Geographical Indications section 1 15, the connection network connects the second node N2 or the third node N3 with one or more selected nodes N' of the Discipline sub-section 15a and hence with the respective selected cards 3'.
Furthermore, if the query comprises a historical period, the connection network associates beforehand the geographical sections 118 corresponding to the historical period that has been searched for, by identifying a sub-group of geographical sections 1 18 and hence, connects the third nodes N3 of the geographical sections 1 18 identified by the selected nodes N1 of the Subjects section 5.
It will be appreciated from the above that the thesaurus structure and the method of the present invention obviate the prior art drawbacks as mentioned above. Particularly, the structure affords quick and effective searches, due to the creation of a weighted ranking of the cards associated with the selected nodes by passing through the collection of documents using keywords.
Those skilled in the art will obviously appreciate that a number of changes and variants may be made to the arrangements as described hereinbefore to meet incidental and specific needs, without departure from the scope of the invention, as defined in the following claims.
Claims
1. A thesaurus structure (1) comprising:
- at least one tree-like Subjects section (5) with a plurality of nodes (N), divided into sequential levels (L!-LN), each node (N) of one level (Lx+1) being connected by at least one incoming branch to a node (N) of a higher level (Lx), each node (N) comprising a thematic label (19);
- a database (2) comprising:
- a plurality of cards (3), each having a description field (4) that comprises keywords (6) comprised in a base group (7) of keywords, and
- a collection (90) of documents (8) that can be associated with said cards (3);
characterized in that it comprises:
- iterative correlation means (21) that are adapted for defining:
- direct connections (20) between said nodes (N) of said at least one Subject section (5), which are defined by said incoming branches associated with said nodes (N);
- descendant connections (30) for connecting together nodes (N) belonging to levels separated by two or more levels, said descendant connections (30) being defined by a first correlation defined by said thematic labels (19) of said connected nodes (N);
- direct links (40), for connecting together one node and one card (3) of said database (2), said direct links (40) being defining by a second correlation between said thematic label (19) of said node (N) and said keywords (6) of said card (3);
- descendant links (50) where, considering a descendant node connected to a node (N) by a descendant connection (30), a descendant link (50) connects said descendant node to one of said cards (3) connected by a direct link (40) to said node (N), said descendant links (50) being defined by a third correlation between said thematic label (19) of said descendant node and said keywords (6) of said card (3);
- selector means (22) that are adapted for selecting a selected group (23) of cards (3) for a selected node (Ν') of said Subject section (5), wherein each selected card (3') that is coupled by a direct link (40) or a descendant link (50) to said selected node (Ν') comprises a card-node
weighting index (70) that is adapted for defining a sequential ranking of said selected cards (3'), said card-node weighting index (70) being defined by statistically processing the number of keywords (6) contained in said selected cards (3') and in said documents (8) of said collection (90).
2. A thesaurus structure as claimed in claim 1 , characterized in that said selector means (22) comprise an indexing unit (24), which is adapted to define said card-node weighting index (70) for each of the selected cards (3'), said indexing unit (24) comprising correlation means (25), which are adapted to analyze each document (8) of said collection (90) and define an occurrence (26) for each keyword (6) comprised in said document (8) and in said selected card (3'), for each document (8), the sum of the occurrences (26) to said selected cards (3') of said group (23) defining a partial document-card weighting index (28).
3. A thesaurus structure as claimed in claim 2, characterized in that said indexing unit (24) comprises adder means (27) that are adapted for defining, for each of the selected cards (3'), said card-node weighting index (70), by a weighted sum of the occurrences (26), using said partial document-card weighting indices (28).
4. A thesaurus structure as claimed in claim 2, characterized in that said adder means (27) define, for each card (3), a single occurrence (26) for each keyword (6) between each document (8) of said collection (90) and said card (3).
5. A thesaurus structure as claimed in claim 1, characterized in that said collection (90) of documents (8) and said base group (7) of keywords (6) are dynamically updated and in that said iterative correlation means (21) are controlled by control means, which are adapted to update said card-node weighting indices (70) of said selected cards (3').
6. A thesaurus structure as claimed in claim 1, characterized in that said tree of said Subjects section (5) is divided into a Discipline sub-section (15a) and a Concept sub-section (15b), said Discipline sub-section (15a) comprising said selected nodes (Ν').
7. A thesaurus structure as claimed in claim 1, characterized in that each node (N) of said Subjects section (5) further comprises a date field (4'a) comprising a validating date for said card
(3) and a geographic location field (4'b) comprising a geographical indication associate with the card (3).
8. A thesaurus structure as claimed in one or more of claims from 1 to 7, characterized in that it comprises a second tree-like Persons section (105) with a second plurality of nodes (N2) divided into Persons groups and in that it comprises a third tree-like Geography section (115) comprising a third plurality of nodes (N3).
9. A thesaurus structure as claimed in claim 8, characterized in that said third Geography section (115) is divided into a plurality of tree-like geographical sections (118), in which each geographical section (118) is defined according to a time base (Tl), said time base being preferably a solar year.
10. A thesaurus structure as claimed in one or more of claims from 1 to 9, characterized in that said iterative correlation means (21) define step-child links (45) between said second nodes (N2) of said second Persons section (105) and said third nodes (N3) of said third Geography section (115), with said selected nodes (Ν') of said Subjects section (5), said step-child links (45) being defined by a third correlation between the thematic labels (19) of said selected nodes (Ν') and respective thematic fields of said nodes of said second Persons section (105) of said third Geography section (1 15).
11. A semantic search method of a thesaurus structure (1), said thesaurus structure being formed as claimed in one or more of claims from 1 to 10, characterized in that it comprises:
- a previous correlation step in which said direct connections (20) and said descendant connections (30) are created between the nodes (N) of said Subjects section (5) and said direct links (40) and said descendant links (50) are also created between said nodes (N) and said cards (3);
- a selection step, in which said selected nodes (Ν') are defined and selected cards (3') are selected to define a selected group (23) for said selected node (Ν'), said selection step further comprising an indexing step, in which a weighting index (70) is defined for each selected card (3') of said group (23);
said method further comprising the steps of:
- acquiring a query comprising at least one search element;
- processing the query by:
generating, for each search element, a connection network between one node (N) of said tree of said at least one Sujects section (5) and at least one of said selected nodes (Ν'), said connection network sequentially comprising said direct connections (20) and said descendant connections (30);
displaying, for each selected node (Ν') in said connection network, said selected cards (3'), which are displayed in a sequential list according to said weighting index (70).
12. A semantic search method as claimed in claim 11, characterized in that, when said search elements define two or more selected nodes (Ν') in said connection networks, said sequential list of said selected cards (3') is defined by a weighted combination of said selected cards (3') according to said associated weighting indices (70).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/IT2013/000056 WO2014128736A1 (en) | 2013-02-20 | 2013-02-20 | Thesaurus structure and associated semantic search method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/IT2013/000056 WO2014128736A1 (en) | 2013-02-20 | 2013-02-20 | Thesaurus structure and associated semantic search method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2014128736A1 true WO2014128736A1 (en) | 2014-08-28 |
Family
ID=48143335
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/IT2013/000056 WO2014128736A1 (en) | 2013-02-20 | 2013-02-20 | Thesaurus structure and associated semantic search method |
Country Status (1)
| Country | Link |
|---|---|
| WO (1) | WO2014128736A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| RU2639652C1 (en) * | 2016-07-13 | 2017-12-21 | Общество с ограниченной ответственностью "ЭсДиАй Рисёчь" | System of semantic search in object-process data model |
| CN108647276A (en) * | 2015-05-11 | 2018-10-12 | 何杨洲 | A kind of searching method |
| CN109271528A (en) * | 2018-09-30 | 2019-01-25 | 税友软件集团股份有限公司 | A kind of result queries method, apparatus and storage medium based on tax semanteme |
| US10678820B2 (en) | 2018-04-12 | 2020-06-09 | Abel BROWARNIK | System and method for computerized semantic indexing and searching |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080033932A1 (en) * | 2006-06-27 | 2008-02-07 | Regents Of The University Of Minnesota | Concept-aware ranking of electronic documents within a computer network |
-
2013
- 2013-02-20 WO PCT/IT2013/000056 patent/WO2014128736A1/en active Application Filing
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080033932A1 (en) * | 2006-06-27 | 2008-02-07 | Regents Of The University Of Minnesota | Concept-aware ranking of electronic documents within a computer network |
Non-Patent Citations (1)
| Title |
|---|
| "A Framework for semantic mapping between thesauri", ACM, 2 PENN PLAZA, SUITE 701 - NEW YORK USA, 1 December 2008 (2008-12-01) - 4 December 2008 (2008-12-04), XP040462175 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108647276A (en) * | 2015-05-11 | 2018-10-12 | 何杨洲 | A kind of searching method |
| CN108647276B (en) * | 2015-05-11 | 2022-04-05 | 何杨洲 | Searching method |
| RU2639652C1 (en) * | 2016-07-13 | 2017-12-21 | Общество с ограниченной ответственностью "ЭсДиАй Рисёчь" | System of semantic search in object-process data model |
| US10678820B2 (en) | 2018-04-12 | 2020-06-09 | Abel BROWARNIK | System and method for computerized semantic indexing and searching |
| CN109271528A (en) * | 2018-09-30 | 2019-01-25 | 税友软件集团股份有限公司 | A kind of result queries method, apparatus and storage medium based on tax semanteme |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10698964B2 (en) | System and method for automatically detecting and interactively displaying information about entities, activities, and events from multiple-modality natural language sources | |
| US8108417B2 (en) | Discovering and scoring relationships extracted from human generated lists | |
| US9600533B2 (en) | Matching and recommending relevant videos and media to individual search engine results | |
| US8117185B2 (en) | Media discovery and playlist generation | |
| US20140195884A1 (en) | System and method for automatically detecting and interactively displaying information about entities, activities, and events from multiple-modality natural language sources | |
| US8983965B2 (en) | Document rating calculation system, document rating calculation method and program | |
| US20090254540A1 (en) | Method and apparatus for automated tag generation for digital content | |
| Demartini et al. | Why finding entities in Wikipedia is difficult, sometimes | |
| CA2599631A1 (en) | Methods of and systems for searching by incorporating user-entered information | |
| US20080059432A1 (en) | System and method for database indexing, searching and data retrieval | |
| Yi et al. | Revisiting the syntactical and structural analysis of Library of Congress Subject Headings for the digital environment | |
| Peters et al. | Tag gardening for folksonomy enrichment and maintenance | |
| US7693898B2 (en) | Information registry | |
| US20080183759A1 (en) | System and method for matching expertise | |
| WO2014128736A1 (en) | Thesaurus structure and associated semantic search method | |
| US11042601B2 (en) | Method for attracting users to a web page and server implementing the method | |
| CN108984752B (en) | Intelligent recommendation method for professional books in library | |
| Mulholland et al. | Storyscope: Supporting the authoring and reading of museum stories using online data sources | |
| Mishra et al. | Improved search technique using wildcards or truncation | |
| Aouadi et al. | Combination of document structure and links for multimedia object retrieval | |
| KR102651282B1 (en) | Biomimicry knowledge service system and biomimicry knowledge service provision method | |
| Raj et al. | Cloud press: A next generation news retrieval system on the cloud | |
| JP6800478B2 (en) | Evaluation program for component keywords that make up a Web page | |
| WO2002069186A1 (en) | A method and system for archiving and retrieving data in an electronic document management system | |
| Ahmed et al. | Web Content Mining: A Solution to Consumer’s Product Hunt |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 13717873 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 13717873 Country of ref document: EP Kind code of ref document: A1 |