×

Computer system with natural language to machine language translator

  • US 7,085,708 B2
  • Filed: 06/18/2001
  • Issued: 08/01/2006
  • Est. Priority Date: 09/23/2000
  • Status: Active Grant
First Claim
Patent Images

1. A natural language processing apparatus for translating natural language into a formal language executable on a programmable device, said system comprising,a) memory for storing data;

  • b) a data processor;

    c) an input device for presenting natural language text to said system;

    d) a text parser for partitioning said text into a sequence of sequences of strings of characters or pretokens;

    e) a lexicon for storing lexical terms as token associated with lexical type and reference data;

    f) a lexical type assignment process for assigning lexical types to pretokens by comparison to terms in the lexicon;

    g) a lexical insertion processor for inserting terms into the lexicon under specific control;

    h) a control processor for invoking lexical insertions under the condition that a pretoken is not recognized as a lexical token;

    i) a type contextualization processor by which refined lexical types may be reassigned to tokens depending on syntactic context;

    j) a type reduction matrix;

    k) a term reduction processor which uses said type reduction matrix to determine proper syntactic dependencies between tokens in a sentence;

    l) a term inversion processor for constructing chains of syntactic dependencies among lexical terms in an expression and for determining proper dependencies between those chains;

    m) a syntactic tree generation processor for constructing syntactic trees representing the syntactic structure of each expression processed by the processors;

    n) a syntactic algebra comprising syntactic terms formally representing processed expressions;

    o) a syntactic representation processor for constructing syntactic terms to represent formal syntactic structures of processed expressions;

    p) a semantic algebra comprising semantic objects as formal references of appropriate terms in the syntactic algebra;

    q) a semantic representation processor for associating internal semantic object references with terms in the syntactic algebra;

    r) a semantic tensor algebra comprising correlated pairs of syntactic algebraic terms and their semantic object representations;

    s) a formal representation processor for associating appropriate internal formal models with terms in the semantic tensor algebra;

    t) a formal interpretation processor for transforming terms in the syntactic algebra into equivalent expressions in an internal formal language;

    u) an external representation processor for associating external operational environments with internal formal models;

    v) an external interpretation processor for translating expressions in an internal formal language into equivalent formal expressions executable into appropriate external operational environments.

View all claims
  • 6 Assignments
Timeline View
Assignment View
    ×
    ×