Presentation is loading. Please wait.

Presentation is loading. Please wait.

Grammatical Machine Translation Stefan Riezler & John Maxwell Palo Alto Research Center.

Similar presentations

Presentation on theme: "Grammatical Machine Translation Stefan Riezler & John Maxwell Palo Alto Research Center."— Presentation transcript:

1 Grammatical Machine Translation Stefan Riezler & John Maxwell Palo Alto Research Center

2 Statistical Parsing and Statistical MT Previous work incorporated grammar-based SP* into phrase-based SMT systems for –pre-ordering source sentences (Xia & McCord COLING04; Collins et al. ACL05) –or re-ordering translation model output by linguistically informed statistical ordering models (Ding & Palmer ACL05; Quirk et al. ACL05) Integration of grammar-based generation: –Quirk et al. ACL05 show that simple statistical ordering model outperforms grammar-based generator of Menezes & Richardson 01 on BLEU score –Charniak et al. MT Summit03 show that parsing-based language model improves grammaticality but not BLEU * Notable exception: Syntax w/o grammars for SMT in Chiang ACL05!

3 Integrating Grammar-Based Generation into Phrase-Based SMT Goal: Investigate contribution of grammar-based generation to dependency-based SMT –Adapt phrase-extraction idea for extraction of dependency- structure snippets for grammar-based transfer –Same training and test data as phrase-based system of Koehn et al. HLT03 for snippet extraction and training –Statistical components modeled after phrase-based system of Koehn et al. HLT03, weights trained by MER Main difference: –Feed dependency-structure snippets into grammar-based generator, then apply language model and distortion model –Goal is foremost improving grammaticality, not reflecting ordering of reference translations

4 Extracting F-Structure Snippets for Transfer-Rule Induction Procedure: 1.Improved bidirectional word alignment (Och et al. EMNLP99) by intersecting alignment matrices for both translation directions, refining intersection alignment by adding directly adjacent alignment points, and adding alignment points that align previously unaligned words 2.Parsing source and target sentences using LFG grammars for German (Butt et al. COLING02) and English (Riezler et al. ACL02) 3.Select most similar f-structures in source and target according to crossing brackets measure

5 Extracting F-Structure Snippets, cont. Procedure, cont. 4.Define many-to-many correspondences between substructures of f-structures based on many-to- many word alignment 5.Extract primitive transfer rules directly from aligned f-structure units 6.Create powerset of possible combinations of basic rules and filter according to contiguity and type matching constraints

6 Extracting F-Structure Snippets, cont. Example sentences: Dafür bin ich zutiefst dankbar. I have a deep appreciation for that. Many-to-many word alignment: Dafür{6 7} bin{2} ich{1} zutiefst{3 4 5} dankbar{5} F-structure alignment:

7 Extracting Primitive Transfer Rules Rule (1) maps lexical predicates Rule (2) maps lexical predicates and interprets subj-to-subj link as indication to map subj of source with this predicate into subject of target and xcomp of source into object of target %X1, %X2, %X3, … are variables for f-structures (2) PRED(%X1, sein), SUBJ(%X1,%X2), XCOMP(%X1,%X3) ==> PRED(%X1, have), SUBJ(%X1,%X2) OBJ(%X1,%X3) (1) PRED(%X1, ich) ==> PRED(%X1, I)

8 Extracting Primitive Transfer Rules, cont. Primitive transfer rule (3) maps single source f-structure into target f-structure of preposition+object units (3) PRED(%X1, dafür) ==> PRED(%X1, for), OBJ(%X1,%X2) PRED(%X1,that)

9 Extracting Complex Transfer Rules Complex rules are created by taking all combinations of primitive rules, and filtering (4) sein zutiefst dankbar ==> have a deep appreciation (5) sein zutiefst dankbar dafür ==> have a deep appreciation for that (6) sein ich zutiefst dankbar dafür ==> have I a deep appreciation for that

10 Transfer Contiguity constraint Transfer contiguity constraint: 1.Source and target f-structures each have to be connected 2.F-structures in the transfer source can only be aligned with f-structures in the transfer target, and vice versa Analogous to constraint on contiguous and alignment-consistent phrases in phrase-based SMT Prevents extraction of rule that would translate dankbar directly into appreciation since appreciation is aligned also to zutiefst Transfer contiguity allows to learn idioms like es gibt - there is from configurations that are local in f- structure but non-local in string, e.g., es scheint […] zu geben - there seems […] to be

