Microsoft Technology Licensing, LLC

David Gordon Bradlee

Sonja Sabina Knoll

Mark Nelson

Joseph E Pentheroudakis

Evan Moran

Heidi Munson

Mike Woolf

Steven E Lees

Jie Li

Ilan Gabriel Caron

Alan W Carter

William Guthrie Morein

Mark L Roberts

Amit Velingkar

Dennis Mark Canady

Ramona Pousti

John Edward Haug, Iii

Dillon Nugent

Timothy L Paterson

Jeffrey C Robbins

Information in a diagram is logically structured using lists, containers, and callouts without requiring the diagram author to explicitly define a structure or map any diagram contents to a structure. Logical relationships are inferred based on actions associated with shapes, groupings, and attributes of shapes/groupings taken by the author. Feedback mechanisms are provided to communicate an underlying structure to the author. Intelligent behaviors are enabled to expose manipulation of diagrams based on their logical structure.

Inferring diagram structure through implicit shape relationships

Technologies are described herein for correcting the layout of shapes in a diagram. A request is received to correct the diagram layout. The positional relationships between the shapes in the diagram are determined through the creation of a dependency tree. According to various embodiments, the dependency tree defines parent-child relationships within the diagram and the physical position of shapes with respect to one another. Using the dependency tree and layout rules, the shapes within the diagram may be repositioned to correct misalignment and uneven spacing to make minor corrections in the layout while preserving the general configuration of the original layout. Embodiments provide for layout corrections of diagrams including regions that encompass member shapes and provide for conflict resolution when layout corrective actions result in overlaps of shapes, regions, or page breaks.

Correcting positions of shapes in a diagram

Customizable data diagrams are provided by a data diagram software facility. The facility receives a reference to a multidimensional data set on which to base an initial data diagram. Based, at least in part, on this information, the facility generates a data diagram providing a graphical representation of nodes corresponding to data from the multidimensional data set. The facility displays the data diagram, which can be modified by a user. For example, the facility may provide tools that allow the user to change the order of the nodes of the data diagram, change the shape of the nodes of the data diagram, change the color or format of the nodes of the data diagram, etc. The facility may also provide functionality that allows the user to drill down on aspects of the data diagram based on a breakdown scheme.

Diagrammatic access and arrangement of data

The present invention is a segmenter used in a natural language processing system. The segmenter segments a textual input string into tokens for further natural language processing. In accordance with one feature of the invention, the segmenter includes a tokeinzer engine that proposes segmentations and submits them to a linguistic knowledge component for validation. In accordance with another feature of the invention, the segmentation system includes language specific data that contains a precedence hierarchy for punctuation. If proposed tokens in the input string contain punctuation, they can illustratively be broken into subtokens based on the precedence hierarchy.

Tokenizer for a natural language processing system

The present invention is a segmenter used in a natural language processing system. The segmenter segments a textual input string into tokens for further natural language processing. In accordance with one feature of the invention, the segmenter includes a tokenizer engine that proposes segmentations and submits them to a linguistic knowledge component for validation. In accordance with another feature of the invention, the segmentation system includes language-specific data that contains a precedence hierarchy for punctuation. If proposed tokens in the input string contain punctuation, they can illustratively be broken into subtokens based on the precedence hierarchy.

Source code including application defined expressions and non-conforming identifiers are compiled to executable code. The source code is written with an application defined expression or non-conforming identifier enclosed between a predefined pair of matching separators, such as square brackets. When a sequence of characters between the predefined separators is encountered in the source code during compiling, a symbol table is searched for a matching identifier. If found, the characters are interpreted as a non-conforming identifier and bound to the matching identifier. If not found, the characters are interpreted as an application defined expression and bound to a function call for an evaluating function provided in an application library.

Compiler and method for evaluation of foreign syntax expressions in

A call template builder constructs call templates for interfacing between two blocks of code that utilize different calling conventions. Each call template is built to perform calling convention translation for a call from a source code block to a particular function in a target code block. The call template is formed as a linear block of code having computer code instructions for moving each argument of the function call between locations in memory and registers of the computer complying with a calling convention of the source code block to locations complying with a calling convention of the target code block. Call templates can be constructed for any arbitrary calling convention by providing a definition to the call template builder of the calling convention indicative of the locations for passing arguments and transferring control to the function in compliance with that calling convention.

Growing community of inventors

Seattle, WA, United States of America

David Gordon Bradlee