G06V30/1983

MULTI-WORD PHRASE BASED ANALYSIS OF ELECTRONIC DOCUMENTS
20240028624 · 2024-01-25 ·

A document processing system is configured to identify, for each accessed electronic document in a first set of multiple electronic documents, a set of identified multi-word phrases determined to be in ordered text information in the accessed electronic document, each multi-word phrase of the set of identified multi-word phrases including adjacent words in the ordered text information; and determine, for each accessed electronic document in the first set of multiple electronic documents, a selected document type from the first set of document types based at least on an analysis of the set of identified multi-word phrases with respect to multi-word-phrase characteristics identified by a first definition and associated with each document type in a first set of document types associated with a first document-set type.

MULTI-WORD PHRASE BASED ANALYSIS OF ELECTRONIC DOCUMENTS
20200012723 · 2020-01-09 ·

A document processing system is configured to identify, for each accessed electronic document in a first set of multiple electronic documents, a set of identified multi-word phrases determined to be in ordered text information in the accessed electronic document, each multi-word phrase of the set of identified multi-word phrases including adjacent words in the ordered text information; and determine, for each accessed electronic document in the first set of multiple electronic documents, a selected document type from the first set of document types based at least on an analysis of the set of identified multi-word phrases with respect to multi-word-phrase characteristics identified by a first definition and associated with each document type in a first set of document types associated with a first document-set type.

System, Device, and Method of Automatic Construction of Digital Advertisements
20190392487 · 2019-12-26 ·

System, device, and method of automatic construction of digital advertisements. An Artificial Intelligence (AI) unit is configured to receive as input: digital copies of past advertisements, and data of their performance results; as well as brand guidelines and a creative brief for automatic generation of a new advertisement. The AI unit generates a set of advertisement elements, such as logo, headline, a sub-headline, call-to-action, legal content, and an image; based on analysis of the input and detection that these particular advertisement elements correspond to previous performance results that are beyond a pre-defined threshold. An automatic advertisement generation unit generates a new advertisement by digitally placing the set of advertisement elements onto a canvas. Optionally, the system automatically generates on-the-fly in real-time a user-tailored advertisement, that is based on analysis of past performance of advertisements that were shown by the same advertiser to this particular end-user.

USER INTERFACE FOR REGULAR EXPRESSION GENERATION

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 USING LONGEST COMMON SUBSEQUENCE ALGORITHM ON SPANS

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 USING COMBINATORIC LONGEST COMMON SUBSEQUENCE ALGORITHMS

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

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 USING LONGEST COMMON SUBSEQUENCE ALGORITHM ON REGULAR EXPRESSION CODES

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 USING LONGEST COMMON SUBSEQUENCE ALGORITHM ON COMBINATIONS OF REGULAR EXPRESSION CODES

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.

SYSTEMS AND METHODS FOR USING IMAGE ANALYSIS TO AUTOMATICALLY DETERMINE VEHICLE INFORMATION

The present disclosure is directed to systems and methods for analyzing digital images to determine alphanumeric strings depicted in the digital images. An electronic device may generate a set of filtered images using a received digital image. The electronic device may also perform an optical character recognition (OCR) technique on the set of filtered images, and may filter out any of the set of filtered images according to a set of rules. The electronic device may further identify a set of common elements representative of the alphanumeric string depicted in the digital image, and determine a machine-encoded alphanumeric string based on the set of common elements