minpair 5.2

A complete list of minimal pairs (different words in exactly one segment) from a list of words minpair generates a complete list of minimal pairs (different words in exactly one segment) from a list of words. The entry should consist of one entry per line in UTF-8 Unicode. By default, each entry consists of two parts, separated by a tab. The first field is the word. The second field is an identifier. Typically, this will be a gloss or output folder number.The lists two contrasting segments in the minimal pair, then the two words, each followed by its identifier, if provided, then the context of difference, with a indicator of the place difference (By default, an underscore) mark the site of difference. The different segments are listed in a fixed order (the character codes) for all chips from the same pair will be the default sort minpair together.By searches for the word pairs of the same length differ in exactly one segment . Line options allow the addition of simple insertions / deletions and single transpositions.In order to find all minimal pairs, it is normally necessary for the rating of entry to use a character for each segment. Even in the transcript of the API, it is often not the case. minpair provides this by accepting the definitions of multigraphs. For example, if you put the sequence p ', t' and K ', which represents glottalized / p /, / t / and / k /, in the definition file multigraph, minpair will treat them as single segments. The multigraph definition file should be composed of sequences of characters that must be treated as single segments, one per line. Like all other inputs, this file must be encoded in UTF-8 Unicode. Sequences reported as multigraphs are compressed to a single UTF-32 codepoint to compare them as single segments, and then decompressed on the basic program has an interface output.The online ordering. mpg provides a GUI option. mpg will also arrange for the release of minpair sort if a proper sorting utility is available. Standard sort utility such as Unix allows sorting to do, but if the data contain multigraphs, the best results are obtained using msort because he can read and use the same definitions multigraph than minpair.It is also possible to use without minpair mpg. mpg can find minimal pairs involving substitutions but currently can not handle indels and transpositions. mpg is slower than minpair but fast enough to be used with lists of several thousand words. mpg is also able to find pairs of words that differ in two positions, which minpair do not know how. This is useful when searching for phonological rules. The maximum distance between the two positions may be specified.