Linking Theorems for Tree Transducers
|
|
- Angel Benson
- 5 years ago
- Views:
Transcription
1 Linking Theorems for Tree Transducers Andreas Maletti peyer October 1, 2015 Andreas Maletti Linking Theorems for MBOT Theorietag / 32
2 tatistical Machine Translation w kana ynzran -BJ PP-CLR PP-MNR Aly b h $kl mdhk him a funny way at looking PP-CLR in PP they were And -BJ
3 tatistical Machine Translation w kana ynzran -BJ PP-CLR PP-MNR Aly b h $kl mdhk him a funny way at looking PP-CLR in PP they were And -BJ
4 tatistical Machine Translation ynzran w kana -BJ PP-CLR Aly h PP-MNR b $kl mdhk h him b b $kl in $kl a. way mdhk mdhk funny w w And Aly Aly at kana kana -BJ they. were ynzran ynzran looking him at looking PP-CLR a funny way in PP they were And -BJ
5 tatistical Machine Translation ynzran w kana -BJ PP-CLR PP-MNR Aly b $kl mdhk h him b b $kl in $kl a. way mdhk mdhk funny w w And Aly Aly at kana kana -BJ they. were ynzran ynzran looking $kl mdhk $kl Aly b ynzran PP-CLR PP kana w kana
6 tatistical Machine Translation ynzran w kana -BJ PP-CLR PP-MNR Aly b $kl mdhk h him b b $kl in $kl a. way mdhk mdhk funny w w And Aly Aly at kana kana -BJ they. were ynzran ynzran looking PP-CLR PP-CLR PP-CLR Aly Aly Aly $kl mdhk $kl b $kl mdhk $kl mdhk $kl ynzran PP-CLR PP kana w kana
7 tatistical Machine Translation ynzran w kana -BJ PP-CLR PP-MNR b h him b b $kl in $kl a. way mdhk mdhk funny w w And Aly Aly at kana kana -BJ they. were ynzran ynzran looking ynzran PP-CLR PP kana b PP-CLR PP-CLR PP-CLR Aly Aly $kl mdhk $kl mdhk $kl w kana
8 tatistical Machine Translation ynzran w kana -BJ PP-CLR PP-MNR b h him b b $kl in $kl a. way mdhk mdhk funny w w And Aly Aly at kana kana -BJ they. were ynzran ynzran looking ynzran PP-CLR PP kana b PP-CLR PP-CLR PP-CLR Aly Aly $kl mdhk $kl mdhk $kl w kana PP-MNR PP-MNR b b PP
9 tatistical Machine Translation Extracted rules w w kana kana. kana $kl mdhk $kl mdhk $kl PP-MNR PP-MNR b ynzran b -BJ PP h w w And PP-CLR PP-MNR him b b $kl mdhk in $kl a. way mdhk funny kana kana they. were ynzran ynzran looking Aly Aly at PP-CLR PP-CLR ynzran PP-CLR PP-MNR Aly PP-CLR Aly
10 Linear Multi Tree Transducer MBOT linear multi tree transducer (Q, Σ, I, R) finite set Q alphabet Σ states input and output symbols I Q initial states finite set R T Σ (Q) Q T Σ (Q) rules each Q occurs at most once in l (l,, r) R each Q that occurs in r also occurs in l (l,, r) R
11 Linear Multi Tree Transducer yntactic properties MBOT (Q, Σ, I, R) is linear tree transducer with regular look-ahead (XTOP R ) if r 1 linear tree transducer (XTOP) if r = 1 (l,, r) R (l,, r) R
12 Linear Multi Tree Transducer yntactic properties MBOT (Q, Σ, I, R) is linear tree transducer with regular look-ahead (XTOP R ) if r 1 linear tree transducer (XTOP) if r = 1 ε-free if l / Q (l,, r) R (l,, r) R (l,, r) R
13 Linear Multi Tree Transducer Extracted rules w w kana kana. kana $kl mdhk $kl mdhk $kl PP-MNR PP-MNR b ynzran b -BJ PP h w w And PP-CLR PP-MNR him b b $kl mdhk in $kl a. way mdhk funny kana kana they. were ynzran ynzran looking Aly Aly at PP-CLR PP-CLR ynzran PP-CLR PP-MNR Aly PP-CLR Aly Properties XTOP R : XTOP: ε-free:
14 Another Example Textual example MBOT M = (Q, Σ, {}, R) Q = {,, id, id } Σ = {,, γ, α} the following rules in R: (, ) (, ) (, ) (id, id ), (id, id ) γ(id) id,id γ(id) α id,id α
15 Another Example Graphical representation, id id id id γ id id,id γ id α id,id α Properties XTOP R : XTOP: ε-free:
16 emantics Rules, id id id id γ id id,id γ id α id,id α
17 emantics Rules, id id id id γ id id,id γ id α id,id α
18 emantics Rules, id id id id γ id id,id γ id α id,id α
19 emantics Rules, id id id id γ id id,id γ id α id,id α id id id id
20 emantics Rules, id id id id γ id id,id γ id α id,id α id id id id
21 emantics Rules, id id id id γ id id,id γ id α id,id α α α α α α α α α
22 emantics Rules, id id id id γ id id,id γ id α id,id α α α γ α α α α α α α
23 emantics id id id id entential forms t, A, D, u t T Σ (Q) A N N D N N u T Σ (Q) input tree active links (red) disabled links (gray) output tree
24 emantics M w w M w kana w kana kana M w And kana kana kana M w And they kana were
25 emantics Dependencies and relation state-computed dependencies: M = { t, D, u t, u T Σ,, {(ε, ε)},, M t,, D, u } computed dependencies: dep(m) = I M
26 emantics Dependencies and relation state-computed dependencies: M = { t, D, u t, u T Σ,, {(ε, ε)},, M t,, D, u } computed dependencies: dep(m) = I M computed transformation: τ M = {(t, u) t, D, u dep(m)}
27 Further Properties Regularity-preserving transformation τ T Σ T Σ preserves regularity if τ(l) = {u (t, u) τ, t L} is regular for all regular L T Σ rp-mbot = regularity preserving transformations computable by MBOT Compositions τ 1 ; τ 2 = {(s, u) t : (s, t) τ 1, (t, u) τ 2 } support modular development allow integration of external knowledge sources occur naturally in uery rewriting
28 Contents 1 Basics 2 Linking techniue
29 Dependencies Recent research Bojańczyk, ICALP 2014 Maneth et al., ICALP 2015 on models with dependencies
30 Dependencies Hierarchical properties A dependency t, D, u is input hierarchical if 1 w 2 w 1 2 (v 1, w 1 ) D with w 1 w 2 for all (v 1, w 1 ), (v 2, w 2 ) D with v 1 < v 2
31 Dependencies Hierarchical properties A dependency t, D, u is input hierarchical if 1 w 2 w 1 2 (v 1, w 1 ) D with w 1 w 2 for all (v 1, w 1 ), (v 2, w 2 ) D with v 1 < v 2
32 Dependencies Hierarchical properties A dependency t, D, u is input hierarchical if 1 w 2 w 1 2 (v 1, w 1 ) D with w 1 w 2 for all (v 1, w 1 ), (v 2, w 2 ) D with v 1 < v 2 strictly input hierarchical if 1 v 1 < v 2 implies w 1 w 2 2 v 1 = v 2 implies w 1 w 2 or w 2 w 1 for all (v 1, w 1 ), (v 2, w 2 ) D
33 Dependencies Distance properties A dependency t, D, u is input link-distance bounded by b N if for all (v 1, w 1 ), (v 1 v, w 2 ) D with v > b (v 1 v, w 3 ) D such that v < v and 1 v b
34 Dependencies Distance properties A dependency t, D, u is input link-distance bounded by b N if for all (v 1, w 1 ), (v 1 v, w 2 ) D with v > b (v 1 v, w 3 ) D such that v < v and 1 v b
35 Dependencies Distance properties A dependency t, D, u is input link-distance bounded by b N if for all (v 1, w 1 ), (v 1 v, w 2 ) D with v > b (v 1 v, w 3 ) D such that v < v and 1 v b strict input link-distance bounded by b if for all v 1, v 1 v pos(t) with v > b (v 1 v, w 3 ) D such that v < v and 1 v b
36 Dependencies α α γ α α α α α α α
37 Dependencies
38 Dependencies strictly input hierarchical
39 Dependencies strictly input hierarchical and strictly output hierarchical
40 Dependencies strictly input hierarchical and strictly output hierarchical with strict input link-distance 2
41 Dependencies strictly input hierarchical and strictly output hierarchical with strict input link-distance 2 and strict output link-distance 1
42 Dependencies hierarchical link-distance bounded Model \ Property input output input output XTOP R strictly strictly strictly MBOT strictly strictly
43 Linking Theorem Theorem Let M 1,..., M k be ε-free XTOP R over Σ such that {(c[t 1,..., t n ], c [t 1,..., t n ]) t 1,..., t n T } τ M1 ; ; τ Mk for some contexts c, c C Σ (X n ) and special T T Σ. 1 i k, 1 j n t j T, u i 1, D i, u i dep(m i ), (v ji, w ji ) D i such that u 0 = c[t 1,..., t n ] and u k = c [t 1,..., t n ] pos xj (c ) w jk v ji w j(i 1) if i 2 pos xj (c) v j1
44 Linking Theorem Corollary [Arnold, Dauchet, TC 1982] Illustrated relation τ cannot be computed by any ε-free XTOP R t 2 t 1 t 1 t 4 t 3 t 3 t 2 t n 3 t n 2 t n 3 t n 4 t n t n 1 t n t n 1 t n 2
45 Linking Theorem Corollary [M. et al., ICOMP 2009] Illustrated relation τ cannot be computed by any ε-free XTOP R γ γ s t u s t u
46 Topicalization Example It rained yesterday night. Topicalized: Yesterday night, it rained.
47 Topicalization Example It rained yesterday night. Topicalized: Yesterday night, it rained. We toiled all day yesterday at the restaurant that charges extra for clean plates. Topicalized: At the restaurant that charges extra for clean plates, we toiled all day yesterday.
48 Topicalization On the tree level PRP VBD AD it rained NN RB night yesterday, NN yesterday NN night PRP it VBD rained
49 Topicalization On the tree level PRP we VBD toiled DT all NN day NN yesterday PP IN at DT the NN restaurant BAR WH WDT that VBZ charges JJ extra PP IN for JJ clean NN plates PP IN at DT the NN restaurant BAR WH WDT that VBZ charges JJ extra PP IN for JJ clean NN plates, PRP we VBD toiled DT all NN day NN yesterday
50 Topicalization t 2 t 1 t 3 t 2 t n 1 t 3 t n t 1 t n 1 t n Theorem Topicalization is in rp-mbot
51 Topicalization Theorem Topicalization cannot be computed by any composition of ε-free XTOP R u 1 u 2 u 0 u 3 t 2 t 3? (1) (2). (3). t 1 t 2 t n 1 t n t 1 v 12 v 13 t 3 t n 1 t n v (n 1)2 v n2 v n3 v (n 1)3 3 ε-free XTOP R sufficient to simulate any composition of ε-free XTOP R
52 Topicalization Corollary (XTOP R ) rp-mbot
53 Linking Theorem Theorem Let M = (Q, Σ, I, R) be an ε-free MBOT such that {(c[t 1,..., t n ], c [t 1,..., t n ]) t 1,..., t n T } τ M for some contexts c, c C Σ (X n ) and special T T Σ. 1 j n, t j T, u, D, u dep(m), (v j, w j ) D with u = c[t 1,..., t n ] and u = c [t 1,..., t n ] pos xj (c) v j pos xj (c ) w j
54 Linking Theorem Corollary Inverse of topicalization cannot be computed by any ε-free MBOT t 1 t 2 t 2 t 3 t 3 t n 1 t n 1 t n t n t 1
55 ummary & References ummary 1 (XTOP R ) rp-mbot 2 rp-mbot not closed under inverses 3 What happens to invertable MBOT?
56 ummary & References ummary 1 (XTOP R ) rp-mbot 2 rp-mbot not closed under inverses 3 What happens to invertable MBOT? References J. Engelfriet, E. Lilin, : Extended multi bottom-up tree transducers Composition and decomposition. Acta Inf., 2009 Z. Fülöp, : Composition closure of ε-free linear extended top-down tree transducers. Proc. 17th DLT, LNC 7907, 2013 P. Koehn: tatistical machine translation. Cambridge Univ. Press, 2009, J. Graehl, M. Hopkins, K. Knight: The power of extended top-down tree transducers. IAM J. Comput., 2009
Applications of Tree Automata Theory Lecture VI: Back to Machine Translation
Applications of Tree Automata Theory Lecture VI: Back to Machine Translation Andreas Maletti Institute of Computer Science Universität Leipzig, Germany on leave from: Institute for Natural Language Processing
More informationThe Power of Weighted Regularity-Preserving Multi Bottom-up Tree Transducers
International Journal of Foundations of Computer cience c World cientific Publishing Company The Power of Weighted Regularity-Preserving Multi Bottom-up Tree Transducers ANDREA MALETTI Universität Leipzig,
More informationApplications of Tree Automata Theory Lecture V: Theory of Tree Transducers
Applications of Tree Automata Theory Lecture V: Theory of Tree Transducers Andreas Maletti Institute of Computer Science Universität Leipzig, Germany on leave from: Institute for Natural Language Processing
More informationComposition Closure of ε-free Linear Extended Top-down Tree Transducers
Composition Closure of ε-free Linear Extended Top-down Tree Transducers Zoltán Fülöp 1, and Andreas Maletti 2, 1 Department of Foundations of Computer Science, University of Szeged Árpád tér 2, H-6720
More informationHow to train your multi bottom-up tree transducer
How to train your multi bottom-up tree transducer Andreas Maletti Universität tuttgart Institute for Natural Language Processing tuttgart, Germany andreas.maletti@ims.uni-stuttgart.de Portland, OR June
More informationThe Power of Tree Series Transducers
The Power of Tree Series Transducers Andreas Maletti 1 Technische Universität Dresden Fakultät Informatik June 15, 2006 1 Research funded by German Research Foundation (DFG GK 334) Andreas Maletti (TU
More informationMulti Bottom-up Tree Transducers
Multi Bottom-up Tree Transducers Andreas Maletti Institute for Natural Language Processing Universität tuttgart, Germany maletti@ims.uni-stuttgart.de Avignon April 24, 2012 Multi Bottom-up Tree Transducers
More informationPreservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers
Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers Nina eemann and Daniel Quernheim and Fabienne Braune and Andreas Maletti University of tuttgart, Institute for Natural
More informationHierarchies of Tree Series TransducersRevisited 1
Hierarchies of Tree Series TransducersRevisited 1 Andreas Maletti 2 Technische Universität Dresden Fakultät Informatik June 27, 2006 1 Financially supported by the Friends and Benefactors of TU Dresden
More informationLecture 7: Introduction to syntax-based MT
Lecture 7: Introduction to syntax-based MT Andreas Maletti Statistical Machine Translation Stuttgart December 16, 2011 SMT VII A. Maletti 1 Lecture 7 Goals Overview Tree substitution grammars (tree automata)
More informationCompositions of Extended Top-down Tree Transducers
Compositions of Extended Top-down Tree Transducers Andreas Maletti ;1 International Computer Science Institute 1947 Center Street, Suite 600, Berkeley, CA 94704, USA Abstract Unfortunately, the class of
More informationStatistical Machine Translation of Natural Languages
1/26 Statistical Machine Translation of Natural Languages Heiko Vogler Technische Universität Dresden Germany Graduiertenkolleg Quantitative Logics and Automata Dresden, November, 2012 1/26 Weighted Tree
More informationTree Transducers in Machine Translation
Tree Transducers in Machine Translation Andreas Maletti Universitat Rovira i Virgili Tarragona, pain andreas.maletti@urv.cat Jena August 23, 2010 Tree Transducers in MT A. Maletti 1 Machine translation
More informationExtended Multi Bottom-Up Tree Transducers
Extended Multi Bottom-Up Tree Transducers Joost Engelfriet 1, Eric Lilin 2, and Andreas Maletti 3;? 1 Leiden Instite of Advanced Comper Science Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands
More informationKey words. tree transducer, natural language processing, hierarchy, composition closure
THE POWER OF EXTENDED TOP-DOWN TREE TRANSDUCERS ANDREAS MALETTI, JONATHAN GRAEHL, MARK HOPKINS, AND KEVIN KNIGHT Abstract. Extended top-down tree transducers (transducteurs généralisés descendants [Arnold,
More informationCompositions of Tree Series Transformations
Compositions of Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2.
More informationComposition and Decomposition of Extended Multi Bottom-Up Tree Transducers?
Composition and Decomposition of Extended Multi Bottom-Up Tree Transducers? Joost Engelfriet 1, Eric Lilin 2, and Andreas Maletti 3;?? 1 Leiden Institute of Advanced Computer Science Leiden University,
More informationCompositions of Top-down Tree Transducers with ε-rules
Compositions of Top-down Tree Transducers with ε-rules Andreas Maletti 1, and Heiko Vogler 2 1 Universitat Rovira i Virgili, Departament de Filologies Romàniques Avinguda de Catalunya 35, 43002 Tarragona,
More informationStatistical Machine Translation of Natural Languages
1/37 Statistical Machine Translation of Natural Languages Rule Extraction and Training Probabilities Matthias Büchse, Toni Dietze, Johannes Osterholzer, Torsten Stüber, Heiko Vogler Technische Universität
More informationCompositions of Bottom-Up Tree Series Transformations
Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de May 17, 2005 1. Motivation
More informationLecture 9: Decoding. Andreas Maletti. Stuttgart January 20, Statistical Machine Translation. SMT VIII A. Maletti 1
Lecture 9: Decoding Andreas Maletti Statistical Machine Translation Stuttgart January 20, 2012 SMT VIII A. Maletti 1 Lecture 9 Last time Synchronous grammars (tree transducers) Rule extraction Weight training
More informationPure and O-Substitution
International Journal of Foundations of Computer Science c World Scientific Publishing Company Pure and O-Substitution Andreas Maletti Department of Computer Science, Technische Universität Dresden 01062
More informationProbabilistic Context-Free Grammars. Michael Collins, Columbia University
Probabilistic Context-Free Grammars Michael Collins, Columbia University Overview Probabilistic Context-Free Grammars (PCFGs) The CKY Algorithm for parsing with PCFGs A Probabilistic Context-Free Grammar
More informationWhy Synchronous Tree Substitution Grammars?
Why ynchronous Tr ustitution Grammars? Andras Maltti Univrsitat Rovira i Virgili Tarragona, pain andras.maltti@urv.cat Los Angls Jun 4, 2010 Why ynchronous Tr ustitution Grammars? A. Maltti 1 Motivation
More informationDecision Problems of Tree Transducers with Origin
Decision Problems of Tree Transducers with Origin Emmanuel Filiot 1, Sebastian Maneth 2, Pierre-Alain Reynier 3, and Jean-Marc Talbot 3 1 Université Libre de Bruxelles 2 University of Edinburgh 3 Aix-Marseille
More informationGENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE LANGUAGES
Atlantic Electronic http://aejm.ca Journal of Mathematics http://aejm.ca/rema Volume 6, Number 1, Summer 2014 pp. 26-37 GENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE ANGUAGES MARK THOM AND SHEY
More informationMidterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015
Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic
More informationLecture 12: Mapping Reductions
Lecture 12: Mapping Reductions October 18, 2016 CS 1010 Theory of Computation Topics Covered 1. The Language EQ T M 2. Mapping Reducibility 3. The Post Correspondence Problem 1 The Language EQ T M The
More informationTree transformations and dependencies
Tree transformations and deendencies Andreas Maletti Universität Stuttgart Institute for Natural Language Processing Azenbergstraße 12, 70174 Stuttgart, Germany andreasmaletti@imsuni-stuttgartde Abstract
More informationProbabilistic Context Free Grammars. Many slides from Michael Collins
Probabilistic Context Free Grammars Many slides from Michael Collins Overview I Probabilistic Context-Free Grammars (PCFGs) I The CKY Algorithm for parsing with PCFGs A Probabilistic Context-Free Grammar
More informationSyntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms Revisited
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms Revisited Andreas Maletti and C t lin Ionuµ Tîrn uc Universitat Rovira i Virgili Departament de Filologies Romàniques Av. Catalunya 35,
More informationCompositions of Bottom-Up Tree Series Transformations
Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de May 27, 2005 1. Motivation
More information> > > > < 0.05 θ = 1.96 = 1.64 = 1.66 = 0.96 = 0.82 Geographical distribution of English tweets (gender-induced data) Proportion of gendered tweets in English, May 2016 1 Contexts of the Present Research
More informationRandom Generation of Nondeterministic Tree Automata
Random Generation of Nondeterministic Tree Automata Thomas Hanneforth 1 and Andreas Maletti 2 and Daniel Quernheim 2 1 Department of Linguistics University of Potsdam, Germany 2 Institute for Natural Language
More informationMinimization of Weighted Automata
Minimization of Weighted Automata Andreas Maletti Universitat Rovira i Virgili Tarragona, Spain Wrocław May 19, 2010 Minimization of Weighted Automata Andreas Maletti 1 In Collaboration with ZOLTÁN ÉSIK,
More informationDe Nugis Groebnerialium 5: Noether, Macaulay, Jordan
De Nugis Groebnerialium 5: Noether, Macaulay, Jordan ACA 2018 Santiago de Compostela Re-reading Macaulay References Macaulay F. S., On the Resolution of a given Modular System into Primary Systems including
More informationDYNAMICAL CUBES AND A CRITERIA FOR SYSTEMS HAVING PRODUCT EXTENSIONS
DYNAMICAL CUBES AND A CRITERIA FOR SYSTEMS HAVING PRODUCT EXTENSIONS SEBASTIÁN DONOSO AND WENBO SUN Abstract. For minimal Z 2 -topological dynamical systems, we introduce a cube structure and a variation
More informationApplied Natural Language Processing
Applied Natural Language Processing Info 256 Lecture 20: Sequence labeling (April 9, 2019) David Bamman, UC Berkeley POS tagging NNP Labeling the tag that s correct for the context. IN JJ FW SYM IN JJ
More informationRule Extraction for Machine Translation
Rule Extraction for Machine Translation Andreas Maletti Institute of Computer cience Universität Leipzig, Germany on leave from: Institute for Natural Language Processing Universität tuttgart, Germany
More informationLearning Rational Functions
Learning Rational Functions Adrien Boiret, Aurélien Lemay, Joachim Niehren To cite this version: Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Rational Functions. 16th International Conference
More informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More informationA Uniformization Theorem for Nested Word to Word Transductions
A Uniformization Theorem for Nested Word to Word Transductions Dmitry Chistikov and Rupak Majumdar Max Planck Institute for Software Systems (MPI-SWS) Kaiserslautern and Saarbrücken, Germany {dch,rupak}@mpi-sws.org
More informationDecision Problems of Tree Transducers with Origin
Decision Problems of Tree Transducers with Origin Emmanuel Filiot a, Sebastian Maneth b, Pierre-Alain Reynier 1, Jean-Marc Talbot 1 a Université Libre de Bruxelles & FNRS b University of Edinburgh c Aix-Marseille
More informationFuzzy Tree Transducers
Advances in Fuzzy Mathematics. ISSN 0973-533X Volume 11, Number 2 (2016), pp. 99-112 Research India Publications http://www.ripublication.com Fuzzy Tree Transducers S. R. Chaudhari and M. N. Joshi Department
More informationArray Insertion and Deletion P Systems
Array Insertion and Deletion P Systems Henning Fernau 1 Rudolf Freund 2 Sergiu Ivanov 3 Marion Oswald 2 Markus L. Schmid 1 K.G. Subramanian 4 1 Universität Trier, D-54296 Trier, Germany Email: {fernau,mschmid}@uni-trier.de
More informationRegular transformations of data words through origin information
Regular transformations of data words through origin information Antoine Durand-Gasselin 1 and Peter Habermehl 2 1 Aix Marseille Université, CNRS & Centrale Marseille Antoine.Durand-Gasselin@centrale-marseille.fr
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationSyntax-Based Decoding
Syntax-Based Decoding Philipp Koehn 9 November 2017 1 syntax-based models Synchronous Context Free Grammar Rules 2 Nonterminal rules NP DET 1 2 JJ 3 DET 1 JJ 3 2 Terminal rules N maison house NP la maison
More informationProbabilistic Context-free Grammars
Probabilistic Context-free Grammars Computational Linguistics Alexander Koller 24 November 2017 The CKY Recognizer S NP VP NP Det N VP V NP V ate NP John Det a N sandwich i = 1 2 3 4 k = 2 3 4 5 S NP John
More informationTractable Lineages on Treelike Instances: Limits and Extensions
Tractable Lineages on Treelike Instances: Limits and Extensions Antoine Amarilli 1, Pierre Bourhis 2, Pierre enellart 1,3 June 29th, 2016 1 Télécom ParisTech 2 CNR CRItAL 3 National University of ingapore
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationA b r i l l i a n t young chemist, T h u r e Wagelius of N e w Y o r k, ac. himself with eth
6 6 0 x J 8 0 J 0 z (0 8 z x x J x 6 000 X j x "" "" " " x " " " x " " " J " " " " " " " " x : 0 z j ; J K 0 J K q 8 K K J x 0 j " " > J x J j z ; j J q J 0 0 8 K J 60 : K 6 x 8 K J :? 0 J J K 0 6% 8 0
More informationAlessandro Mazzei MASTER DI SCIENZE COGNITIVE GENOVA 2005
Alessandro Mazzei Dipartimento di Informatica Università di Torino MATER DI CIENZE COGNITIVE GENOVA 2005 04-11-05 Natural Language Grammars and Parsing Natural Language yntax Paolo ama Francesca yntactic
More informationExpressive power of pebble automata
Expressive power of pebble automata Miko laj Bojańczyk 1,2, Mathias Samuelides 2, Thomas Schwentick 3, Luc Segoufin 4 1 Warsaw University 2 LIAFA, Paris 7 3 Universität Dortmund 4 INRIA, Paris 11 Abstract.
More information0/16. Tree Transducers. Niko Paltzer. Seminar Formal Grammars WS 06/07 Advisor: Marco Kuhlmann. Programming Systems Lab.
0/16 Tree Transducers Niko Paltzer Seminar Formal Grammars WS 06/07 Advisor: Marco Kuhlmann Programming Systems Lab Outline 1/16 Trees & Tree Transducers Derivations & State-sequences Copying Normal Form
More informationCS 545 Lecture XVI: Parsing
CS 545 Lecture XVI: Parsing brownies_choco81@yahoo.com brownies_choco81@yahoo.com Benjamin Snyder Parsing Given a grammar G and a sentence x = (x1, x2,..., xn), find the best parse tree. We re not going
More informationMath 1 Variable Manipulation Part 5 Absolute Value & Inequalities
Math 1 Variable Manipulation Part 5 Absolute Value & Inequalities 1 ABSOLUTE VALUE REVIEW Absolute value is a measure of distance; how far a number is from zero: 6 is 6 away from zero, and " 6" is also
More informationCOM364 Automata Theory Lecture Note 2 - Nondeterminism
COM364 Automata Theory Lecture Note 2 - Nondeterminism Kurtuluş Küllü March 2018 The FA we saw until now were deterministic FA (DFA) in the sense that for each state and input symbol there was exactly
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationOn Affine Geometry of Space Curves
On Affine Geometry of Space Curves Ali Mahdipour Shirayeh Abstract In this expository paper, we explain equivalence problem of space curves under affine transformations to complete the method of Spivak
More informationThis lecture covers Chapter 5 of HMU: Context-free Grammars
This lecture covers Chapter 5 of HMU: Context-free rammars (Context-free) rammars (Leftmost and Rightmost) Derivations Parse Trees An quivalence between Derivations and Parse Trees Ambiguity in rammars
More informationWeighted Tree-Walking Automata
Acta Cybernetica 19 (2009) 275 293. Weighted Tree-Walking Automata Zoltán Fülöp and Loránd Muzamel Abstract We define weighted tree-walking automata. We show that the class of tree series recognizable
More informationJumping Finite Automata
Jumping Finite Automata Alexander Meduna and Petr Zemek Brno University of Technology, Faculty of Information Technology IT4Innovations Centre of Excellence Božetěchova 2, 612 00 Brno, Czech Republic http://www.fit.vutbr.cz/
More informationThe SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania
The SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania 1 PICTURE OF ANALYSIS PIPELINE Tokenize Maximum Entropy POS tagger MXPOST Ratnaparkhi Core Parser Collins
More informationStrictly Positive Definite Functions on a Real Inner Product Space
Strictly Positive Definite Functions on a Real Inner Product Space Allan Pinkus Abstract. If ft) = a kt k converges for all t IR with all coefficients a k 0, then the function f< x, y >) is positive definite
More informationAn algebraic characterization of unary two-way transducers
An algebraic characterization of unary two-way transducers (Extended Abstract) Christian Choffrut 1 and Bruno Guillon 1 LIAFA, CNRS and Université Paris 7 Denis Diderot, France. Abstract. Two-way transducers
More informationTopics in Timed Automata
1/32 Topics in Timed Automata B. Srivathsan RWTH-Aachen Software modeling and Verification group 2/32 Timed Automata A theory of timed automata R. Alur and D. Dill, TCS 94 2/32 Timed Automata Language
More informationHarvard CS 121 and CSCI E-207 Lecture 12: General Context-Free Recognition
Harvard CS 121 and CSCI E-207 Lecture 12: General Context-Free Recognition Salil Vadhan October 11, 2012 Reading: Sipser, Section 2.3 and Section 2.1 (material on Chomsky Normal Form). Pumping Lemma for
More informationCombinatorial Method in the Coset Enumeration. of Symmetrically Generated Groups II: Monomial Modular Representations
International Journal of Algebra, Vol. 1, 2007, no. 11, 505-518 Combinatorial Method in the Coset Enumeration of Symmetrically Generated Groups II: Monomial Modular Representations Mohamed Sayed Department
More informationFFTs in Graphics and Vision. Groups and Representations
FFTs in Graphics and Vision Groups and Representations Outline Groups Representations Schur s Lemma Correlation Groups A group is a set of elements G with a binary operation (often denoted ) such that
More information6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, Class 8 Nancy Lynch
6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 8 Nancy Lynch Today More undecidable problems: About Turing machines: Emptiness, etc. About
More informationAutomata for arithmetic Meyer sets
Author manuscript, published in "LATIN 4, Buenos-Aires : Argentine (24)" DOI : 1.17/978-3-54-24698-5_29 Automata for arithmetic Meyer sets Shigeki Akiyama 1, Frédérique Bassino 2, and Christiane Frougny
More informationBackward and Forward Bisimulation Minimisation of Tree Automata
Backward and Forward Bisimulation Minimisation of Tree Automata Johanna Högberg 1, Andreas Maletti 2, and Jonathan May 3 1 Dept. of Computing Science, Umeå University, S 90187 Umeå, Sweden johanna@cs.umu.se
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationUnique Normal Forms and Confluence of Rewrite Systems: Persistence
Unique Normal Forms and Confluence of Rewrite Systems: Persistence Rakesh M. Verma* Department of Computer Science University of Houston Houston, TX 77204, U. S. A. E-mail: rmverma@cs.uh.edu Abstract Programming
More information(pp ) PDAs and CFGs (Sec. 2.2)
(pp. 117-124) PDAs and CFGs (Sec. 2.2) A language is context free iff all strings in L can be generated by some context free grammar Theorem 2.20: L is Context Free iff a PDA accepts it I.e. if L is context
More informationCS 4424 Matrix multiplication
CS 4424 Matrix multiplication 1 Reminder: matrix multiplication Matrix-matrix product. Starting from a 1,1 a 1,n A =.. and B = a n,1 a n,n b 1,1 b 1,n.., b n,1 b n,n we get AB by multiplying A by all columns
More informationOn the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type mappings in Banach spaces
Computers and Mathematics with Applications 53 (2007) 1847 1853 www.elsevier.com/locate/camwa On the approximation problem of common fixed points for a finite family of non-self asymptotically quasi-nonexpansive-type
More informationTransducers for bidirectional decoding of prefix codes
Transducers for bidirectional decoding of prefix codes Laura Giambruno a,1, Sabrina Mantaci a,1 a Dipartimento di Matematica ed Applicazioni - Università di Palermo - Italy Abstract We construct a transducer
More informationFinite Elements. Colin Cotter. January 18, Colin Cotter FEM
Finite Elements January 18, 2019 The finite element Given a triangulation T of a domain Ω, finite element spaces are defined according to 1. the form the functions take (usually polynomial) when restricted
More informationControl of Electromechanical Systems
Control of Electromechanical Systems November 3, 27 Exercise Consider the feedback control scheme of the motor speed ω in Fig., where the torque actuation includes a time constant τ A =. s and a disturbance
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationPhylogenetic Networks with Recombination
Phylogenetic Networks with Recombination October 17 2012 Recombination All DNA is recombinant DNA... [The] natural process of recombination and mutation have acted throughout evolution... Genetic exchange
More informationHMM and Part of Speech Tagging. Adam Meyers New York University
HMM and Part of Speech Tagging Adam Meyers New York University Outline Parts of Speech Tagsets Rule-based POS Tagging HMM POS Tagging Transformation-based POS Tagging Part of Speech Tags Standards There
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationWhat You Must Remember When Processing Data Words
What You Must Remember When Processing Data Words Michael Benedikt, Clemens Ley, and Gabriele Puppis Oxford University Computing Laboratory, Park Rd, Oxford OX13QD UK Abstract. We provide a Myhill-Nerode-like
More informationTHEODORE VORONOV DIFFERENTIAL GEOMETRY. Spring 2009
[under construction] 8 Parallel transport 8.1 Equation of parallel transport Consider a vector bundle E B. We would like to compare vectors belonging to fibers over different points. Recall that this was
More informationMATH3283W LECTURE NOTES: WEEK 6 = 5 13, = 2 5, 1 13
MATH383W LECTURE NOTES: WEEK 6 //00 Recursive sequences (cont.) Examples: () a =, a n+ = 3 a n. The first few terms are,,, 5 = 5, 3 5 = 5 3, Since 5
More informationConfluence of Shallow Right-Linear Rewrite Systems
Confluence of Shallow Right-Linear Rewrite Systems Guillem Godoy 1 and Ashish Tiwari 2 1 Technical University of Catalonia Jordi Girona 1, Barcelona, Spain ggodoy@lsi.upc.es 2 SRI International, Menlo
More informationRadial Basis Functions I
Radial Basis Functions I Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 14, 2008 Today Reformulation of natural cubic spline interpolation Scattered
More informationStein s Method and Characteristic Functions
Stein s Method and Characteristic Functions Alexander Tikhomirov Komi Science Center of Ural Division of RAS, Syktyvkar, Russia; Singapore, NUS, 18-29 May 2015 Workshop New Directions in Stein s method
More informationProjective Quantum Spaces
DAMTP/94-81 Projective Quantum Spaces U. MEYER D.A.M.T.P., University of Cambridge um102@amtp.cam.ac.uk September 1994 arxiv:hep-th/9410039v1 6 Oct 1994 Abstract. Associated to the standard SU (n) R-matrices,
More informationThe Non-Deterministic Mostowski Hierarchy and Distance-Parity Automata
The Non-Deterministic Mostowski Hierarchy and Distance-Parity Automata Thomas Colcombet 1, and Christof Löding 2 1 LIAFA/CNRS, France 2 RWTH Aachen, Germany Abstract. Given a Rabin tree-language and natural
More informationFINITE STATE AUTOMATA
FINITE STATE AUTOMATA States An FSA has a finite set of states A system has a limited number of configurations Examples {On, Off}, {1,2,3,4,,k} {TV channels} States can be graphically represented as follows:
More information(pp ) PDAs and CFGs (Sec. 2.2)
(pp. 117-124) PDAs and CFGs (Sec. 2.2) A language is context free iff all strings in L can be generated by some context free grammar Theorem 2.20: L is Context Free iff a PDA accepts it I.e. if L is context
More informationNode Query Preservation for Deterministic Linear Top-Down Tree Transducers
Node Query Preservation for Deterministic Linear Top-Down Tree Transducers Kazuki Miyahara Nara Institute of Science and Technology Nara, Japan kazuki-mi@is.naist.jp Kenji Hashimoto Hiroyuki Seki Nagoya
More informationMiniversal deformations of pairs of skew-symmetric matrices under congruence. Andrii Dmytryshyn
Miniversal deformations of pairs of skew-symmetric matrices under congruence by Andrii Dmytryshyn UMINF-16/16 UMEÅ UNIVERSITY DEPARTMENT OF COMPUTING SCIENCE SE-901 87 UMEÅ SWEDEN Miniversal deformations
More informationHasse Diagrams for Classes of Deterministic Bottom-Up Tree-to-Tree-Series Transformations
Hasse Diagrams for Classes of Deterministic Bottom-Up Tree-to-Tree-Series Transformations Andreas Maletti 1 Technische Universität Dresden Fakultät Informatik D 01062 Dresden Germany Abstract The relationship
More informationCounter Automata and Classical Logics for Data Words
Counter Automata and Classical Logics for Data Words Amal Dev Manuel amal@imsc.res.in Institute of Mathematical Sciences, Taramani, Chennai, India. January 31, 2012 Data Words Definition (Data Words) A
More informationMyhill-Nerode Theorem for Recognizable Tree Series Revisited?
Myhill-Nerode Theorem for Recognizable Tree Series Revisited? Andreas Maletti?? International Comper Science Instite 1947 Center Street, Suite 600, Berkeley, CA 94704, USA Abstract. In this contribion
More information