All Downloads are FREE. Search and download functionalities are using the official Maven repository.

edu.stanford.nlp.fsm.package-info Maven / Gradle / Ivy

/**
 * 

Contains two implementations of finite state machines. One is DFSA, which is older and used in some of * the old parse code. The second is TransducerGraph, which represents a transducer (a generalization of a FSM) and is * used in the newer grammar compaction code currently used in the parser.

*

For questions contact Dan Klein ([email protected]) or Teg Grenager ([email protected]).

*/ package edu.stanford.nlp.fsm;




© 2015 - 2024 Weber Informatics LLC | Privacy Policy