parsing and derivational equivalence

... handle the problem of parsing and derivational equivalence, and we again note that if derivations are regarded as proofs, the method is an instantia- tion of proof-reduction. Reduction and ... distinct normal forms P and Q, then X PandY Q, butP~Q, soX~ Y. 2Suppose P and Q are distinct normal forms and that P Q. Because normal forms only reduce to themselves and P and Q are distinct, ... compiled into one not exhibiting derivational equivalence. Such com- pilation seeks to avoid the problem of parsing with a grammar exhibiting derivational equivalence by arranging that the...

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

Ngày tải lên: 11/12/2013, 23:48

Ngày tải lên: 11/12/2013, 23:51

Ngày tải lên: 27/12/2013, 20:26

... Type precision and recall and F-measure recall and F-measure. Type precision is the per- centage of SCF types that our system proposes which are correct according some gold standard and type recall ... standard. We used the 14 verbs 4 selected by Briscoe and Carroll (1997) and evaluated our results of these verbs against the SCF entries in two gold standards: COMLEX (Grishman et al., 1994) and ... (Bikel, 2004) in parsing written and spoken language and in generating sub- categorization cues from written and spo- ken language. Although Bikel’s parser achieves a higher accuracy for parsing written...

Ngày tải lên: 08/03/2014, 02:21

... the n-best parses using coarse-to-fine parsing The major difficulty in n-best parsing, compared to 1-best parsing, is dynamic programming. For exam- ple, n-best parsing is straight-forward in best-first search ... 2001. Probabilistic top-down parsing and language modeling. Computational Linguistics, 27(2):249–276. R. Schwartz and Y.L. Chow. 1990. The n-best algo- rithm: An efficient and exact procedure for finding the ... of a standard context-free grammar. He parses a sentence using the approximate grammar, and the results are used to constrain the search for a parse with the full CFG. He finds that total parsing...

Ngày tải lên: 08/03/2014, 04:22

... S=:'aA,~=:'a#~ and (2) S=%,Bx=~-~,~x = a'B,b are rightmost derivations in the grammar; (3) the length ofx is less than or equal to the length of,/, and (4) the last m symbols of a and a' ... and (4) the last m symbols of a and a' coincide, and the first n symbols of,., and ~, coincide imply that A=B, a'=v, and ,/' = x. We will u~ the term "bounded context" ... rightmost and use instead non-canonical derivation sequences as defined by Szymanski and Williams (1976). This model corresponds to Marcus's (1980) use of attention shi.Bs to postpone parsing...

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

