JAMES W KENNEDY, D.D.S.
Dentist at Fannin St, Houston, TX

2005001, Jan 13, 2005

Sep 5, 2003

10/656933

Heather Bergeron - Westminster MA, US
Chris Easton - Andover MA, US
Kunjan Jhaveri - Woburn MA, US
James Kennedy - Houston TX, US
Eugene Krylov - Wakefield MA, US
John Morris - Sudbury MA, US
Simone Pringle - Sudbury MA, US
Benjamin Sprecher - Grafton MA, US
John Trustman - Gloucester MA, US
Andre Yoshida - Still River MA, US

G06F017/60

705001000, 705007000

The disclosed technology can identify indicia associated with different entity types that interact within an industry, identify one or more relationships (e.g., contractual provisions) that can affect interactions between such entity types, and identify transactions associated with one or more of the interactions. Further, the identified transactions can be organized into one or more transaction sequences. The identified indicia, the one or more identified relationships, and the one or more transaction sequences can then be associated to form a semantic network. An instance of the semantic network can be formed in response to the execution of at least some of the transaction sequence and can serve, at least in part, as the basis for processing requests associated with the entities. The requests can correspond to interactions associated with the entities and may be represented in a natural language format, exhibiting a fixed context and a fixed grammar.

2005001, Jan 13, 2005

Sep 5, 2003

10/656931

Heather Bergeron - Westminster MA, US
Chris Easton - Andover MA, US
Kunjan Jhaveri - Woburn MA, US
James Kennedy - Houston TX, US
Eugene Krylov - Wakefield MA, US
Simone Pringle - Sudbury MA, US
Benjamin Sprecher - Grafton MA, US
John Trustman - Gloucester MA, US
Andre Yoshida - Still River MA, US

G06F017/60, G06F007/00, G06F017/30, G06F017/27

704009000, 705002000, 707003000

The disclosed technology can identify indicia associated with different entity types that interact within an industry, identify one or more relationships (e.g., contractual provisions) that can affect interactions between such entity types, and identify transactions associated with one or more of the interactions. Further, the identified transactions can be organized into one or more transaction sequences. The identified indicia, the one or more identified relationships, and the one or more transaction sequences can then be associated to form a semantic network. An instance of the semantic network can be formed in response to the execution of at least some of the transaction sequence and can serve, at least in part, as the basis for processing requests associated with the entities. The requests can correspond to interactions associated with the entities and may be represented in a natural language format, exhibiting a fixed context and a fixed grammar.

2005003, Feb 10, 2005

Sep 5, 2003

10/656909

Heather Bergeron - Westminster MA, US
Chris Easton - Andover MA, US
Kunjan Jhaveri - Woburn MA, US
Andrew Kennedy - Needham MA, US
James Kennedy - Houston TX, US
Jayant Pai - Acton MA, US
Alon Peled - Newton Center MA, US
Simone Pringle - Sudbury MA, US
Benjamin Sprecher - Grafton MA, US
John Trustman - Gloucester MA, US

G10L011/00

704277000

The disclosed technology can identify indicia associated with different entity types that interact within an industry, identify one or more relationships (e.g., contractual provisions) that can affect interactions between such entity types, and identify transactions associated with one or more of the interactions. Further, the identified transactions can be organized into one or more transaction sequences. The identified indicia, the one or more identified relationships, and the one or more transaction sequences can then be associated to form a semantic network. An instance of the semantic network can be formed in response to the execution of at least some of the transaction sequence and can serve, at least in part, as the basis for processing requests associated with the entities. The requests can correspond to interactions associated with the entities and may be represented in a natural language format, exhibiting a fixed context and a fixed grammar.

2006017, Aug 3, 2006

Oct 7, 2003

10/681052

Heather Bergeron - Westminster MA, US
Chris Easton - Andover MA, US
Andrew Kennedy - Needham MA, US
James Kennedy - Houston TX, US
Doug Koen - Cambridge MA, US
Eugene Krylov - Wakefield MA, US
John Morris - Sudbury MA, US
Jayant Pai - Acton MA, US
Alon Peled - Newton Center MA, US
Simone Pringle - Sudbury MA, US
John Trustman - Gloucester MA, US
Lyubomir Vujisic - Arlington MA, US
Andre Yoshida - Still River MA, US

G06F 17/27

704009000

The disclosed technology can execute a sequence of transactions to process a request associated with a health care company and/or other entities interacting in a health care industry. Execution of at least some of the transaction sequence can result in the formation of an instance of a semantic network that can be used to support such processing. The request can correspond to a change in a relationship associated with such entities, where such request corresponds to an electronic document exhibiting a structured natural language format with a fixed context and a fixed grammar.

7356460, Apr 8, 2008

Apr 10, 2001

09/833097

James C. Kennedy - Houston TX, US
John Trustman - Gloucester MA, US

HealthEdge, Inc. - New York NY

G10F 17/20, G10F 17/28, G06Q 50/00

704 9, 704 1, 704 2, 705 4

The disclosure includes a computer-implemented method of processing a claim. The method includes receiving information corresponding to a context free grammar expression of a provision governing claim adjudication, receiving information corresponding to a claim, and based on the received information, determining whether the at least one provision applies to the claim.