Oracle International Corporation

Other

Oralce International Corporation

Luis E Rivas

Mark L Kreider

Michael Malak

Glenn Allen Murray

Robert James Oberbreckling

Edward A Green

Philip Ogren

Alec Sharp

Alexander Sasha Stojanovic

Kevin L Markey

Manisha Gupta

Nikhil Surve

Douglas C Savolainen

Christopher F Bidwell

Chaohui Yu

Luis Ramirez

In accordance with an embodiment, described herein is a system and method for use of text analytics to transform, analyze, and visualize data, including support for data flows of unstructured text or other types of textual data input. Additionally described are various examples of algorithmic processes and user interfaces that can be used to enable text analytics in particular environments or use cases. In accordance with an embodiment, the system can be implemented within a cloud environment that enables self-service text analytics. A user, for example an organizational business user who may not be expert in the use of machine learning as applied to data processing, can interact with the system via a user interface, to apply natural language processing or other text analysis techniques to a data flow or set of input data, to generate visualizations or other types of useful information associated with the data.

System and method for use of text analytics to transform, analyze, and visualize data

Techniques for generated regular expressions are disclosed. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence. A negative example may be used to generate the regular expression. Context from the negative example may be determined in order to generate the regular expression.

Regular expression generation for negative example using context

Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.

Regular expression generation based on positive and negative pattern matching examples

Regular expression generation using longest common subsequence algorithm on combinations of regular expression codes

The present disclosure related to techniques for analyzing data from multiple different data sources to determine a relationship between the data (also referred to herein a 'data relationship discovery'). The relationships between any two compared datasets may be used to determine one or more recommendations for merging (e.g., joining), or 'blending,' the data sets together. Relationship discovery may include determining a relationship between a subset of data, such as a relationship between a pair of columns, or column pair, each column in a different dataset of the datasets that are compared. Given two datasets to process for relationship discovery, relationship discovery may identify and recommends a ranked subset of column pairs between two compared datasets. The ranked column pairs identified as a relationship may be useful for blending the datasets with respect to those column pairs.

Techniques for relationship discovery between datasets

Techniques are provided for identifying attributes associated with a neologism or an unknown word or name. Real world characteristics can be predicted for the neologism. Trigrams are identified for an input word and word embedding model vector values are calculated for the identified trigrams and entered into a matrix. Trigrams are identified for nearest names. Classification values are calculated based on the trigrams for the input word and the trigrams from the nearest names and the classification values are entered into the matrix. A convolutional neural network can process the matrix to identify one or more characteristics associated with the neologism.

Neologism classification techniques with trigrams and longest common subsequences

Techniques for generated regular expressions are disclosed. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence. Alignment of span data structures may be performed when generating the regular expression.

Regular expression generation using span highlighting alignment

Techniques are disclosed for providing adaptive recommendations for a data set. A data set can include one or more columns of data. The data set can be profiled in order to identify actions that can be applied to the data in order to enrich the data. The data set and actions that were applied to the data set can be stored. Actions that are applied to subsequent data sets can take into account the actions that were applied to prior data sets having similar profiles.

Adaptive recommendations

Techniques for generated regular expressions are disclosed. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence. Generation of the regular expressions can be implemented on an interactive user interface. Commands can be applied to the one or more character sequences and regular expressions are generated based on the applied commands.

User interface commands for regular expression generation

User interface for regular expression generation

Regular expression generation using combinatoric longest common subsequence algorithms

Regular expression generation using longest common subsequence algorithm on spans

Techniques are disclosed for a system that provides an intuitive way for merging or joining data from different datasets. The system may provide graphical interfaces to enable a user to combine or join datasets identified as having a relationship. In at least one embodiment, the system can determine options for joining datasets, such as by a left join, right join, or outer join. A graphical interface may display a visual representation (e.g., a 'Glenn Diagram') illustrate options for joining datasets based on identifying a relationship between the data sets. The representation may further illustrate one or more types of joins and information about the data, such as rows where data may be joined based on the type of join function for the relationship by columns. The visual representation may indicate where the datasets can be joined, such that they are not overlapping.

Techniques for facilitating the joining of datasets

The present disclosure relates to techniques for analysis of data from multiple different data sources to determine similarity amongst the datasets. Determining a similarity between datasets may be useful for downstream processing of those datasets for different uses. A graphical interface may be provided to display detailed results including: a similarity prediction, data similarity prediction, column order similarity prediction, document type similarity prediction, prediction of overlapping or related columns, orphaned column prediction (e.g., a left orphaned column or a right orphaned column).

Growing community of inventors

Denver, CO, United States of America

Luis E Rivas