WO2016117920A1 - Procédé et appareil d'expansion de représentation de connaissances - Google Patents

Procédé et appareil d'expansion de représentation de connaissances Download PDF

Info

Publication number
WO2016117920A1
WO2016117920A1 PCT/KR2016/000579 KR2016000579W WO2016117920A1 WO 2016117920 A1 WO2016117920 A1 WO 2016117920A1 KR 2016000579 W KR2016000579 W KR 2016000579W WO 2016117920 A1 WO2016117920 A1 WO 2016117920A1
Authority
WO
WIPO (PCT)
Prior art keywords
predicate
knowledge
knowledge expression
text
expression
Prior art date
Application number
PCT/KR2016/000579
Other languages
English (en)
Korean (ko)
Inventor
최기선
함영균
서지우
Original Assignee
한국과학기술원
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from KR1020150139189A external-priority patent/KR101685053B1/ko
Application filed by 한국과학기술원 filed Critical 한국과학기술원
Priority to US15/545,054 priority Critical patent/US20180144049A1/en
Publication of WO2016117920A1 publication Critical patent/WO2016117920A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data

Definitions

  • the present invention relates to a method and apparatus for extending knowledge representation.
  • the semantic web is a semantic web that expresses relationships between information and semantic information (Semanteme) in ontology that can be processed by a computer in a distributed environment such as the Internet.
  • semantic information Semanteme
  • many studies are being conducted to build an ontology-based knowledge database.
  • knowledge is written in natural language, and some studies have shown that more knowledge is contained in unstructured data than in structured databases. Therefore, researches for automatically generating instances of ontology schemas from unstructured data including natural language texts are being conducted to extend the knowledge database.
  • the Semantic Web must express the knowledge of the Web in a structured format that can be understood by a computer, that is, Resource Description Framework (RDF) triples.
  • RDF Resource Description Framework
  • the Semantic Web has properties that can fully describe various attributes of the knowledge elements. Ontology is required.
  • RDF Triple is an international standard governed by the World Wide Web Consortium (W3C). Its knowledge and information are subject (subject), predicate (property) and object (object (literal)). ] In the form of three pairs, where the property corresponds to the predicate of the RDF triple and the relationship between the subject and the object.
  • DBpedia the latest technology on the Semantic Web, is a knowledge database built automatically from Wikipedia, the encyclopedia of text.
  • Divipedia uses Divipedia Ontology, originated from Wikipedia's infobox, to express Wikipedia's knowledge.
  • D.B. ontologies may be sufficient to express Wikipedia's summarized knowledge, it is difficult to guarantee that all knowledge in Wikipedia's text can be expressed. Therefore, we need an ontology that can express various attributes of knowledge elements in natural language text, and we need a technology to expand knowledge by automatically building knowledge database based on this.
  • An object of the present invention is to extend a knowledge expression method and apparatus, and when the knowledge extracted from any text cannot be expressed as a knowledge expression language used in the knowledge expression ontology, a method for extending the knowledge expression using a semantic expression language. will be.
  • An apparatus for expanding knowledge expression comprising: a predicate-argument structure analyzer for extracting a predicate and at least one argument from text using a semantic expression language, a knowledge expression language that is a structured format that can be understood by a computer Extracts a second predicate corresponding to the first predicate extracted by the predicate-dissertation structure analysis unit from the ontology unit expressing the knowledge using and the similarity between the first predicate and the second predicate
  • the first expression includes a knowledge expression unit for representing the knowledge extracted from the text.
  • the knowledge expression unit may extract the second predicate related to the at least one argument from the ontology unit.
  • the knowledge expression unit extracts a first domain that is similar to a lexical type assigned to the at least one argument from domains of the knowledge expression language by more than a reference value, and is assigned to the at least one argument among the ranges of the knowledge expression language.
  • the first range similar to the lexical type and the reference value may be extracted, and the first domain and the predicate related to the first range may be extracted as the second predicate.
  • the knowledge expression unit may generate a string in which information related to any one of the first predicate and the at least one argument is combined, and add the string to the knowledge expression language of the ontology portion.
  • the knowledge expression language may be a language expressed in a resource description framework (RDF) ternary relationship.
  • RDF resource description framework
  • a method extends a knowledge expression, the method comprising: receiving text including at least one sentence, expressing the text as a first predicate and at least one argument based on a semantic expression language And extracting a second predicate corresponding to the first predicate, comparing the similarity between the first predicate and the second predicate, and, if the similarity is equal to or less than a reference value, from the text. Expressing the extracted knowledge using the first predicate.
  • the second predicate corresponding to the first predicate may be extracted from the knowledge expression ontology using the vocabulary type assigned to the at least one argument.
  • the knowledge expression ontology uses a knowledge expression language that expresses knowledge in a ternary relation of a subject, predicate, and object, and extracting a second predicate corresponding to the first predicate.
  • a predicate kit that is similar to the lexical type assigned to the at least one item among the subjects of the knowledge expression language or more than the reference value, and is similar to the lexical type assigned to the at least one item among the objects of the knowledge expression language. Can be extracted with the second predicate.
  • the expressing using the first predicate may generate a string in which information related to any one of the first predicate and the at least one argument is combined, and express the knowledge extracted from the text using the string.
  • the method may further include adding the character string to a knowledge expression language of the knowledge representation ontology.
  • An apparatus extends a knowledge expression, the method comprising: interpreting a predicate-argument structure of text, matching the predicate-argument structure of the text with a ternary relation of the knowledge expression language, and Adding the first predicate extracted from the predicate-dissertation structure of the text as a predicate of the knowledge expression language based on a matching similarity.
  • the adding of the knowledge expression language as a predicate may include extracting a second predicate matching the first predicate of the predicate-non-serial structure of the text from the ternary relation of the knowledge expression language, the first predicate and the second predicate. Comparing the similarity of the predicate, and if the similarity is less than the reference value, adding the first predicate to the knowledge expression language.
  • the method may further include expressing the text in a ternary relationship using the first predicate.
  • Matching the ternary relation of the knowledge expression language may match the predicate-nonserial structure of the text to the ternary relation based on the similarity between the domains and the range of the ternary relations extracted from the predicate-terminal structure of the text. can do.
  • the knowledge expression when the knowledge extracted from a text cannot be expressed as the knowledge expression language used in the knowledge expression ontology, the knowledge expression may be extended using the semantic expression language. That is, according to the embodiment of the present invention can solve the problem that the knowledge representation ontology does not have sufficient coverage when building the knowledge database from the web text.
  • the knowledge database can be expanded quickly and easily by expressing knowledge included in unstructured data such as natural language as a knowledge expression language in a computer understandable format based on sentence semantic predicate-dissertation structure.
  • the "relationship" ontology of the knowledge database can be expanded to increase knowledge expression power and can be applied to CGC (Collaboratively Generated Content) oriented knowledge forms and interpretations.
  • FIG. 1 is an illustration of a semantic expression language according to an embodiment of the present invention.
  • FIG. 2 is a block diagram of an apparatus for expanding knowledge representation according to an embodiment of the present invention.
  • FIG. 3 is an exemplary diagram illustrating a result of analyzing a predicate-dissertation structure according to an embodiment of the present invention.
  • FIG. 4 is an exemplary diagram illustrating a ternary relation knowledge expression structure according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of a method of expanding an expression of knowledge according to an embodiment of the present invention.
  • FIG. 6 is a flowchart illustrating a method of extending knowledge representation according to an embodiment of the present invention.
  • FIG. 7 is a diagram illustrating a result of analyzing a predicate-dissertation structure of an example sentence according to an embodiment of the present invention.
  • FIG. 8 is a diagram illustrating a ternary relation knowledge expression structure of an example sentence according to an embodiment of the present invention.
  • the knowledge database stores structured information in the knowledge expression language.
  • Ontology represents knowledge in a structured format that can be understood by a computer.
  • the knowledge expression language may vary, but may be, for example, an RDF triple.
  • RDF triples represent a knowledge and information in the ternary relation of a subject (Subject (resource)), predicate (Predicate (property)), and object ((Object (literal)), where a predicate or property is a predicate.
  • FIG. 1 is an illustration of a semantic expression language according to an embodiment of the present invention.
  • the ontology of the knowledge database allows this (interferon) to express the type of "glycoprotein” as structured information (RDF).
  • RDF structured information
  • predicates such as “infected”, “generating”, “retarding”, “acting”, “produced”, “used in therapy” are important information, It is difficult to express them.
  • the present invention enhances the expressive power of knowledge using a semantic expression language.
  • the semantic expression language is a language for expressing the meaning of a sentence based on a relationship between a predicate (Property / Predicate) and an argument (Argument).
  • Predicate-argument structure refers to the relationship of arguments that a predicate requires in constructing a sentence. The number of arguments depends on the predicates. A predicate can require one essential argument to create a clause or sentence, and a predicate can require two or three arguments.
  • the semantic expression language can describe the causes, consequences, opinions, behaviors, and conditions for a particular entity that is difficult to express in the DIBIDI ontology.
  • the predicate-discussion structure may be extracted using FrameNet, but is not limited thereto.
  • Framenet is a language resource constructed by annotating how vocabulary is used in sentences in the form of semantic-frames.
  • a query statement may be expressed as a graph of a framenet structure of an RDF structure.
  • the query statement can be expressed in a predicate-discussion structure.
  • infected can be expressed as "Influence_of_event_on_cognizer” in Framenet
  • create can be expressed as “Creating” in Framenet
  • inhibiting It may be expressed as "Intercepting” of the framenet
  • “treat” may be expressed as "Cure” of the framenet.
  • FIG. 2 is a block diagram of an apparatus for expanding knowledge representation according to an embodiment of the present invention
  • FIG. 3 is an exemplary view illustrating a result of analyzing a predicate-nonsense structure according to an embodiment of the present invention
  • the knowledge expression expanding apparatus (hereinafter referred to as “device”) 100 may include a text input unit 110, a predicate-dissertation structure analysis unit 130, a knowledge expression ontology unit 150, and a knowledge expression unit ( 170).
  • the text input unit 110 receives text including at least one sentence.
  • the predicate-argument structure interpreter 130 divides the text into a predicate and at least one argument based on the semantic expression language.
  • a semantic expression language specifies at least one argument that must be present in any word of a sentence (eg, a word corresponding to a predicate), and expresses the meaning of the sentence using a predicate-dissertation structure.
  • the predicate-dissertation structure interpreter 130 finds a predicate (predicate.L) in the text, and finds at least one argument (item 1 to n) corresponding to the predicate.
  • the predicate-argument structure analyzer 130 may output lexical types T.1 to T.n of each argument.
  • the semantic expression language may be FrameNet.
  • the predicate-dissertation structure analyzer 130 identifies the frame target in the sentence and finds the frame element.
  • the frame object corresponds to the predicate of the sentence
  • the frame element corresponds to the argument related to the predicate.
  • the predicate-argument structure analysis unit 130 may output an annotation text on the framenet analysis result.
  • the knowledge representation ontology unit 150 expresses knowledge in a structured format that can be understood by a computer. To this end, the knowledge representation ontology unit 150 describes the attributes of the knowledge elements using the knowledge expression language.
  • the knowledge expression language may be a resource description framework (RDF), and knowledge is expressed as an RDF triple, that is, a ternary relationship ⁇ S, P, O>.
  • RDF resource description framework
  • the knowledge expression ontology unit 150 expresses the text in a predefined ternary relationship.
  • the knowledge expression language may be RDF, and may be expressed as ⁇ Domain (D), Predicate (Predikit), Range (Range, R)>.
  • the domain D is a class of the domain related to the predicate, and corresponds to the class of the subject in the ternary relationship.
  • the scope R is the class of the scope related to the predicate, which corresponds to the class of the object in the ternary relationship.
  • Divipedia Ontology can be read from the sentence ("Cheol was born in 1944 in Korea") from ⁇ People: “Pole”, dbo: birthPlace, Place: “South Korea”> and ⁇ People: "Pole”, dbo We can extract: birthDay, time: "1944"> in a ternary relation of knowledge expressions.
  • the knowledge expression unit 170 converts the predicate-dissertation structure of the text into the format of the knowledge expression ontology unit 150.
  • the knowledge expression unit 170 compares the similarity of the knowledge expressions and determines whether the knowledge interpreted by the predicate-dissertation structure analysis unit 130 can be expressed in the format of the knowledge expression ontology unit 150.
  • the knowledge expression unit 170 is the knowledge expression ontology unit 150 in the format of knowledge.
  • the knowledge expression unit 170 is interpreted by the predicate-argument structure analysis unit 130. Express knowledge using knowledge. Therefore, the knowledge expression unit 170 extracts knowledge from the text based on the semantic expression language when it is difficult to properly express the meaning of the text in a predefined ternary relationship. In addition, the knowledge expression unit 170 may transmit the attribute (corresponding to the ontology instance and the predicate) generated using the semantic expression language to the knowledge expression ontology unit 150. The knowledge expression ontology unit 150 may add information (ontology instances) generated using the semantic expression language to the knowledge expression language.
  • the knowledge expression extension apparatus 100 may extend the knowledge expression of the knowledge expression ontology using the semantic expression language.
  • FIG. 5 is a flowchart of a method of expanding an expression of knowledge according to an embodiment of the present invention.
  • the device 100 receives text including at least one sentence (S110).
  • the apparatus 100 expresses the text as a predicate and at least one argument based on the semantic expression language (S120).
  • the apparatus 100 searches for predicates (predicates.L) and predicates (items 1 to n) in the text as shown in FIG. 3.
  • the device 100 may output the lexical types T.1 to T.n of each argument.
  • the apparatus 100 extracts a predicate (predicate.K) corresponding to a predicate (predicate.L) extracted as a semantic expression language from the knowledge expression ontology (S130).
  • the device 100 matches the predicate-nonserial structure of the text into a ternary relationship of the knowledge expression language.
  • the device 100 is assigned to the domain D and the range R as shown in FIG. 4.
  • the device 100 may find a domain D and a range R that are the same or similar to the lexical type of the argument.
  • the apparatus 100 determines the similarity between the predicate (predicate.L) extracted as the semantic expression language and the predicate (predicate.K) of the knowledge expression language (S140). In this case, the apparatus 100 may determine the similarity between the predicate (predicate.L) extracted as the semantic expression language and the string combining the lexical type of the argument and the predicate (predicate.K) of the knowledge expression language.
  • Methods of determining similarity include: 1) similarity at the string level (2), similarity in word semantics (measurement of similarity using the concept hierarchy using language resources), and 3) measurement of word similarity based on corpus. There is a way. 1) In order to measure the similarity at the string level, there is a method of calculating the number of edits that a string takes to convert to a target string, and traditionally such as Levenshtein Distance. . 2) The similarity in word semantics is calculated by measuring the similarity between words in a hierarchical structure using a semantic lexical database such as WordNet.
  • the method of measuring the minimum distance between nodes in a WordNet hierarchy such as path similarity
  • the method of measuring the minimum distance and maximum depth between nodes such as Leacock & Chodorow similarity
  • the Wu & Palmer similarity there is a method of utilizing the depth of a node and the distance from the minimum upper node between nodes.
  • each word in the corpus is calculated to have a specific vector value in the dimensional space, thereby measuring the similarity between words in the similar vector space.
  • an approach using word embedding has been used.
  • the device 100 extracts knowledge from text using a knowledge expression language already stored (S150). Since the knowledge interpreted in the semantic expression language can be sufficiently represented in the format of the knowledge expression ontology, the apparatus 100 expresses the knowledge of the text in the format of the knowledge expression language. That is, since the apparatus 100 is similar to the predicate (predicate.L) extracted as the semantic expression language more than the reference value of the predicate (predicate.K) of the knowledge expression language, the format of the knowledge expression language does not need to be expanded. Judges that the input text can be represented sufficiently. Knowledge may be expressed as ⁇ a vocabulary corresponding to a domain (D), a predicate.K, a vocabulary corresponding to a range (R)>.
  • the apparatus 100 If not, the apparatus 100 generates a predicate including a predicate (predicate.L) extracted as a semantic expression language (S160).
  • predicate.L a predicate extracted as a semantic expression language
  • the apparatus 100 extracts knowledge from the text using the generated predicate (S170). That is, if the device 100 can express the text in the ternary relation existing in the knowledge expression ontology, the input device expresses the input text based on the stored knowledge expression ontology, and if the text cannot be expressed in the knowledge expression ontology, the input text is predicate-determined. Expressed in extended ternary relation using structure predicates. Knowledge is: vocabulary corresponding to domain (D), predicate.L, vocabulary corresponding to range (R)> or vocabulary corresponding to domain (D), predicate.L + vocabulary type corresponding to range (R), Vocabulary corresponding to the range (R)>.
  • the device 100 adds the generated predicate to the knowledge expression ontology (S180).
  • the generated predicate is added as a new knowledge representation instance.
  • FIG. 6 is a flowchart illustrating a knowledge expression extension method according to an embodiment of the present invention.
  • FIG. 7 is a view illustrating a result of analyzing a predicate-dissertation structure of an example sentence according to an embodiment of the present invention. Is a diagram illustrating a ternary relation knowledge expression structure of an example sentence according to an embodiment of the present invention.
  • the device 100 receives text (“Br. Was born in 1944 in Korea.”) (S210).
  • the apparatus 100 classifies text into predicates and arguments based on the semantic expression language as shown in FIG. 7. If the argument for the predicate ("born") is "Who", “when” or “where”, then the strings corresponding to the argument are “Abstract”, “Korea”, and “1944". When using a framenet, the frame target is "born” and the frame predicate class is "being_born”.
  • the frame arguments for the frame predicate class ("being_born) are defined as "Child”, “Place”, and “Time”, so the frame argument-string pairs are Child-Joe, Place-Korea, and Time-1944.
  • the vocabulary type for the argument is also determined, the vocabulary type of "Child” is “people”, the vocabulary type of "Place” is “place”, and the vocabulary type of "Time” is "time ( time) ".
  • the apparatus 100 compares the domain of the dispute with the ternary relation, and extracts a dispute that matches the domain of the ternary relation among the disputes (S230).
  • the device 100 may find a domain of ternary relation similar to the lexical type of the arguments.
  • the device 100 finds the domain / range related to the argument in order to convert the predicate-claim structure into a ternary relationship, which may first make a non-domain similarity measure.
  • the device 100 may determine that "people" of the lexical type of the argument is similar to "people" which is a domain of ternary relation.
  • the device 100 compares the range of the argument and the ternary relation, and extracts a dispute that matches the range of the ternary relation among the arguments (S240).
  • the device 100 may determine that "time" of the lexical type of the argument is similar to "Time” which is a range of ternary relations.
  • the apparatus 100 Since the apparatus 100 extracts the subject (domain) and the object (range) required by the ternary relation knowledge expression, the apparatus 100 extracts a predicate (predikit) related to the subject (domain) and the object (range) (S250). Referring to FIG. 8, the predicate (fredikit) related to the domain "people" and the range "Time” is "birthday”.
  • the apparatus 100 measures the similarity between the predicate ("being_born") of the semantic expression language and the predicate ("birthday") of the ternary relation (S260). At this time, the device 100 combines the predicate "being_born” with "time” which is a lexical type / related range of the related argument / related argument to generate a combined string ("being_bornTime”), and "being_bornTime” and “birthday”. "Can be compared.
  • the device 100 expresses the knowledge extracted from the text using the predicate (“birthday”) of the ternary relationship (S270).
  • the knowledge extracted from the text can be ⁇ Bill, birthday, 1994>, and "Bail” and "1994" can be URIs linked.
  • the apparatus 100 expresses the knowledge extracted from the text using the predicate "being_born" of the semantic expression language (S280). That is, since the device 100 currently defined in the knowledge expression language ("birthday") does not sufficiently express the meaning of the sentence, the apparatus 100 uses the predicate of the semantic expression language instead of the predicate of the ternary relation.
  • the newly generated predicate may be a string including "being_born", for example, "being_bornTime”.
  • the knowledge extracted from the text is expressed in an extended ternary relationship, and may be, for example, ⁇ Atract, being_born, 1994> or ⁇ Atract, being_bornTime, 1994>. "Withdrawal” and "1994" can be URIs linked.
  • the device 100 stores the new predicate as a predicate related to the domain "people" and the range "Time".
  • the new predicate is a string including "being_born", for example, may be "being_bornTime”.
  • the predicate currently defined in the knowledge expression language (“birthday”) contains time information similar to “1944”, but “1944” is the birth year, not “birthday”, so that it can express insufficient knowledge.
  • the device 100 may replace "being_born” or more specifically "being_bornTime” with a predicate instead of "birthday.”
  • the apparatus 100 may automatically extend the limited expressive power of the knowledge expression language using the semantic expression language, and thereby, may construct a knowledge expression language capable of extracting more accurate knowledge.
  • the device 100 may determine that "place” of the lexical type of the argument is similar to "Place” which is the range of the ternary relationship.
  • the predicate (fredkit) associated with the domain “people” and the scope “Place” is "birthplace”.
  • the apparatus 100 may extract knowledge by using "birthplace” as it is or by using a predicate extended to "being_bornPlace”.
  • the device 100 may extend knowledge representation power of ontology-based knowledge database as well as Divpedia.
  • the apparatus 100 may be ontology in a format in which a classification of a word of a sentence is designated, such as a framenet, and may be extended to a semantic expression language in which arguments related to a word are designated.
  • the knowledge expression when the knowledge extracted from any text cannot be expressed as the knowledge expression language used in the knowledge expression ontology, the knowledge expression may be extended using the semantic expression language. That is, according to the embodiment of the present invention can solve the problem that the knowledge representation ontology does not have sufficient coverage when building the knowledge database from the web text.
  • the knowledge database can be expanded quickly and easily by expressing knowledge included in unstructured data such as natural language as a knowledge expression language in a computer understandable format based on sentence semantic predicate-dissertation structure.
  • the "relationship" ontology of the knowledge database can be expanded to increase knowledge expression power and can be applied to CGC (Collaboratively Generated Content) oriented knowledge forms and interpretations.
  • the knowledge expression expansion apparatus 100 may store instructions for performing the knowledge expression expansion method described with reference to FIGS. 1 to 8, or may be stored in a memory or a memory for temporarily storing the instructions by loading the instructions from the storage device. And a processor for processing the knowledge representation extension method of the present invention by executing instructions, or loaded instructions. Instructions for performing the knowledge expression extension method described with reference to FIGS. 1 to 8 are implemented as a program that can be processed by a processor.
  • the embodiments of the present invention described above are not only implemented through the apparatus and the method, but may be implemented through a program for realizing a function corresponding to the configuration of the embodiments of the present invention or a recording medium on which the program is recorded.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Machine Translation (AREA)

Abstract

L'invention concerne un appareil d'expansion de représentation de connaissances comprenant: une unité d'analyse de structures prédicat-argument servant à extraire un prédicat et au moins un argument d'un texte à l'aide d'un langage de représentation de sens; une unité d'ontologie servant à représenter des connaissances à l'aide d'un langage de représentation de connaissances, qui est un format structuré compréhensible par un ordinateur, et à extraire un deuxième prédicat correspondant à un premier prédicat, qui est extrait de l'unité d'analyse de structures prédicat-argument; et une unité de représentation de connaissances servant à représenter des connaissances extraites du texte à l'aide du premier prédicat, lorsque la similarité du premier prédicat et du deuxième prédicat est inférieure ou égale à une valeur seuil.
PCT/KR2016/000579 2015-01-20 2016-01-20 Procédé et appareil d'expansion de représentation de connaissances WO2016117920A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/545,054 US20180144049A1 (en) 2015-01-20 2016-01-20 Knowledge represention expansion method and apparatus

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20150009518 2015-01-20
KR10-2015-0009518 2015-01-20
KR1020150139189A KR101685053B1 (ko) 2015-01-20 2015-10-02 지식표현 확장 방법 및 장치
KR10-2015-0139189 2015-10-02

Publications (1)

Publication Number Publication Date
WO2016117920A1 true WO2016117920A1 (fr) 2016-07-28

Family

ID=56417382

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2016/000579 WO2016117920A1 (fr) 2015-01-20 2016-01-20 Procédé et appareil d'expansion de représentation de connaissances

Country Status (1)

Country Link
WO (1) WO2016117920A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111552813A (zh) * 2020-03-18 2020-08-18 国网浙江省电力有限公司 一种基于电网全业务数据的电力知识图谱构建方法
WO2024011813A1 (fr) * 2022-07-15 2024-01-18 山东海量信息技术研究院 Procédé et appareil d'extension de texte, dispositif, et support

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040111408A1 (en) * 2001-01-18 2004-06-10 Science Applications International Corporation Method and system of ranking and clustering for document indexing and retrieval
US20110153673A1 (en) * 2007-10-10 2011-06-23 Raytheon Bbn Technologies Corp. Semantic matching using predicate-argument structure
US20110225167A1 (en) * 2010-03-15 2011-09-15 International Business Machines Corporation Method and system to store rdf data in a relational store
WO2011129481A1 (fr) * 2010-04-16 2011-10-20 한국과학기술정보연구원 Système et procédé permettant de proposer un service de questions et de réponses sur la base d'une recherche rdf
US20130232143A1 (en) * 2012-03-02 2013-09-05 Xerox Corporation Efficient knowledge base system
KR20140052328A (ko) * 2012-10-24 2014-05-07 에스케이텔레콤 주식회사 Rdf 기반의 문장 온톨로지 생성 장치 및 방법

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040111408A1 (en) * 2001-01-18 2004-06-10 Science Applications International Corporation Method and system of ranking and clustering for document indexing and retrieval
US20110153673A1 (en) * 2007-10-10 2011-06-23 Raytheon Bbn Technologies Corp. Semantic matching using predicate-argument structure
US20110225167A1 (en) * 2010-03-15 2011-09-15 International Business Machines Corporation Method and system to store rdf data in a relational store
WO2011129481A1 (fr) * 2010-04-16 2011-10-20 한국과학기술정보연구원 Système et procédé permettant de proposer un service de questions et de réponses sur la base d'une recherche rdf
US20130232143A1 (en) * 2012-03-02 2013-09-05 Xerox Corporation Efficient knowledge base system
KR20140052328A (ko) * 2012-10-24 2014-05-07 에스케이텔레콤 주식회사 Rdf 기반의 문장 온톨로지 생성 장치 및 방법

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111552813A (zh) * 2020-03-18 2020-08-18 国网浙江省电力有限公司 一种基于电网全业务数据的电力知识图谱构建方法
WO2024011813A1 (fr) * 2022-07-15 2024-01-18 山东海量信息技术研究院 Procédé et appareil d'extension de texte, dispositif, et support

Similar Documents

Publication Publication Date Title
Satvat et al. Extractor: Extracting attack behavior from threat reports
KR101107760B1 (ko) 지능형 질의 응답 검색 시스템 및 방법
Gupta et al. Part-of-speech tagging of program identifiers for improved text-based software engineering tools
US9053086B2 (en) Electronic document source ingestion for natural language processing systems
WO2021049706A1 (fr) Système et procédé de réponse aux questions d'ensemble
US20160117286A1 (en) Natural language processing-assisted extract, transform, and load techniques
Chen et al. CN-Probase: a data-driven approach for large-scale Chinese taxonomy construction
Qin et al. Automatic analysis and reasoning based on vulnerability knowledge graph
KR101685053B1 (ko) 지식표현 확장 방법 및 장치
Wang et al. Open relation extraction for chinese noun phrases
WO2016117920A1 (fr) Procédé et appareil d'expansion de représentation de connaissances
Shang et al. A framework to construct knowledge base for cyber security
WO2018147543A1 (fr) Système de questions-réponses basé sur un graphe de concept et procédé de recherche de contexte l'utilisant
WO2020242086A1 (fr) Serveur, procédé et programme informatique pour supposer l'avantage comparatif de multi-connaissances
WO2013172499A1 (fr) Appareil et procédé d'extraction de l'expression d'un concept prédicatif d'un terme dans un document
Heuss et al. A comparison of NER tools wrt a domain-specific vocabulary
Weissenbacher et al. Extracting geographic locations from the literature for virus phylogeography using supervised and distant supervision methods
WO2021054512A1 (fr) Système et procédé destinés au renforcement de base de connaissances
Sunitha et al. Automatic summarization of Malayalam documents using clause identification method
WO2017122904A1 (fr) Procédé et système d'extraction d'informations ouverts pour l'extraction de relation ternaire réifiée
WO2009131417A2 (fr) Procédé de réduction de phrase à l'aide d'un arbre syntaxique de grammaire de dépendance
Nguyen et al. Systematic knowledge acquisition for question analysis
Govindapillai et al. An empirical study on Resource Description Framework reification for trustworthiness in knowledge graphs
Le et al. Using natural language tool to assist vprg automated extraction from textual vulnerability description
Ming et al. Resolving polysemy and pseudonymity in entity linking with comprehensive name and context modeling

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: 16740393

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 15545054

Country of ref document: US

122 Ep: pct application non-entry in european phase

Ref document number: 16740393

Country of ref document: EP

Kind code of ref document: A1