Paper: Morphological Analysis

ACL ID C73-2019
Title Morphological Analysis
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1973
  • Martin Kay (Palo Alto Research Center, Palo Alto CA)

example: 1) 1Lewrite a as d when it precedes b 2) Rewrite b as c when it follows a If the initial string is ab, then the rewriting process must deliver three strings, namely ab, ac and db. The set does not include dc. Now look at the diagrammatic representation. Interpreting the rules in the most straightforward way, one might expect to get C d MORPHOLOGICAL ANALYSIS 211 But this does include a path representing the string de. If phrases like when it precedes.... and when it follows .... are excluded from the rules, so that we must say: la) Rewrite ab as ac 2a) Rewrite ab as db we not only stress the mutual incompatibility of the two rules, but also produce a situation in which the most natural interpretation of the rules gives the correct result. We now get It is possible for rules to ope...