scholarly journals A Sound and Complete Left-Corner Parsing for Minimalist Grammars

2018 ◽  
Author(s):  
Miloš Stanojević ◽  
Edward Stabler
Keyword(s):  
Minimalist Grammars ◽  
Left Corner

Left-corner parsing of minimalist grammars

2019 ◽  
pp. 125-158
Author(s):  
Tim Hunter
Keyword(s):  
Derivation Tree ◽  
Top Down ◽  
Long Distance ◽  
Minimalist Grammars ◽  
Left Corner ◽  
Parsing Algorithm

Much recent research in experimental psycholinguistics revolves around the resolution of long-distance dependencies, and the manner in which the human sentence processor “retrieves’” elements from earlier in a sentence that must be related in some way to the material currently being processed. At present there is no obvious way for the issues raised by this research to be framed in terms of an MG parser. Stabler’s 2013 top-down MG parser does not involve any corresponding notion of “retrieval’”: it requires that a phrase’s position in the derivation tree be completely identified before the phrase can be scanned, which means that a filler cannot be scanned without committing to a particular location for its corresponding gap. This chapter attempts to develop a parsing algorithm that is inspired by Stabler, but which allows a sentence-initial filler to be scanned immediately while delaying the choice of corresponding gap position.

An Efficient Parallel Algorithm for Rectangular Packing Based on Bintree Expression

1996 ◽  
Author(s):  
Aihu Wang ◽  
Jianzhong Cha ◽  
Jinmin Wang
Keyword(s):  
Computational Complexity ◽  
Problem Solving ◽  
Parallel Algorithm ◽  
Shared Memory ◽  
Optimal Packing ◽  
Packing Process ◽  
Left Corner ◽  
Rectangular Packing ◽  
Packing Scheme ◽  
Sequential Decomposition

Abstract In this paper, a method using bintree structure to express the states of the packing space of rectangular packing is proposed. Through the sequential decomposition of the packing space, the optimal packing scheme of various sized rectangular packing can be obtained by every time putting the optimal piece that satisfies specular conditions toward the current packing space and by locating it at the up-left corner of the current packing space. Different optimal packing schemes that satisfy different demands can be obtained by adjusting the values of the ordering factors KA and KB. A parallel algorithm based on SIMD-CREW shared-memory computer is designed through the analysis of the parallelism of the bintree expression. The whole packing process is clearly expressed by the bintree. The computational complexity of the algorithm is shown to be O(n2logn). Both the experimental results and the comparison with other sequential packing algorithms have proved that the parallel packing algorithm is efficient. What is more, it nearly doubles the problem solving speed.

scholarly journals DEVELOPMENT OF NOVEL ALGORITHMS AND ARCHITECTURE FOR A ROBOT BASED AGRICULTURAL IMPLEMENT

2013 ◽  
Vol 10 (5) ◽  
pp. 1661-1674
Author(s):  
C. S. Mala ◽  
S. Ramachandran
Keyword(s):  
Reverse Direction ◽  
Entire System ◽  
Lateral Movement ◽  
Agricultural Field ◽  
Left Corner ◽  
Robotic Vehicle ◽  
Novel Algorithms ◽  
User Friendly

This paper presents novel algorithms and architecture for a Robot based agricultural implement. The application is for tilling the agricultural field. The hardware consists of a platform with four wheels and a mechanism to facilitate the forward, reverse and lateral movement of the wheels. The platform also houses a turn table, a lift and a plough. Various user defined inputs may be programmed such as length and breadth of the field, spacing between two till lines and depth of tilling. Thereafter, the entire tilling operation of the field is automated. The Robot based vehicle begins the operation from the top left corner and moves towards right tilling the field as it moves forward. Once the required length of field is reached, the vehicle halts and moves to the next row for a specified spacing between tilled rows. The movement from one row to another is in a lateral fashion by rotating the Robotic vehicle wheels by 90 degrees. No tilling is carried out till the next row is reached. The tilling operation is resumed by rotating the plough by 180 degrees and moving the vehicle in the reverse direction. This process continues till the end of the field, covering the entire breadth and maintaining the desired spacing and depth. This automated tilling requires the development of novel algorithms and an optimized architecture, which is presented in this paper. The system is user friendly and upgradable. The entire system has been realized using Verilog and is RTL compliant. The design is both platform and technology independent. The design has been simulated using ModelSim.

scholarly journals Geometric Representations for Minimalist Grammars

2012 ◽  
Vol 21 (4) ◽  
pp. 393-432 ◽  
Author(s):  
Peter beim Graben ◽  
Sabrina Gerth
Keyword(s):  
Minimalist Grammars ◽  
Geometric Representations

A Catholic Petition to the Earl of Essex

1963 ◽  
Vol 7 (1) ◽  
pp. 33-42 ◽  
Author(s):  
A. J. Loomie
Keyword(s):  
Front Cover ◽  
Left Corner ◽  
Earl Of Essex

In the Folger Library in Washington is a large folio manuscript which Dr. James McManaway has recently established as compiled “by some one deeply interested in the affairs of Essex, perhaps by one of his clerks.” The identification of the clerk has yet to be made; a note in the top left corner of the manuscript's front cover “Die Veneris Julii 1, 1601 per me Ricardum Greeneum” is a promising lead, but a Richard Green has not as yet been discovered among the extant records concerning the Earl of Essex. Dr. Mc Manaway writes of this manuscript's contents as follows :

Automatic Computer Reduction of Astronomical Television Images

1971 ◽  
Vol 11 ◽  
pp. 194-197
Author(s):  
W. A. Deutschman
Keyword(s):  
Spectral Range ◽  
Astronomical Observatory ◽  
Automatic Computer ◽  
Reduction System ◽  
Left Corner ◽  
Star Fields

During the 15 months that we operated the Celescope experiment on the Orbiting Astronomical Observatory, we acquired 8700 television frames of star fields containing a total of approximately 10 000 stars.Figure 1 shows an example of one of these frames. Note the target ring, an aluminum deposit on the target of the tube, in each corner of the picture; the shadow in the upper left corner; the calibration lamp just below the center of the picture; and its ghost slightly below and to the left. All other objects are stars. Each frame consists of 256 scan lines designated by the number k, with each line containing 251 pixels (picture elements) designated by the numberl, making a total of 65 000 intensity points I(k,l). The frames are divided into two spectral regions by two filters—lines 1 to 128 have one spectral range, lines 129 to 256 have a different one. Hence, each frame is reduced as two half frames in the first portion of the reduction system.

Sign in / Sign up

Export Citation Format

Share Document