Patents by Inventor Michael V. Calcagno
Michael V. Calcagno has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8412515Abstract: A system and method for normalizing a discourse representation structure (DRS) are provided. The elements of the structure are rewritten and sorted in a way such that structures which may appear different but are nonetheless equivalent can be associated with the same, normalized representation. Various embodiments can also include a data structure for a DRS. The DRS may be represented by an array of boxes, each having a set of elements which in turn has a predefined structure suitable for representing a wide variety of linguistic information.Type: GrantFiled: October 15, 2007Date of Patent: April 2, 2013Assignee: Microsoft CorporationInventors: Par Jonas Barklund, Michael V. Calcagno
-
Patent number: 8201139Abstract: A framework for generating a semantic interpretation of natural language input includes an interpreter, a first set of types, and a second set of types. The interpreter is adapted to mediate between a client application and one or more analysis engines to produce interpretations of the natural language input that are valid for the client application. The first set of types is adapted to define interactions between the interpreter and the one or more analysis engines. The second set of types is adapted to define interactions between the interpreter and the client application.Type: GrantFiled: September 15, 2004Date of Patent: June 12, 2012Assignee: Microsoft CorporationInventors: Su Chin Chang, Ravi C. Shahani, Domenic J. Cipollone, Michael V. Calcagno, Mari J. B. Olsen, David J. Parkinson
-
Patent number: 7761858Abstract: A software development tool for programming natural language software applications is described. The software development tool includes a programming language and a compiler. The programming language has a set of programming constructs for facilitating natural language programming. The compiler is adapted to take a software program containing instances of the set of programming constructs and to generate a software application.Type: GrantFiled: April 23, 2004Date of Patent: July 20, 2010Assignee: Microsoft CorporationInventors: Su Chin Chang, Ravi C. Shahani, Domenic J. Cipollone, Michael V. Calcagno, Mari J. B. Olsen, David J. Parkinson
-
Patent number: 7689410Abstract: A lexical semantic structure for modeling semantics of a natural language input on a computer is described. A set of lexical semantic categories is selected to model content of the natural language input. A methodology associates content of the natural language input to one or more categories of the set of lexical semantic categories.Type: GrantFiled: September 15, 2004Date of Patent: March 30, 2010Assignee: Microsoft CorporationInventors: Su Chin Chang, Ravi C. Shahani, Domenic J. Cipollone, Michael V. Calcagno, Mari J. B. Olsen, David J. Parkinson
-
Patent number: 7681186Abstract: A system for developing natural language enabled software applications is described. Resolvable types define abstract representations of linguistic elements and interrelationships between linguistic elements of a natural language input. Resolution semantics define procedural rules for resolving validity of the resolvable types in a natural language enabled software application.Type: GrantFiled: September 15, 2004Date of Patent: March 16, 2010Assignee: Microsoft CorporationInventors: Su Chin Chang, Ravi C. Shahani, Domenic J. Cipollone, Michael V. Calcagno, Mari J. B. Olsen, David J. Parkinson
-
Patent number: 7464026Abstract: The present invention is a system and method for performing semantic analysis that interprets a linguistic structure output by a natural language linguistic analysis system. The semantic analysis system converts the linguistic output by the natural language linguistic analysis system into a data structure model referred to as a semantic discourse representation structure (SemDRS).Type: GrantFiled: December 19, 2006Date of Patent: December 9, 2008Assignee: Microsoft CorporationInventors: Michael V. Calcagno, Par Jonas Barklund, Lei Zhao, Saliha Azzam, Sonja S. Knoll, Su Chang
-
Patent number: 7315810Abstract: The present invention is a named entity (NE) interface to a linguistic analysis layer. The interface exposes each input sentence to the NE recognizers of all applications and returns all recognized NEs. Thus, the present invention can accommodate NEs which dynamically change in the applications, because each input string will be handed to the applications for NE recognition. The present invention also includes a data structure which is a normalized form of recognized NEs.Type: GrantFiled: January 7, 2002Date of Patent: January 1, 2008Assignee: Microsoft CorporationInventors: Saliha Azzam, Michael V. Calcagno, David N. Weise, Kevin R. Powell, Sonja S. Knoll, Pär Jonas Barklund, Evelyne Viegas
-
Patent number: 7295966Abstract: The present invention is a system and method for normalizing a discourse representation structure (DRS). The elements of the structure are rewritten and sorted in a way such that structures which may appear different but are nonetheless equivalent can be associated with the same, normalized representation. The present invention can also include a data structure for a DRS. The DRS is represented by an array of boxes, each having a set of elements which in turn has a predefined structure suitable for representing a wide variety of linguistic information.Type: GrantFiled: January 14, 2002Date of Patent: November 13, 2007Assignee: Microsoft CorporationInventors: Pär Jonas Barklund, Michael V. Calcagno
-
Patent number: 7266491Abstract: A method of, and system for, generating a sentence from a semantic representation maps the semantic representation to an unordered set of syntactic nodes. Simplified generation grammar rules and statistical goodness measure values from a corresponding analysis grammar are then used to create a tree structure to order the syntactic nodes. The sentence is then generated from the tree structure. The generation grammar is a simplified (context free) version of a corresponding full (context sensitive) analysis grammar. In the generation grammar, conditions on each rule are ignored except those directly related to the semantic representation. The statistical goodness measure values, which are calculated through an analysis training phase in which a corpus of example sentences is processed using the full analysis grammar, are used to guide the generation choice to prefer substructures most commonly found in a particular syntactic/semantic context during analysis.Type: GrantFiled: June 14, 2005Date of Patent: September 4, 2007Assignee: Microsoft CorporationInventors: Kevin W. Humphreys, David Neal Weise, Michael V. Calcagno
-
Patent number: 7177799Abstract: The present invention is a system and method for performing semantic analysis that interprets a linguistic structure output by a natural language linguistic analysis system. The semantic analysis system converts the linguistic output by the natural language linguistic analysis system into a data structure model referred to as a semantic discourse representation structure (SemDRS).Type: GrantFiled: January 14, 2002Date of Patent: February 13, 2007Assignee: Microsoft CorporationInventors: Michael V. Calcagno, Pär Jonas Barklund, Lei Zhao, Saliha Azzam, Sonja S. Knoll, Su Chang
-
Patent number: 7171352Abstract: A linguistic object model is adapted to model semantic elements of a natural language. The linguistic object model includes a set of abstract representations of semantic elements of an utterance. Each abstract representation in the set corresponds to a natural language type that is independent of any particular language.Type: GrantFiled: September 14, 2004Date of Patent: January 30, 2007Assignee: Microsoft CorporationInventors: Su Chin Chang, Ravi C. Shahani, Domenic J. Cipollone, Michael V. Calcagno, Mari J. B. Olsen, David J. Parkinson
-
Patent number: 7003445Abstract: A method of, and system for, generating a sentence from a semantic representation maps the semantic representation to an unordered set of syntactic nodes. Simplified generation grammar rules and statistical goodness measure values from a corresponding analysis grammar are then used to create a tree structure to order the syntactic nodes. The sentence is then generated from the tree structure. The generation grammar is a simplified (context free) version of a corresponding full (context sensitive) analysis grammar. In the generation grammar, conditions on each rule are ignored except those directly related to the semantic representation. The statistical goodness measure values, which are calculated through an analysis training phase in which a corpus of example sentences is processed using the full analysis grammar, are used to guide the generation choice to prefer substructures most commonly found in a particular syntactic/semantic context during analysis.Type: GrantFiled: July 20, 2001Date of Patent: February 21, 2006Assignee: Microsoft CorporationInventors: Kevin W. Humphreys, David Neal Weise, Michael V. Calcagno
-
Publication number: 20040249808Abstract: In a method of processing an input query, an input query is received and a related query is selected from a query log. Next, the selected query is provided to a query processing system in place of the original input query. The present invention is also directed to a query modification system that is configured to perform the above-described method.Type: ApplicationFiled: June 6, 2003Publication date: December 9, 2004Applicant: Microsoft CorporationInventors: Saliha Azzam, Michael V. Calcagno, Kevin W. Humphreys
-
Publication number: 20030176999Abstract: The present invention is a system and method for performing semantic analysis that interprets a linguistic structure output by a natural language linguistic analysis system. The semantic analysis system converts the linguistic output by the natural language linguistic analysis system into a data structure model referred to as a semantic discourse representation structure (SemDRS).Type: ApplicationFiled: January 14, 2002Publication date: September 18, 2003Inventors: Michael V. Calcagno, Par Jonas Barklund, Lei Zhao, Saliha Azzam, Sonja S. Knoll, Su Chang
-
Publication number: 20030171915Abstract: The present invention is a system and method for normalizing a discourse representation structure (DRS). The elements of the structure are rewritten and sorted in a way such that structures which may appear different but are nonetheless equivalent can be associated with the same, normalized representation. The present invention can also include a data structure for a DRS. The DRS is represented by an array of boxes, each having a set of elements which in turn has a predefined structure suitable for representing a wide variety of linguistic information.Type: ApplicationFiled: January 14, 2002Publication date: September 11, 2003Inventors: Par Jonas Barklund, Michael V. Calcagno
-
Publication number: 20030130835Abstract: The present invention is a named entity (NE) interface to a linguistic analysis layer. The interface exposes each input sentence to the NE recognizers of all applications and returns all recognized NEs. Thus, the present invention can accommodate NEs which dynamically change in the applications, because each input string will be handed to the applications for NE recognition. The present invention also includes a data structure which is a normalized form of recognized NEs.Type: ApplicationFiled: January 7, 2002Publication date: July 10, 2003Inventors: Saliha Azzam, Michael V. Calcagno, David N. Weise, Kevin R. Powell, Sonja S. Knoll, Par Jonas Barklund, Evelyne Viegao
-
Publication number: 20030018469Abstract: A method of, and system for, generating a sentence from a semantic representation maps the semantic representation to an unordered set of syntactic nodes. Simplified generation grammar rules and statistical goodness measure values from a corresponding analysis grammar are then used to create a tree structure to order the syntactic nodes. The sentence is then generated from the tree structure. The generation grammar is a simplified (context free) version of a corresponding full (context sensitive) analysis grammar. In the generation grammar, conditions on each rule are ignored except those directly related to the semantic representation. The statistical goodness measure values, which are calculated through an analysis training phase in which a corpus of example sentences is processed using the full analysis grammar, are used to guide the generation choice to prefer substructures most commonly found in a particular syntactic/semantic context during analysis.Type: ApplicationFiled: July 20, 2001Publication date: January 23, 2003Inventors: Kevin W. Humphreys, David Neal Weise, Michael V. Calcagno