The induction program we have crafted relies primarily on the linguistic notion of productivity to find affixes in unmarked text and without the aid of prior grammatical knowledge. In doing so, the algorithm unfolds in two stages. It first finds seed affixes, to include infixes and circumfixes, by assaying the character of all possible internal partitions of all words in a small corpus no large...

Morphology induction is a subproblem of important tasks like automatic learning of machine-readable dictionaries and grammar induction. Previous morphology induction approaches have relied solely on statistics of hypothesized stems and affixes to choose which affixes to consider legitimate. Relying on stemand-affix statistics rather than semantic knowledge leads to a number of problems, such as...

In this paper we discuss the problenl of ascribing beliefs to an agent, given partial knowledge of his beliefs. The particular kind of ascription we are interested in we call explanatory ascription, since it ascribes beliefs to an agent as a means of explaining the beliefs we already know he has. We explore two approaches to explanatory ascription. In the first, we develop a model of belief cal...

In a morphological lexicon, each entry combines a lemma with a specific inflection class, often defined by a set of inflection rules. Therefore, such lexica usually give a satisfying account of inflectional operations. Derivational information, however, is usually badly covered. In this paper we introduce a novel approach for enriching morphological lexica with derivational links between entrie...

This paper describes a systematic investigation of the extent to which the part of speech of words can be identified from their prefixes and suffixes. The results indicate that it is possible to determine, with 95 per cent accuracy, the inclusive part of speech of an affixed word from a consideration of its prefixes, suffixes, and length. By "inclusive" parts of speech we mean a string that wil...

In a recent paper by H. L. Resnikoff and J. L. Dolby, "The Nature of Affixing in Written English," an algorithm for the structural definition of affixes was developed and applied to data consisting of all the words of the form CVCVC in the Shorter Oxford Dictionary. Fourteen strong prefixes and twelve strong suffixes and seven weak prefixes and forty weak suffixes were defined, but it was noted...

The paper presents construction of Derywator – a language tool for the recognition of Polish derivational relations. It was built on the basis of machine learning in a way following the bootstrapping approach: a limited set of derivational pairs described manually by linguists in plWordNet is used to train Derivator. The tool is intended to be applied in semi-automated expansion of plWordNet wi...