Patents by Inventor Charles K. Williams
Charles K. Williams 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: 10565197Abstract: A system creates a query name bitmap signature comprising at least one bigram for a query name. The system calculates a query name bitmap range for the query name based on a match threshold and a number of bigrams in the query name bitmap signature. The system creates a data list name bitmap signature comprising at least one bigram, for each of a plurality of data list names, and identifies a subset of the plurality of data list names. The subset comprises data list name bitmap signatures that are within the query name bitmap range. The system reduces a number of comparisons by comparing only the query name and each of the subset of the plurality of data list names when performing the analytical name search. The system also reduces the number of comparisons by reducing the number of bit positions that are compared.Type: GrantFiled: March 2, 2017Date of Patent: February 18, 2020Assignee: International Business Machines CorporationInventors: Brian E. Macy, Bin Qin, Stephen J. Watjen, Frank E. Whaley, Charles K. Williams
-
Publication number: 20180253472Abstract: A system creates a query name bitmap signature comprising at least one bigram for a query name. The system calculates a query name bitmap range for the query name based on a match threshold and a number of bigrams in the query name bitmap signature. The system creates a data list name bitmap signature comprising at least one bigram, for each of a plurality of data list names, and identifies a subset of the plurality of data list names. The subset comprises data list name bitmap signatures that are within the query name bitmap range. The system reduces a number of comparisons by comparing only the query name and each of the subset of the plurality of data list names when performing the analytical name search. The system also reduces the number of comparisons by reducing the number of bit positions that are compared.Type: ApplicationFiled: March 2, 2017Publication date: September 6, 2018Inventors: Brian E. MACY, Bin QIN, Stephen J. WATJEN, Frank E. WHALEY, Charles K. WILLIAMS
-
Patent number: 9747273Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.Type: GrantFiled: August 19, 2014Date of Patent: August 29, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shudong Huang, Jeffrey J. Jonas, Brian E. Macy, Frankie E. Patman Maguire, Charles K. Williams
-
Patent number: 9747274Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.Type: GrantFiled: April 15, 2015Date of Patent: August 29, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shudong Huang, Jeffrey J. Jonas, Brian E. Macy, Frankie E. Patman Maguire, Charles K. Williams
-
Publication number: 20160055144Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.Type: ApplicationFiled: April 15, 2015Publication date: February 25, 2016Inventors: Shudong Huang, Jeffrey J. Jonas, Brian E. Macy, Frankie E. Patman Maguire, Charles K. Williams
-
Publication number: 20160055141Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.Type: ApplicationFiled: August 19, 2014Publication date: February 25, 2016Inventors: Shudong Huang, Jeffrey J. Jonas, Brian E. Macy, Frankie E. Patman Maguire, Charles K. Williams
-
Patent number: 9020911Abstract: Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.Type: GrantFiled: January 18, 2012Date of Patent: April 28, 2015Assignee: International Business Machines CorporationInventors: David E. Biesenbach, Steven J. Liddle, Stephen J. Watjen, Charles K. Williams
-
Patent number: 9015132Abstract: Provided are techniques for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.Type: GrantFiled: April 12, 2012Date of Patent: April 21, 2015Assignee: International Business Machines CorporationInventors: David E. Biesenbach, Steven J. Liddle, Stephen J. Watjen, Charles K. Williams
-
Publication number: 20130185327Abstract: Provided are techniques for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.Type: ApplicationFiled: April 12, 2012Publication date: July 18, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David E. BIESENBACH, Steven J. LIDDLE, Stephen J. WATJEN, Charles K. WILLIAMS
-
Publication number: 20130185326Abstract: Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.Type: ApplicationFiled: January 18, 2012Publication date: July 18, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David E. BIESENBACH, Steven J. LIDDLE, Stephen J. WATJEN, Charles K. WILLIAMS
-
Patent number: 8229737Abstract: A particular technique for classifying a name includes accessing a name; dividing the name into a series of first n-grams; forming multiple concatenated second n-grams by concatenating pairs of the first n-grams; for each of multiple groups, for each of the second n-grams, determining the term frequency-group frequency score; for each of the multiple groups, summing up the term frequency-group frequency scores for each second n-gram for that group; and determining a likelihood that the name belongs to one group of the multiple groups based on the summed scores, wherein a largest summed score indicates a greater likelihood that the name belongs to the one group.Type: GrantFiled: January 6, 2010Date of Patent: July 24, 2012Assignee: International Business Machines CorporationInventor: Charles K. Williams
-
Publication number: 20100114812Abstract: A particular technique for classifying a name includes accessing a name; dividing the name into a series of first n-grams; forming multiple concatenated second n-grams by concatenating pairs of the first n-grams; for each of multiple groups, for each of the second n-grams, determining the term frequency-group frequency score; for each of the multiple groups, summing up the term frequency-group frequency scores for each second n-gram for that group; and determining a likelihood that the name belongs to one group of the multiple groups based on the summed scores, wherein a largest summed score indicates a greater likelihood that the name belongs to the one group.Type: ApplicationFiled: January 6, 2010Publication date: May 6, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Charles K. Williams
-
Patent number: 5039625Abstract: A Maximum Areal Density Recessed Oxide Isolation (MADROX) process for forming semiconductor devices, in which forms an insulating layer is formed on a monocrystalline silicon substrate and a patterned polycrystalline silicon-containing layer is formed on the insulating layer. The substrate is then subjected to a low temperature plasma assisted oxidation to form recessed oxide isolation areas in the exposed regions of the substrate, with minimal encroachment under the patterned polycrystalline silicon-containing layer. The patterned polycrystalline silicon-containing layer acts as a mask, without itself being oxidized. Low temperature recessed oxide isolation regions may thereby be formed, without "bird's beak" formation. Maximum Areal Density Bipolar and Field Effect Transistor (MADFET) devices may be formed, using the patterned polycrystalline silicon-containing layer as a device contact if desired.Type: GrantFiled: April 27, 1990Date of Patent: August 13, 1991Assignee: MCNCInventors: Arnold Reisman, Mark Kellam, Charles K. Williams, Nandini Tandon