11 Linguistic Filters on Transfer Rules Morphological stemming of PRED values (Optional) filtering of f-structure snippets based on consistency of linguistic categories –Extraction of snippet that translates zutiefst dankbar into a deep appreciation maps incompatible categories adjectival and nominal; valid in string-based world –Translation of sein to have might be discarded because of adjectival vs. nominal types of their arguments –Larger rule mapping sein zutiefst dankbar to have a deep appreciation is ok since verbal types match

12 Parsing Lexical-functional grammars produce c(onstituent)- structures (~ context-free trees) and f(unctional)- structures (~ labeled dependency graphs encoding predicate-argument relations) Stochastic parsing by dynamic programming over packed parse forest using discriminatively trained log-linear model (Riezler et al. ACL02) –80.5% F-score on dependency-bank from WSJ 100% coverage by robust FRAGMENT grammar –parses out-of-scope input as well-formed chunks, with unparsable tokens possibly interspersed; correct parse chosen by fewest chunk method –FRAGMENT grammar is used in 20% of cases

13 Transfer Parallel application of transfer rules in non- deterministic fashion Each fact must be transferred by exactly one rule Default rule transfers any fact as itself Transfer works on chart using parsers unification mechanism for consistency checking Selection of most probable transfer output is done by beam-decoding on transfer chart

14 Generation Bi-directionality allows us to use same grammar for parsing training data and for generation in translation application Generator has to be fault-tolerant in cases where transfer-system operates on FRAGMENT parse or produces non-valid f-structures from valid input f- structures Robust generation from unknown (e.g., untranslated) predicates and from unknown f-structures

15 Robust Generation Generation from unknown predicates: –Unknown German word Hunde is analyzed by German grammar to extract stem (e.g., PRED = Hund, NUM = pl) and then inflected using English default morphology (Hunds) Generation from unknown constructions: –Default grammar that allows any attribute to be generated in any order is mixed as suboptimal option in standard English grammar, e.g. if SUBJ cannot be generated as sentence- initial NP, it will be generated in any position as any category

16 Statistical Models 1. Log-probability of source-to-target transfer rules, where probability r(e|f) or rule that transfers source snippet f into target snippet e is estimated by relative frequency 2. Log-probability of target-to-source transfer rules, estimated by relative frequency

17 Statistical Models, cont. 3. Log-probability of lexical translations l(e|f) from source to target snippets, estimated from Viterbi alignments a* between source word positions i=1, …n and target word positions j=1,…,m for stems f i and e j in snippets f and e with relative word translation frequencies t(e j |f i ): 4. Log-probability of lexical translations from target to source snippets

18 Statistical Model, cont. 5. Number of transfer rules 6. Number of transfer rules with frequency 1 7. Number of default transfer rules 8. Log-probability of strings of predicates from root to frontier of target f-structure, estimated from predicate trigrams in English f-structures 9. Number of predicates in target f-structure 10. Number of constituent movements during generations based on original order of head predicates of the constituents

19 Statistical Models, cont. 11. Number of generation repairs 12. Log-probability of target string as computed by trigram language model 13. Number of words in target string

20 Feature Weights 12345678910111213.35-.01.05.09-.19-.11-.03.12.18-. Weights estimated by MER training Most important features are –source-to-target transfer rule probability (1) –rule counts (5 & 6) – f-structure language model features (8 & 9) –constituent movements (10) –string language model features (12 & 13)

21 Experimental Evaluation Experimental setup –German-to-English on Europarl parallel corpus (Koehn 02) –Training and evaluation on sentences of length 5-15, for quick experimental turnaround –Resulting in training set of 163,141 sentences, development set of 1,967 sentences, test of 1,755 sentences (used in Koehn et al. HLT03) –Improved bidirectional word alignment based on GIZA++ (Och et al. EMNLP99) –LFG grammars for German and English (Butt et al. COLING02; Riezler et al. ACL02) –SRI trigram language model (Stocke02) –Comparison with PHARAOH (Koehn et al. HLT03) and IBM Model 4 as produced by GIZA++ (Och et al. EMNLP99)

22 Experimental Evaluation, cont. Around 700,000 transfer rules extracted from f- structures chosen by dependency similarity measure System operates on n-best lists of parses (n=1), transferred f-structures (n=10), and generated strings (n=1,000) Selection of most probable translations in two steps: –Most probable f-structure by beam search (n=20) on transfer chart using features 1-10 –Most probable string selected from strings generated from selected n-best f-structures using features 11-13 Feature weights for modules trained by MER on 750 in-coverage sentences of development set

