ROBUST REVERSIBLE FINITE-STATE APPROACH TO CONTEXTUAL GENERATION AND SEMANTIC PARSING

• US 20170031896A1
• Filed: 07/28/2015
• Published: 02/02/2017
• Est. Priority Date: 07/28/2015
• Status: Abandoned Application

• Current Assignee: Conduent Business Services, LLC (Conduent, Inc.)
• Original Assignee: Xerox Corporation (Xerox Holdings Corp.)
• Inventors: Xiao, Chunyang, Dymetman, Marc, Venkatapathy, Sriram
• Application Number:
  US14/811,005
• Publication Number:
  US 20170031896A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 40/216 using statistical methods
• CPC Class Codes: G06F 40/30 Semantic analysis

Abstract

A system and method permit analysis and generation to be performed with the same reversible probabilistic model. The model includes a set of factors, including a canonical factor, which is a function of a logical form and a realization thereof, a similarity factor, which is a function of a canonical text string and a surface string, a language model factor, which is a static function of a surface string, a language context factor, which is a dynamic function of a surface string, and a semantic context factor, which is a dynamic function of a logical form. When performing generation, the canonical factor, similarity factor, language model factor, and language context factor are composed to receive as input a logical form and output a surface string, and when performing analysis, the similarity factor, canonical factor, and semantic context factor are composed to take as input a surface string and output a logical form.

Claims

1. A method of providing for analysis and generation through a same probabilistic model, comprising:

providing a reversible probabilistic model comprising a set of factors comprising;

a canonical factor which is a function of a logical form and a realization;

a similarity factor, which is a function of a canonical text string and a surface string,

a language model factor, which is a static function of a surface string,

a language context factor, which is a dynamic function of a surface string, and

a semantic context factor, which is a dynamic function of a logical form;

the reversible probabilistic model being able to perform both analysis and generation,

wherein in performing generation, the canonical factor, similarity factor, language model factor, and language context factor are composed to receive as input a logical form selected from a set of logical forms and output at least one surface string, and

wherein in performing analysis, the similarity factor, canonical factor, and semantic context factor are composed to take as input a surface string and output at least one logical form in a set of logical forms, and

wherein the performing of the analysis and generation is implemented by a processor.

2. The method of claim 1, wherein the factors are finite state machines.

3. The method of claim 2, wherein the finite state machines are string-to-string finite state machines.

4. The method of claim 1 comprising conducting a dialog with a person, in which the analysis includes generating a first logical form for an input surface string received from the person and the generation includes generating an output surface string based on a second logical form.

5. The method of claim 1, further comprising updating at least one of the semantic context factor and the language context factor during a dialog.

6. The method of claim 5, wherein the updating of the semantic context factor is based on an expectation over logical forms in the set of logical forms.

7. The method of claim 5, wherein the updating of the language context factor is based on an expectation over words output by the similarity factor which are not exact matches of aligned words in corresponding canonical text strings.

8. The method of claim 1, wherein the similarity factor computes an edit distance between the canonical text string and the surface string which takes into account one or more of swaps, insertions, deletions, and replacements of words.

9. The method of claim 1, wherein the language model factor λ

(x), language context factor μ

(x), and semantic context factor ζ

(z) are unary factors of a candidate text string x or logical form z, respectively, that are implemented as weighted finite-state acceptors, with λ and

μ

being string automata, and ζ

being a tree automaton.

10. The method of claim 1, wherein the canonical factor κ

(z,y) and similarity factor σ

(y,x) are binary factors implemented as weighted finite-state transducers, σ

(y,x) being a string transducer, and the canonical factor κ

(z,y) being a tree-to-string transducer, where y is a canonical string, x is a surface string, and z is a logical form.

11. The method of claim 10, wherein the canonical factor is approximated by a weighted string-to-string automaton.

12. The method of claim 1, wherein the language model factor is an automaton that represents an n-gram language model over surface strings.

13. The method of claim 1, wherein the language model factor generates a score for each of a set of candidate text strings which favors strings in which the n-gram sequences are observed more frequently during training of the language model factor.

14. The method of claim 1, wherein the language context factor is a dynamic factor that changes during the course of a dialogue as a function of input text strings.

15. The method of claim 1, wherein the semantic context factor is a dynamic factor implemented as a weighted regular tree automaton that represents contextual expectations of a dialog manager.

16. The method of claim 1, wherein the logical forms are of the form:

Pred(Arg₁,Arg₂, . . . ,Arg_n).

where Pred is a predicate symbol which is associated with a number n of arguments Arg_i, for i=1 to n, where each Arg_i has a unique type, different from the type of Arg_j, for i≠

j, and the different types are associated with disjoint classes of symbols.

17. A computer program product comprising a non-transitory recording medium storing instructions, which when executed on a computer, causes the computer to perform the method of claim 1.

18. A system comprising memory which stores instructions for performing the method of claim 1 and a processor in communication with the memory for executing the instructions.

19. A system for performing analysis and generation comprising:

memory which stores a reversible probabilistic model comprising a set finite state machines comprising;

a canonical finite state machine, which is a function of a logical form and a canonical text string which is a realization of the logical form;

a similarity finite state machine, which is a function of a canonical text string and a surface string,

a language model finite state machine which is a static function of a surface string,

a language context finite state machine, which is a dynamic function of a surface string, and

a semantic context finite state machine, which is a dynamic function of a logical form;

a dialog manager which inputs logical forms and surface strings to the reversible probabilistic model for performing analysis and generation,

wherein in performing generation the canonical finite state machine, similarity finite state machine, language model finite state machine, and language context finite state machine of the reversible probabilistic model are composed to receive as input a logical form selected from a set of logical forms and output at least one surface string, and

wherein in performing analysis, the similarity finite state machine, canonical finite state machine, and semantic context finite state machine of the reversible probabilistic model are composed to take as input a surface string and output at least one logical form in a set of logical forms, and

a processor which implements the dialog manager.

20. A computer implemented method for conducting a dialog comprising:

providing in computer memory a reversible probabilistic model able to perform both analysis and generation, the reversible probabilistic model comprising a set of finite state machines comprising;

a canonical finite state machine, which is a function of a logical form and a canonical text string, which is a realization of the logical form;

a similarity finite state machine, which is a function of a canonical text string and a surface string,

a language model finite state machine which is a static function of a surface string,

a language context finite state machine, which is a dynamic function of a surface string; and

a semantic context finite state machine, which is a dynamic function of a logical form;

receiving a surface text string uttered by a person;

analyzing the received surface text string, wherein in the analysis, the similarity factor, canonical factor, and semantic context factor are composed to take as input the surface string and output a first of a set of logical forms, and

selecting a second logical form based on the first logical form;

generating at least one surface string, wherein in the generation, the canonical factor, similarity factor, language model factor, and language context factor are composed to receive as input the second logical form and output at least one surface string; and

outputting one of the at least one surface string or a surface string derived therefrom for communication to the person on a computing device,

wherein the analyzing and generation are implemented by a processor.