Generates a list of minimal pairs
'minpair' generates a list of minimal pairs (words differing in exactly one segment) from a list of words. The input should consist of one word per line in UTF-8 Unicode. The output lists the two segments contrasting in the minimal pair, then the two words, and then the context for the difference. The segments differing are listed in a order of the character codes so that all tokens of the same pair will sort together. By default minpair searches only for pairs of words of the same length differing in exactly one segment. Users can optionally add single insertions, deletions and transpositions.
released on 10 December 2007
12 June 2008
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 1 August 2005.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.