23 Automatic Evaluation NIST scores (ignoring punctuation) & Approximate Randomization for significance testing (see above) Experimentwise significance level of.05 achieved by reducing per-comparison significance level to.01 in 3- fold comparison (see Cohen95) 44% in-coverage of grammars; 51% FRAGMENT parses and/or generation repair; 5% timeouts –In-coverage: Difference between LFG and P not significant –Suboptimal robustness techniques decrease overall quality M4LFGP in-coverage5.13*5.82*5.99 full test set*5.57*5.626.40

24 Manual Evaluation Closer look at in-coverage examples: –Random selection of 500 in-coverage examples –Two independent judges indicated preference for LFG or PHARAOH, or equality, in blind test –Separate evaluation under criteria of grammaticality/fluency and translational/semantic adequacy –Significance assessed by Approximate Randomization via stratified shuffling of preference ratings between systems

25 Manual Evaluation Result differences on agreed-on ratings are statistically significant at p < 0.0001 Net improvement in translational adequacy on agreed-on examples is 11.4% on 500 sentences (57/500), amounting to 5% overall improvement in hybrid system (44% of 11.4%) Net improvement in grammaticality on agreed-on examples is 15.4% on 500 sentences, amounting to 6.7% overall improvement in hybrid system adequacygrammaticality j1\j2PLFGeqPLFGeq P48873629 LFG1010518611317 equal53601925144223

26 Discussion High percentage of out-of-coverage examples –Accumulation of 2 x 20% error-rates in parsing training data –Errors in rule extraction –Together result in ill-formed transfer rules causing high number of generation failures/repairs Propagation of errors through the system also for in- coverage examples –Error analysis: 69% transfer errors, 10% due to parse errors Discrepancy between NIST and manual evaluation –Suboptimal integration of generator, making training and translation with large n-best lists infeasible –Language and distortion models applied after generation

27 Conclusion Integration of grammar-based generator into dependency-based SMT system achieves state-of- the-art NIST and improved grammaticality and adequacy on in-coverage examples Possibility of hybrid system since it is determinable when sentences are in coverage of system Current parsers and generators are not sufficiently accurate and efficient - possible advantages of deploying linguistic technology are overwhelmed by introduced errors

28 Examples: LFG > PHARAOH src: in diesem fall werde ich meine verantwortung wahrnehmen sef: then i will exercise my responsibility LFG: in this case i accept my responsibility P: in this case i shall my responsibilities src: die politische stabilität hängt ab von der besserung der lebensbedingungen ref: political stability depends upon the improvement of living conditions LFG: the political stability hinges on the recovery the conditions P: the political stability is rejects the recovery of the living conditions

29 Examples: LFG > PHARAOH src: und schließlich muß dieser agentur eine kritische haltung gegenüber der kommission selbst erlaubt sein ref: moreover the agency must be able to criticise the commission itself LFG: and even to the commission a critical stance must finally be allowed this agency P: finally this is a critical attitude towards the commission itself to be agency src: nach der ratifizierung werden co2 emissionen ihren preis haben ref: after ratification co2 emission will have a price tag LFG: carbon dioxide emissions have its price following the ratification P: after the ratification co2 emissions are a price

30 Examples: LFG > PHARAOH src: die lebensmittel müssen die sichere ernährung des menschen gewährleisten ref: mans food must be safe to eat LFG: food must guarantee the safe nutrition of the people P: the people of the nutrition safe food must guarantee

31 Examples: PHARAOH > LFG src: was wir morgen beschließen werden ist letztlich material für das vermittlungsverfahren sef: whatever we agree tomorrow will ultimately have to go into the conciliation procedure LFG: one tomorrow we approved what is ultimately material for the conciliation procedure P: what we decide tomorrow is ultimately material for the conciliation procedure src: die verwaltung muß zukünftig schneller reagieren können ref: in future the administration must be able to react more quickly LFG: more in future the administration must be able to react P: the administration must be able to react more quickly

32 Examples: PHARAOH > LFG src: das ist schon eine seltsame vorstellung von gleichheit ref: a strange notion of equality LFG: equality that is even a strange idea P: this is already a strange idea of equality src: frau präsidentin ich beglückwünsche herrn nicholson zu seinem ausgezeichneten bericht ref: madam president I congratulate mr nicholson on his excellent report LFG: madam president I congratulate mister nicholson on his report excellented P: madam president I congratulate mr nicholson for his excellent report

33 Examples: PHARAOH > LFG src: das ist jetzt über 40 jahre her ref: that was over 40 years ago LFG: on 40 years ago it is now P: that is now over 40 years ago

Download ppt "Grammatical Machine Translation Stefan Riezler & John Maxwell Palo Alto Research Center."

Similar presentations

Ads by Google