Search Results for author:
Found 2 papers, 0 papers with code
Inferring morphological rules from small examples using 0/1 linear programming
We show how to express the problem of finding an optimal morpheme segmentation from a set of labelled words as a 0/1 linear programming problem, and how to build on this to analyse a language’s morphology.
Conjectures, Tests and Proofs: An Overview of Theory Exploration
In this paper, we give a brief overview of a theory exploration system called QuickSpec, which is able to automatically discover interesting conjectures about a given set of functions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
