Sciweavers

1136 search results - page 3 / 228
» Learning with Weighted Transducers
Sort
View
DLT
2004
13 years 9 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti
ACL
1996
13 years 9 months ago
An Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
Mehryar Mohri, Richard Sproat
CSR
2006
Springer
13 years 11 months ago
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
Marie-Pierre Béal, Sylvain Lombardy, Jacque...