Abstract
The article reports the results from the developmentof four data-driven discovery systems, operating inlinguistics. The first mimics the induction methods ofJohn Stuart Mill, the second performs componentialanalysis of kinship vocabularies, the third is ageneral multi-class discrimination program, and thefourth finds logical patterns in data. These systemsare briefly described and some arguments are offeredin favour of machine linguistic discovery. Thearguments refer to the strength of machines incomputationally complex tasks, the guaranteedconsistency of machine results, the portability ofmachine methods to new tasks and domains, and thepotential machines provide for our gaining newinsights.