Tree Automata for Automatic Language Translation.ppt

Tree Automata Toolkits forUsed in NLP % echo A(B(C) B(B(C))) | tiburon -k 1 - even.rtg three.rtg A(B(C) B(B(C))): 3.16E-9 % echo A(B(C) B(C)) | tiburon -k 1 - even.rtg three.rtg Warning: returning fewer trees than requested 0 Back to the Outline History of the World (of Automata for NLP) Weighted string automata in NLP Applications transliteration machine translation language modeling speech, lexical processing, tagging, summarization, optical character recognition, … Generic algorithms and toolkits Weighted tree automata in NLP Applications Generic algorithms and toolkits Some connections with theory Desirable Properties of Transducer Formalism Expressiveness Can express the knowledge needed to capture the transformation solve the linguistic problem Modularity Can integrate smaller components into bigger systems, co-ordinate search Inclusiveness Encompasses simpler formalisms Teachability Can learn from input/output examples Desirable Formal Properties of Transformation Formalism Modularity be closed under composition Inclusiveness capture any transformation that a string-based FST can Teachability given input/output tree pairs, find locally optimal rule probabilities in low-polynomial time Expressiveness see next few slides Expressiveness S X VP Y Z Y X Z S PRO VP VB X there are hay X NP X PP of P Y Y X Re-Ordering Non-constituent Phrases Lexicalized Re-Ordering VP VBZ VBG is está cantando Phrasal Translation singing VP VB X PRT put poner X Non-contiguous Phrases on NPB DT X the X Context-Sensitive Word Insertion/Deletion some necessary things for machine translation Expressiveness S VP NP DT N V NP the boy saw DT N the door * S S’ CONJ V NP wa- [and] ra’aa [saw] N atefl [the boy] NP N albab [the door] Local rotation Desirable Formal Properties of Transformation Formalism How do different tree formalisms fare? Expressiveness do local rotation Modularity be closed under composition Inclusiveness capture any transfor