| 释义 |
▪ I. matching, vbl. n.1|ˈmætʃɪŋ|
[f. match v.1 + -ing1.]
1. The action of the vb. match in various senses.
1562J. Heywood Prov. & Epigr. (1867) 180 Great patchyng, small matchyng. 1625Mandeville in Buccleuch MSS. (Hist. MSS. Comm.) I. 262 He propounded to me the matching with Warwick for my son. 1774Goldsm. Nat. Hist. (1776) III. 293 The greatest pains had been taken with these to enlarge the breed, both by food and matching. 1873E. Spon Workshop Receipts Ser. i. 414/2 Matching is to bring different pieces of timber, in an article of furniture, to a responsive tone of colour. 1874Spons' Dict. Engin. 3097 A planing machine for moulding and matching. 1889Athenæum 18 May 623/2 There is like risk of bad matching when the undertaking is a poem.
2. ‘A quality of wool in the best part of the fleece’ (Bowman Struct. Wool 1885, p. 356).
1881Daily News 22 Aug. 3/6 About 1,200 packs of English fleeces, matchings, skin, and other wools.
3. attrib., as matching shop (nonce-wd.); matching-machine, a machine which tongues and grooves the respective edges of a board; matching-plane = match-plane (Knight Dict. Mech. 1875).
1803tr. P. Le Brun's Mons. Botte I. 179 She couples ruined young men to rich widows..; and she runs away with all the business from the offices that you see at the corner of every street, called matching shops. 1874Spons' Dict. Engin. 3097 A planing and matching machine.
Sense 3 in Dict. becomes 4. Add: [1.] (Further examples in various senses.)
1967D. G. Hays Introd. Computational Linguistics viii. 156 Matching proceeds segment by segment. 1970O. Dopping Computers & Data Processing iv. 70 Matching means that the machine compares cards from the two input hoppers, pair by pair, with respect to the punching in a certain field.
3. Math. A subset of the set of edges of a (usu. bipartite) graph which contains no two adjacent edges; a subgraph of a graph which may be constructed by selecting a subset of the set of vertices and assigning a distinct adjacent vertex to each member of this subset.
1955O. Ore in Duke Math. Jrnl. XXII. 629 Let us now say generally that a subset A of V is (graph) matched to a subset A′ of V′ if there exists a one-to-one correspondence between A and A′ such that the corresponding elements are edge connected. We shall also call such a matching as a partial matching of V upon V′ . 1968C. L. Liu Introd. Combinatorial Math. xi. 281 A matching defines a one-to-one correspondence between the vertices in a subset of X and the vertices in a subset of Y . 1979Page & Wilson Introd. Computational Combinatorics vii. 164 Within this rather loose framework there are many types of assignment problems. Alternative names for such problems are matchings (used mainly in graph theory) or marriages.
▪ II. matching, vbl. n.2
see match v.2
▪ III. matching, ppl. a.|ˈmætʃɪŋ|
[f. match v.1 + -ing2.]
That matches; corresponding; ‘to match’.
1630R. Johnson's Kingd. & Commw. 97 If you will let loose the Queene of Cities, as they terme Paris, to looke bigge and angerly upon us, our London can affront her with a matching countenance. 1898Westm. Gaz. 11 June 1/3 The good plain ‘family’ cook, with matching morals. |