MULTI-MODAL PROGRAM INFERENCE
    1.
    发明公开

    公开(公告)号:US20230176829A1

    公开(公告)日:2023-06-08

    申请号:US17544502

    申请日:2021-12-07

    CPC classification number: G06F8/33 G06F40/40 G06F8/38 G06F40/30 G06F8/10

    Abstract: Embodiments use a multi-modal approach to generate software programs that match a solution program description. The solution program description may include natural language, input-output examples, partial source code, desired operators, or other hints. Some embodiments use optimized prompts to a pre-trained language model to obtain initial candidate programs. Maximal program components are extracted and then recombined variously using component-based synthesis. Beam search reduces a solution program search space by discarding some candidates from a given synthesis iteration. Relevance metrics, string similarity metrics, operator frequency distributions, token rareness scores, and other optimizations may be employed. By virtue of optimizations and the multi-modal approach, a solution program may be obtained after fewer iterations than by use of a language model alone. The multi-modal approach is domain agnostic, as illustrated by examples using regular expression and cascading style sheet selector domain specific languages.

    SYNTACTIC PROFILING OF ALPHANUMERIC STRINGS
    4.
    发明申请

    公开(公告)号:US20190034437A1

    公开(公告)日:2019-01-31

    申请号:US15663575

    申请日:2017-07-28

    CPC classification number: G06F16/355 G06F17/2264 G06F17/271

    Abstract: A computing device includes a storage machine holding instructions executable by a logic machine to generate multi-string clusters, each containing alphanumeric strings of a dataset. Further multi-string clusters are generated via iterative performance of a combination operation in which a hierarchically-superior cluster is generated from a set of multi-string clusters. The combination operation includes, for candidate pairs of multi-string clusters, generating syntactic profiles describing an alphanumeric string from each multi-string cluster of the candidate pair. For each of the candidate pairs, a cost factor is determined for at least one of its syntactic profiles. Based on the cost factors determined for the syntactic profiles, one of the candidate pairs is selected. The multi-string clusters from the selected candidate pair are combined to generate the hierarchically-superior cluster including all of the alphanumeric strings from the selected candidate pair of multi-string clusters.

    SYNTACTIC PROFILING OF ALPHANUMERIC STRINGS
    7.
    发明申请

    公开(公告)号:US20190311004A1

    公开(公告)日:2019-10-10

    申请号:US16448805

    申请日:2019-06-21

    Abstract: A computing device includes a storage machine holding instructions executable by a logic machine to generate multi-string clusters, each containing alphanumeric strings of a dataset. Further multi-string clusters are generated via iterative performance of a combination operation in which a hierarchically-superior cluster is generated from a set of multi-string clusters. The combination operation includes, for candidate pairs of multi-string clusters, generating syntactic profiles describing an alphanumeric string from each multi-string cluster of the candidate pair. For each of the candidate pairs, a cost factor is determined for at least one of its syntactic profiles. Based on the cost factors determined for the syntactic profiles, one of the candidate pairs is selected. The multi-string clusters from the selected candidate pair are combined to generate the hierarchically-superior cluster including all of the alphanumeric strings from the selected candidate pair of multi-string clusters.

    AUTOMATICALLY CONVERTING SPREADSHEET TABLES TO RELATIONAL TABLES

    公开(公告)号:US20180246915A1

    公开(公告)日:2018-08-30

    申请号:US15443531

    申请日:2017-02-27

    CPC classification number: G06F16/221 G06F16/25

    Abstract: Techniques are disclosed which provide for transforming a hierarchical table to a relational table. A hierarchical table may be received, in which a headline row is identified. A candidate row may be determined in the hierarchical table. The process may include systematically classifying headlines as data headlines or descriptors. For each data headline a new column may be generated, while for each descriptor headline, the table may be split to produce a resultant table. The resultant table may be stored and the process may be repeated until there are no headlines left to be classified. The steps performed by the system to transform the table can then be displayed on a user device using a program in the Domain-specific language, which can then be further inspected or modified to perform the desired table transformation.

Patent Agency Ranking