Finite-State Transducer is a finite-state machine that extends the concept of a finite automaton by associating output symbols with transitions, thereby enabling it to map input strings to output strings through a relation defined over two alphabets.
465
Publications
22.2K
Citations
800
Authors
334
Institutions
Publications per year
2017–2026
47
Parents
Publications
465
1–5 of 465
Authors
800
- MM
17
h-index
- MR
15
h-index
- HN
13
h-index
- RS
12
h-index
- CA
12
h-index
1–5 of 800
Institutions
334
Google (United States)
Mountain View, United States
17 h-index
63 publications
3.2K citations
AT&T (United States)
Bedminster, United States
17 h-index
37 publications
4.3K citations
Johns Hopkins University
Baltimore, United States
13 h-index
19 publications
1.2K citations
Centre National de la Recherche Scientifique
Paris, France
13 h-index
21 publications
796 citations
Universitat Politècnica de València
Valencia, Spain
11 h-index
54 publications
4.6K citations
University of Cambridge
Cambridge, United Kingdom
11 h-index
24 publications
1.3K citations
Massachusetts Institute of Technology
Cambridge, United States
10 h-index
14 publications
445 citations
RWTH Aachen University
Aachen, Germany
10 h-index
40 publications
3.7K citations
1–8 of 334
Venues
- Theoretical Computer Science
14 publications · 653 citations
12
h-index
- Computational Linguistics
12 publications · 939 citations
12
h-index
- Natural Language Engineering
11 publications · 1.1K citations
11
h-index
- arXiv (Cornell University)
Repository · 9 publications · 306 citations
9
h-index
- IEEE Transactions on Audio Speech and Language Processing
9 publications · 381 citations
9
h-index
1–5