## Finite State Transducers with Predicates and Identities (2001)

### Cached

### Download Links

- [www.let.rug.nl]
- [odur.let.rug.nl]
- [www.let.rug.nl]
- DBLP

### Other Repositories/Bibliography

Venue: | Grammars |

Citations: | 20 - 0 self |

### BibTeX

@ARTICLE{Noord01finitestate,

author = {Gertjan Van Noord and Dale Gerdemann},

title = {Finite State Transducers with Predicates and Identities},

journal = {Grammars},

year = {2001},

volume = {4},

pages = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicates generally have fewer states and fewer transitions. Although the extension is fairly trivial for finite state acceptors, the introduction of predicates is more interesting for transducers. It is shown how various operations on transducers (e.g. composition) can be implemented, as well as how the transducer determinization algorithm can be generalized for predicate-augmented finite state transducers.