Back to Results
First PageMeta Content
Mathematical logic / Automata theory / Finite state transducer / Admissible rule / Symbol / Structure / String / Model theory / Normal distribution / Mathematics / Formal languages / Logic


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´ en´ eralis´ es descendant
Add to Reading List

Document Date: 2009-02-23 10:58:14

Open Document

File Size: 255,85 KB

Share Result on Facebook

City

Tarragona / Potsdam / /

Company

Expressiveness / Edinburgh University Press / /

Country

Germany / United States / Spain / /

/

Facility

University of Southern California / Information Sciences Institute / International Computer Science Institute / /

IndustryTerm

finite state devices / input-ε-free devices / natural language processing / /

Organization

Information Sciences Institute / German Academic Exchange Service / International Computer Science Institute / University of Southern California / Universitat Rovira i Virgili / /

Person

Fig / ANDREAS MALETTI / JONATHAN GRAEHL / Thatcher / MARK HOPKINS / KEVIN KNIGHT / /

Position

author / VP / translator / designer / Corresponding author / model / /

ProvinceOrState

Southern California / /

Region

Southern California / /

Technology

Natural Language Processing / Av / machine translation / /

SocialTag