Amazon Technologies, Inc.

Wendy Tse

Andrea Olgiati

Rahul Bhotika

Amit Adam

Shai Mazor

Stefano Soatto

Oron Anschel

Hadar Averbuch Elor

Gal Sabina Star

Or Perel

Bhavesh Anil Doshi

Anand Dhandhania

Umar Farooq

Patrick Ian Wilson

Omri Ben-Eliezer

Gururaj Kosuru

Techniques for grammar-based automated generation of annotated synthetic form training data for machine learning are described. A training data generation engine utilizes a defined grammar to construct a layout for a form, select key-value units to place within the layout, and select attribute variants for the key-value units. The form is rendered and stored at a storage location, where it can be provided along with other similarly-generated forms to be used as training data for a machine learning model.

Grammar-based automated generation of annotated synthetic form training data for machine learning

Techniques for layout-agnostic complex document processing are described. A document processing service can analyze documents that do not adhere to defined layout rules in an automated manner to determine the content and meaning of a variety of types of segments within the documents. The service may chunk a document into multiple chunks, and operate upon the chunks in parallel by identifying segments within each chunk, classifying the segments into segment types, and processing the segments using special-purpose analysis engines adapted for the analysis of particular segment types to generate results that can be aggregated into an overall output for the entire document that captures the meaning and context of the document text.

Layout-agnostic complex document processing system

Techniques for automated form understanding via layout-agnostic identification of keys and corresponding values are described. An embedding generator creates embeddings of pixels from an image including a representation of a form. The generated embeddings are similar for pixels within a same key-value unit, and far apart for pixels not in a same key-value unit. A weighted bipartite graph is constructed including a first set of nodes corresponding to keys of the form and a second set of nodes corresponding to values of the form. Weights for the edges are determined based on an analysis of distances between ones of the embeddings. The graph is partitioned according to a scheme to identify pairings between the first set of nodes and the second set of nodes that produces a minimum overall edge weight. The pairings indicate keys and values that are associated within the form.

Automated form understanding via layout agnostic identification of keys and corresponding values

Growing community of inventors

Seattle, WA, United States of America

Wendy Tse