CSE 675, Spring 2000

HW #4: MORPHOLOGY AND FINITE-STATE TRANSDUCERS

NEW (revised) NEW

  1. J&M, Ch. 3, p. 89: #3.6: Implement the Soundex algorithm by drawing an approprate TN.

  2. Here is the stemming algorithm for `-ly' words from Smith, George W. (1991), Computers and Human Language (New York: Oxford University Press): 26, Fig. 4:

  3. Play with Englex to find its capabilities and limitations. Discuss your findings. Hand in sample runs to justify your conclusions.

DUE: MONDAY, FEBRUARY 14



Copyright © 2000 by William J. Rapaport (rapaport@cse.buffalo.edu)
file: 675w/hw4.14fb00.html