Automated natural language splitting for generation of knowledge graphs

A natural language splitting system for splitting a natural language sentence into primitive phrases retaining relations of terms, the natural language splitting system comprising:

• one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the natural language splitting system is capable of performing a method comprising:
• receiving, by the one or more processors, a natural language sentence;
• building, by the one or more processors, a parse tree from the natural language sentence using a natural language parser;
• and
• recursively identifying, by the one or more processors, discourse markers in subtrees of the parse tree, starting with a highest ranking discourse marker in the parse tree to separate each of a respective subtree at a respective discourse marker using a set of predefined rules until a set of basic subtrees remains, wherein the recursive identification comprises looking-ahead for identifying long ranging discourse markers before identifying local discourse markers.

A computer program product for splitting a natural language sentence into primitive phrases retaining relations of terms, the computer program product comprising:

• one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions comprising:
• program instructions to receive, by one or more processors, a natural language sentence;
• program instructions to build, by the one or more processors, a parse tree from the natural language sentence using a natural language parser;
• and
• program instructions to recursively identify, by the one or more processors, discourse markers in subtrees of the parse tree, starting with a highest ranking discourse marker in the parse tree to separate each of a respective subtree at a respective discourse marker using a set of predefined rules until a set of basic subtrees remains, wherein the recursive identification comprises looking-ahead for identifying long ranging discourse markers before identifying local discourse markers.