Minpair
This entry published by the Free Software Foundation.
minpair
http://www.cis.upenn.edu/~wjposer/minpair.html
'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.
Licensing
| License | Verified by | Verified on | Notes |
|---|---|---|---|
| GPLv3 | Deborah Nicholson | 2454629.512 June 2008 |
Leaders and contributors
| Contact(s) | Role |
|---|---|
 Bill Poser | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Bug Tracking,Developer,Support | mailto:billposer@alum.mit.edu |
Software prerequisites
Click here if you'd like to report a problem or make a suggestion that could
This entry (in part or in whole) was last reviewed on 1 August 2005.
Problem with this listing?
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 described in this text has its own copyright notice and license, which can usually be found in the distribution itself.
This page was last modified on 12 April 2011, at 13:53.