Simplification of Context-Free Grammars

... Form A context-free grammar G = (V, T, S, P) is in Chomsky normal form iff all productions are of the form: A → BC or A → a where A, B, C ∈ V and a ∈ T. 2 Simplification of Context-Free Grammars • Some ... combination. Exception: if all x i are nullable, then A → λ is not put into P^. Simplification of Context-Free Grammars Quan Thanh Tho qttho@cse.hcmut.edu.vn 20 Exa...

Ngày tải lên: 13/05/2014, 10:21

... Section II. Of Pronunciation Article I. Powers of Letters Article II. Of Quantity Article III. Of Accent Section III. Of Elocution Article I. Of Emphasis Article II. Of Pauses Article III. Of Inflections ... I. Of Letters; Capitals Corrections under each of the 16 Rules Promiscuous corrections of Capitals Chapter II. Of Syllables Corrections of False Syllabication...

Ngày tải lên: 01/09/2013, 11:31

... the efficiency of a parser with a possible trade-off of los- ing correct parses. For example, the noun phrase reading of The dog barks is a correct parse, although unlikely. By blocking the use of barks ... available, it was possible to evaluate the accuracy of the parser. Eval- uation of deep parsing results is often reported only in terms of coverage (number of sentences whic...

Ngày tải lên: 17/03/2014, 02:20

... definition of Min- imalist grammars, that are Stabler’s formalization of Chomsky’s minimal- ist program. Our logical definition leads to a neat relation to catego- rial grammar, (yielding a treatment of ... picture of these logical grammars is as follows. A lexicon maps words (or, more generally, items) onto a logical formula, called the (syntactic) type of the word. Types are de-...

Ngày tải lên: 17/03/2014, 07:20

... possible grammars having at most k of these rules. Since each k-simple component of 0 has at most k rules, the generated set of grammars will include all of the k-simple components of G. Step ... parameters (of accuracy and robustness) as well as the size (complexity) of the language being learned. In this paper, we apply the criterion of polynomial learnability to s...

Ngày tải lên: 17/03/2014, 20:20

Ngày tải lên: 22/03/2014, 17:20

... to evaluate the complexity of the algorithms as a function of the size of the grammar, we assume that I V I and I GI are of the same order of magnitude n. Step 1 of the algorithm corresponds ... kinds of grammars, the algorithm has been tested on eight randomly generated grammars of 4,000 rules having from 2 to 10 potential anchors (Table 1). The lexicon of the fir...

Ngày tải lên: 23/03/2014, 20:21

... subset of MSEA is essential. A collection of minimal sets of essential argu- ments (MSEA's) of a predicate depends upon the way this predicate is defined. If we alter the ordering of ... in the definition of a predicate, we may also change its set of MSEA's. We call the set of MSEA's existing for a current definition of a predi- cate the set of...

Ngày tải lên: 24/03/2014, 02:20

... gram- mar consists of ~ set of subgrammars. Each of the sub- grammars contains a set of M-rules and a regular ex- pression over the alphabet of rule names. The set of M-rules is subdivided into ... set of possi- ble S-trees and F~ is a collection of relations of type T m × T, m > 0. F~ contains all relations defined by the M-rules of subgrammar i. s The set of...

Ngày tải lên: 24/03/2014, 05:21

... system- atic exploration of grammars through compar- ison of competing analyses. The idea is illus- trated through a comparative study of auxil- iary structures in HPSG-based grammars for German and ... auto- matically create grammars with either of the two analyses. The remainder of this paper starts with the case study. Section 2 provides a description of the con- text of...

Ngày tải lên: 30/03/2014, 21:20