Publications (1)

more >>

  • 1
    A State-Transition Grammar for Data-Oriented Parsing
    terms, a finite-state grammar corresponds to a first-order Markov process, where given a sequence of states Si, Sj,... drawn...product of the state transitions (as we have a first order Markov process). However this simple-minded approach, although...