Survey Weighted extended top-down tree transducers part I. : basics and expressive power /

Weighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP'76. Edinburgh University Press, 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine transl...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Maletti Andreas
Testületi szerző: Weighted Automata : Theory and Applications (2010) (Leipzig)
Dokumentumtípus: Cikk
Megjelent: 2011
Sorozat:Acta cybernetica 20 No. 2
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
doi:10.14232/actacyb.20.2.2011.2

Online Access:http://acta.bibl.u-szeged.hu/12909
LEADER 01717nab a2200241 i 4500
001 acta12909
005 20220617140013.0
008 161015s2011 hu o 0|| eng d
022 |a 0324-721X 
024 7 |a 10.14232/actacyb.20.2.2011.2  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Maletti Andreas 
245 1 0 |a Survey   |h [elektronikus dokumentum] :  |b Weighted extended top-down tree transducers part I. : basics and expressive power /  |c  Maletti Andreas 
260 |c 2011 
300 |a 223-250 
490 0 |a Acta cybernetica  |v 20 No. 2 
520 3 |a Weighted extended top-down tree transducers (transducteurs généralisés descendants [Arnold, Dauchet: Bi-transductions de forêts. ICALP'76. Edinburgh University Press, 1976]) received renewed interest in the field of Natural Language Processing, where they are used in syntax-based machine translation. This survey presents the foundations for a theoretical analysis of weighted extended top-down tree transducers. In particular, it discusses essentially complete semirings, which are a novel concept that can be used to lift incomparability results from the unweighted case to the weighted case even in the presence of infinite sums. In addition, several equivalent ways to define weighted extended top-down tree transducers are presented and the individual benefits of each presentation is shown on a small result. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
710 |a Weighted Automata : Theory and Applications (2010) (Leipzig) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12909/1/actacyb_20_2_2011_2.pdf  |z Dokumentum-elérés