×

Error-tolerant language understanding system and method

  • US 7,333,928 B2
  • Filed: 12/18/2002
  • Issued: 02/19/2008
  • Est. Priority Date: 05/31/2002
  • Status: Expired due to Fees
First Claim
Patent Images

1. An error-tolerant language understanding method comprising the following steps:

  • (a) Inputting at least one word sequence and its corresponding acoustic score;

    (b) Parsing said word sequence to obtain a corresponding concept sequence set;

    (c) Attach at least one confidence measure sequence to each concept sequence in the said concept sequence set and compare the concept sequences together with their associated confidence measure sequences against at least one exemplary concept sequence to obtain at least one edit operation sequence;

    (d) According to said acoustic score of said word sequence, the corresponding grammar score of a concept sequence in said concept sequence set, the corresponding example score of said exemplary concept sequence and the corresponding edit operation score of said edit operation sequence to determine the most possible concept sequence; and

    (e) Translating said most possible concept sequence into a semantic frame,wherein the step (d) further comprising;

    Using a probabilistic scoring function to determine said the most possible concept sequence, and said probabilistic scoring function is formulated as follows;

    ( W , F , C , M , K , E ) = arg



    max
    ( W , F , C , M , K , E )


    { S W + S F + S K + S E }
    wherein custom character is the most possible word sequence in the sentence list that outputs from the speech recognition module, custom character is the most possible concept parse forest, custom character is the corresponding concept sequence, custom character is the corresponding confidence measure sequences, custom character is the most possible exemplary concept sequence and custom character is the most possible edit operation sequence, SW is the acoustic score, SF is the grammar score, SK is the example score and SE is the edit operation score, wherein S W = log



    P

    ( U | W )
    , S F =

    T

    F
    , A

    α



    T i


    log



    P (

    α

    | A
    )
    , S K =

    i = l m




    log



    P

    ( k i | k i - 1 )
    , S E =

    e

    E
    , e = <

    ɛ

    , k q >





    log



    P

    ( e )
    +

    e

    E
    , e = <

    c p
    , g >





    h = 1 X




    log



    P

    ( e | δ

    h , p
    )
    ,


    U represents a utterance signal, W represents said possible word sequence in the sentence list that outputs from the speech recognition module, F represents a possible concept parses forest of W T is a concept parse tree of said concept parse forest F, A→

    α

    is a concept grammar that generates said T, A is a left-hand-side symbol and α

    is right-hand-side symbols, m is the number of concept in exemplary concept sequence K, k1m is a brief note of k1 . . . km, ki is the ith concept, e is an edit operation in edit operation sequence E, said utterance signal U is processed with X number of confidence measure modules and X number of confidence measure sequences are generated, one of said confidence measure sequences Mh corresponding to the r number of c1 . . . cr concepts is expressed as M h = δ

    h , 1








    δ

    h , r
    = δ

    h , 1 h , r
    , h

    [ 1 , X ] .

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×