... between shift and reduce operations and between different reduce operations. Shieber and Pereira demonstrate that if shift/reduce clashes are resolved in favour of shifting and reduce/reduce ... analysis and storage of partially analysed material in thc left and fight context. Parsing proceeds on the basis of a three cell window into the stack. The item in the first cell (at the fight hand ... Ceil2 and Cell3 using rules of backward and forward application and a more constrained rule of forward composition. If this fails, then Lexicat shifts. This completes one step of the parsing...

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

... bilingual cor- pora, and use some thresholds to filter out noise and some hand-written rules to handle heterogene- ity. Smith and Eisner (2009) perform depen- dency projection and annotation adaptation ... noise, and some hand-designed rules to handle language heterogeneity. Smith and Eisner (2009) perform dependency projection and annotation adaptation with quasi-synchronous grammar features. Jiang and ... dependency parsing (Klein and Manning, 2004) which is totally based on unannotated data, and the semisupervised de- pendency parsing (Koo et al., 2008) which is based on both annotated and unannotated...

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

... nouns and Vietnamese equivalence: 2.4.1 Equivalence cases in English compound nouns and Vietnamese equivalence. 2.4.2 Non -equivalence cases in English compound nouns and Vietnamese equivalence. ... 2.4 Analysis on English compound nouns and Vietnamese equivalence. 2.4.1 Equivalence case in English compound nouns and Vietnamese compound nouns Equivalence is considered as the key factor ... ngang Handlebar  tay lái 2.4.2 Non-equivalences in English compound nouns and Vietnamese compound nouns: To be the two different languages, so non -equivalence between English and Vietnamese...

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

... general framework of constituent parsing to utilize more lexical and structural context and incorporate more strength of various parsing techniques. However, higher-order constituent parsing inevitably leads ... of each parsing model are estimated from a training set using an averaged perceptron algorithm, following Collins (2002) and Huang (2008). The performance of our first- and higher-order parsing ... Computational Linguistics Higher-Order Constituent Parsing and Parser Combination ∗ Xiao Chen and Chunyu Kit Department of Chinese, Translation and Linguistics City University of Hong Kong Tat...

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

... include speech recog- nition and synthesis. Thus, the processing time of speech recognition and transfer text-to-speech synthesis is zero, and the speaker’s utterance time and the interpreter’s utterance ... incremental parsing, transfer and generation. In the parsing module the parser deter- mines the English dependency structure for input words incrementally. In the transfermodule, struc- ture and lexicon ... we have not implemented the method Z. And we virtually compute the delay time and the utterance time. Table 1 shows the estimation re- sults of methods X, Y and Z. Note, however, that we virtually...

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

... (Bikel, 2004) in parsing written and spoken language and in generating sub- categorization cues from written and spo- ken language. Although Bikel’s parser achieves a higher accuracy for parsing written ... verb disambigua- tion and classification (Schulte im Walde, 2000; Merlo and Stevenson, 2001; Lapata and Brew, 2004; Merlo et al., 2005) and SCCs for semantic role labeling (Xue and Palmer, 2004; Punyakanok et ... Charniak, and M. Johnson. 2002. Parsing and disfluency placement. In Proceedings of 2002 Conference on Empirical Methods of Natural Lan- guage Processing, pages 49–54. J. Godefrey, E. Holliman, and...

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

... → (e→t)→(e→t)→t, N → e→t}). A rule that has A on the left-hand side and B 1 , ,B n as right-hand side nonterminals has its left-hand side annotated with a well-formed λ-term M that has type ... of Science and Technology. Beeri, Catriel and Raghu Ramakrishnan. 1991. On the power of magic. Journal of Logic Programming 10, 255–299. Engelfriet, J. and E. M. Schmidt. 1977. IO and OI, part I. ... Fujii, and Tadao Kasami. 1991. On multiple context-free gram- mars. Theoretical Computer Science 88, 191–229. Shieber, Stuart M., Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementations...

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

... discussion and input: Arne Fitschen, Anke Lüdeling, Bettina Säuberlich and the other people working in the DeKo project and the IMS lexicon group. I’d also like to thank Christian Rohrer and Helmut ... the ini- tial state and from the end state of the respective sub-automata: (9). (Of course, the resulting non- deterministic FSA is then determinized and mini- mized by standard techniques.) grained ... the corpus a random sample of 100 word forms con- taining prefixes. From these 100 forms, we gen- erated about 3700 grammatical and ungrammatical test examples by omission, addition and permutation of...

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

... definition: If the productions at and are different . If the productions at and are the same, and and are pre-terminals, then . 5 Else if the productions at and are the same and and are not pre-terminals, where ... state labels at and are different . If the state labels at and are the same, but the words at and are different, then . Else if the state labels at and are the same, and the words at and are the ... Random Field methods of (Johnson et al. 1999), and the boosting approaches for parsing in (Collins 2000). The set-up is as fol- lows: Training data is a set of example input/output pairs. In parsing...

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

... human parsing processes can we cover all and only the language phenomena that we are called upon to process. A particular (extraordinary) aspect of hu~an cognitive (and hence, parsing) ... the other hand, on the b,m- parsing side, we definitely feel that natural language is strongly tuned to both people's means of production and their means of recognition, and that principles ... understandable and reasonable, to constrain what the system should be doing. The Interaetlons Finally, we have been asked about the nature of the relationship between a gr~mar and a...

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

... grammar in terms of its behavior both in parsing and in generation. References Baschung, K, G.G. Bes, A. Corluy, and T. Guillotin (1987) "Auxiliaries and Critics in French UCG Grammar". ... classes of parsable analyses. 1. Introduction Parsing and generation me both concerned with the relation between texts and representations, and in so far as a grammar defines this relation ... UD (Unification Device) which includes the parser and facilities such as procedural abswactions and extended data types (lists and trees) and Estival et al. (1989) for a description of the...

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

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

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