On Sun, Aug 28, 2011 at 12:48 PM, Graham Neubig <[email protected]> wrote: > Hi, > > Has anyone used/implemented language models in Moses expressed as > finite state machines? Basically what I want to do is define an > arbitrary weighted machine (in say OpenFST format) and use it to score > my translation hypotheses. > > If nobody has done something like this I'll attempt to do it myself, > and any pointers on implementing new LM instances would be > appreciated! > > Graham
No, I'm pretty sure nothing like this is implemented in Moses. However, I know that Bill Byrne and colleagues at Cambridge University in England have done a lot of work on phrase-based decoding cast explicitly as finite-state processes. It's entirely possible they have something like what you're looking for. Cheers, Lane _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
