Example sentences of "[art] [noun] " in BNC.
Previous page Next page| No | Sentence |
|---|---|
| 31 | Fold the interlining back and lockstitch it to the wrong side of the curtains in the same way as for the lining in Lined Curtains , but stitch two vertical rows for each width of fabric at equal distances apart and along all seams . |
| 32 | Smooth the interlining back and tack the outer edges of bump to the sides of the curtain all around . |
| 33 | Finish off the sides by turning them in to the wrong side on the creaselines , with the interlining . |
| 34 | Lay the curtain out flat with the interlining uppermost and apply the hemmed lining to it in the same way as for Lined Curtains , but lockstitching along the same lines as the interlining and along all seams . |
| 35 | Lay the curtain out flat with the interlining uppermost and apply the hemmed lining to it in the same way as for Lined Curtains , but lockstitching along the same lines as the interlining and along all seams . |
| 36 | Then apply the interlining to the buckram by pressing the bump turning allowance to the back , as with the pelmet fabric described above . |
| 37 | Then serge ( page 34 ) the turning allowance of the outer fabric to the turning of the interlining on the back of the pelmet and through the buckram , making sure no stitches show on the right side . |
| 38 | Other treatments adopt an over-simple solution to the problem , always preferring one source to another ; thus the algorithm of Hobbs ( 1976 ) looks at all intrasentential candidates before earlier sentences are considered at all , while Brennan , Friedman & Pollard ( 1987 ) prefer all candidates from the most recent sentence to ones from the current sentence . |
| 39 | In the language of computer software say , this would mean careful attention to the derivation of the algorithm before a line of code is written . |
| 40 | To address this difficulty the algorithm was changed to a depth-first one . |
| 41 | The algorithm is modified , since only some set of the higher probability letters are selected as candidates to be chosen between , instead of choosing between all possible candidates . |
| 42 | If all such letters are found , the algorithm checks whether the resulting string is a word ( i.e. the end-of-word flag is set at the tree-node reached by the search ) . |
| 43 | Whilst the algorithm detailed in Appendix D ( flowchart D3 ) was under development , it became clear that this representation was not the best for this particular structure . |
| 44 | The algorithm is used both for originally arranging the array , and to check whether a particular value is present . |
| 45 | However , as Livingstone and Hubel ( 1984 ) point out , they can not be computing colour according to the algorithm derived by Land . |
| 46 | As this encoded beam passes through a second optoelectronic array , the various stages of the algorithm are executed . |
| 47 | Classification by computer , howsoever sophisticated the algorithm , is not appropriate . |
| 48 | As this encoded beam passes through a second optoelectronic array , the various stages of the algorithm are executed . |
| 49 | Variable 1 — The complexity of the algorithm : |
| 50 | For this reason , the algorithm needs to scan backward as well as forward , and therefore takes twice as long as the simple algorithm . |
| 51 | Record the number of ’ strong ’ and ’ weak ’ overlaps associated with each word — worth 50 points and 1 point respectively ( NB — strictly speaking , it is inappropriate to talk of ’ strong overlaps ’ or ’ weak overlaps ’ in this context , but the terminology is used to indicate the consistency of the algorithm ) ; |
| 52 | How would the algorithm need to be altered if numbers were stored in fractional form ( as in problem 2.2 ) ? |
| 53 | Extend the algorithm to deal with a general dividend and divisor , and include a test for overflow ( i.e. when the quotient can not be represented in n bits ) . |
| 54 | It keeps a list , called OPEN , of nodes which the algorithm has found and which are not goals but whose children might be goals . |
| 55 | The algorithm examines every shallow state , which can be constructed by a short path from start , before it examines deeper states . |
| 56 | The algorithm has a new variable , S , whose value is such a pair . |
| 57 | Thus , the algorithm searches a space in which each node is a pair : ( N , LOp ) |
| 58 | In one cycle , the algorithm takes one operator out of the list LOp and applies it to N , so producing just one child . |
| 59 | The algorithm keeps a second list , called CLOSED , of nodes which have been expanded and removed from OPEN . |
| 60 | However , the chances are that , if you can really represent the search space optimally before calling the algorithm , then there is no need for search at all . |