Patents by Inventor Daniel P. Miranker

Daniel P. Miranker 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: 6782505
    Abstract: A system and method for generating structured data outputs from a semi-structured data source. The steps of this method include generating an example output from an example generator. The example output is generated in response to the acquisition of a sequence of annotated strings. The annotated strings are generated in response to the acquisition and modification of at least one data example and corresponding coarse structure from a predetermined input source. Also, a second sequence of annotated strings is generated from input from a semi-structured data source. Both the example output and second sequence of annotated strings are input to an acquisition engine that implements a grammar layer incorporating a top-down parsing method and a comparison layer. The structured data outputs are generated through the cooperation of the comparison layer and the grammar layer.
    Type: Grant
    Filed: April 19, 1999
    Date of Patent: August 24, 2004
    Inventors: Daniel P. Miranker, L. Lance Obermeyer, Paul A. Navratil
  • Publication number: 20020021838
    Abstract: A system and method for examining a string of symbols and identifying portions of the string which match a predetermined pattern using adaptively weighted, partitioned context edit distances. A pattern is partitioned into context and value components, and candidate matches for each of the components is identified by calculating an edit distance between that component and each potentially matching set (sub-string) of symbols within the string. One or more candidate matches having the lowest edit distances are selected as matches for the pattern. The weighting of each of the component matches may be adapted to optimize the pattern matching and, in one embodiment, the context components may be heavily weighted to obtain matches of a value for which the corresponding pattern is not well defined. In one embodiment, an edit distance matrix is evaluated for each of a prefix component, a value component and a suffix component of a pattern.
    Type: Application
    Filed: July 26, 2001
    Publication date: February 21, 2002
    Applicant: Liaison Technology, Inc.
    Inventors: Alvin Charles Richardson, Charles Michael Davis, Daniel P. Miranker
  • Patent number: 4860201
    Abstract: A plurality of parallel processing elements are connected in a binary tree configuration, with each processing element except those in the highest and lowest levels being in communication with a single parent processing element as well as first and second (or left and right) child processing elements. Each processing element comprises a processor, a read/write or random access memory, and an input/output (I/O) device. The I/O device provides interfacing between each processing element and its parent and children processing elements so as to provide significant improvements in propagation speeds through the binary tree. The I/O device allows the presently preferred embodiment of the invention to be clocked at 12 megahertz, producing in the case of a tree of 1023 processors, each having an average instruction cycle time of 1.8 .mu.s, a system with a raw computational throughput of approximately 570 million instructions per second.
    Type: Grant
    Filed: September 2, 1986
    Date of Patent: August 22, 1989
    Assignee: The Trustees of Columbia University in the City of New York
    Inventors: Salvatore J. Stolfo, Daniel P. Miranker