John T Hermansen, Age 412207 Wakerobin Ln, Herndon, VA 20191

6963871, Nov 8, 2005

Mar 25, 1999

09/275766

John Christian Hermansen - Catharpin VA, US
Heather McCallum-Bayliss - McLean VA, US
Richard D. Lutz - Silver Spring MD, US

Language Analysis Systems, Inc. - Herndon VA

G06F017/30

707 6, 707 3, 707101, 7071041, 704 1

An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

8041560, Oct 18, 2011

Aug 22, 2008

12/197119

John Christian Hermansen - Catharpin VA, US
Heather McCallum-Bayliss - McLean VA, US
Richard D. Lutz - Silver Spring MD, US

International Business Machines Corporation - Armonk NY

G06F 17/30
G06F 17/21
G10L 15/04
G06F 17/20
G10L 21/00

704 10, 704 1, 704251, 704270, 707 3, 707 6

An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

2004000, Jan 1, 2004

Mar 14, 2002

10/096828

Leonard Shaefer - Ashburn VA, US
John Hermansen - Catharpin VA, US
Heather McCallum-Bayliss - McLean VA, US

G06F017/28

704/005000

A system and method for formulating reasonable spelling variations of name. The system, according to one embodiment, includes a user interface that enables a user to input a name. The system also includes a set of rules (also referred to as “rule set”) and a storage unit that stores a list of names (also referred to as “name database”). The system includes a computer software module (“rules engine”) that implements an algorithm that takes as input the name supplied by the user and the set of rules and, from that input, generates an intermediate representation of the query name, wherein the intermediate representation represents a broad set of possible spelling variations of the name. Next, the system determines the set of names included in the name database that match the intermediate representation. This matching set of names are the names that the system determines to be reasonable spelling variations of the query name.

2005027, Dec 8, 2005

Jul 26, 2005

11/188979

John Hermansen - Catharpin VA, US
Leonard Shaefer - Ashburn VA, US
Heather McCallum-Bayliss - McLean VA, US
Richard Lutz - Silver Spring MD, US

G06F007/00

707100000

An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

2007000, Jan 4, 2007

Jan 25, 2002

10/055178

John Hermansen - Catharpin VA, US
Leonard Shaefer - Ashburn VA, US
Heather McCallum-Bayliss - McLean VA, US
Richard Lutz - Silver Spring MD, US

G06F 17/30

707003000

An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

4914590, Apr 3, 1990

May 18, 1988

7/195237

Robert B. Loatman - Vienna VA
Stephen D. Post - McLean VA
Chih-King Yang - Rockville MD
John C. Hermansen - Catharpin VA

Emhart Industries, Inc. - Indianapolis IN

G06F 1521
G06F 1518
G06K 962

364419

A hybrid natural language understanding (NLU) system which is particularly designed for processing natural language text. Primary functional components of the NLU system include a preprocessor; a word look-up and morphology module which communicates with a lexicon and a learning module; a syntactic parser which interfaces with an augmented transition network (ATN) grammar; a case frame applier, which converts the syntactic structure into canonical, semantic "case frames"; and a discourse analysis component which integrates explicit and implied information in the text into a conceptual structure which represents its meaning. This structure may be passed on to a knowledge based system, data base, to interested analysts or decision makers, etc. Significant feedback points are provided, e. g. , the case frame applier may notify the syntactic parser of a semantically incorrect parse, or the syntactic parser may seek a semantic judgment based on a fragmentary parse.