Báo cáo khoa học: "PARSING AND DERIVATIONAL EQUIVALENCE" pptx

... 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, ... 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...

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

... 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 ... 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...

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

... prncessability is dominant. Can these two functional demands be recrtnciled? There is in fact no a priori reason to believe that the demands of learnability and parsability are necessarily compatible. ... morphological and phtmological systems, and advances the notion of k.reversibility as the analog of bounded context parsability for such finite state sysiems. 1I IIOUNDED CON...

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

... 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 ... utterance segmentation and lack of punctu- ation. Roland and Jurafsky (1998) have suggested that there are substantial subcategorization differ- ences between written co...

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

... left, λx.λy.M is abbreviated to λxy.M, and α → β → γ stands for α → (β → γ). We refer the reader to Hindley, 1997 or Sørensen and Urzyczyn, 2006 for standard notions used in simply typed λ-calculus. 177 S(X 1 X 2 ):− ... → (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...

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

... of the unit (simplex/derived), and stem type (for many lemmata, different base stems, derivation stems and compounding stems are stored; e.g., träg in (2) is a derivational stem for the lemma ... 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....

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

... Rayner 87) Banks, A. and Rayner, M., Comparatives in Logic Grammars - Two Viewpoints, Proceedings of the 2rid International Workshop on Natural Language Understanding and Logic Programming, ... Dowty, R.E. Wall and S. Peters, introduction to Montague Semantics D. Reidel, 1982 (Keenan & Stavi 86) Keenan, E.L and Stavi J. Natural Language Determiners, Linguistics and Ph...

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

... Fragments and Text Categorization Jan Bla ˇ t ´ ak and Eva Mr ´ akov ´ a and Lubo ˇ s Popel ´ ınsk ´ y Knowledge Discovery Lab Faculty of ... which consists of fragments , . , such that and . The value of depends on the length of the document and on the number of sentences in the fragments. Let , and denotes the set of possible classes. ... other languages, and also for the frag...

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

... explaining the general structure of the situation schemata and how they, are rooted in the situation semantics of Barwise and Perry (Barwise and Perry 83). Situation semantics is grounded in a set ... consider here are all attached to a verb (not a noun phrase), and will be divided into two classes: oblique objects and adjuncts (Kaplan and Bresnan 82). An oblique object fil...

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

... between 1 and n the triple (s,s, ws) E T. • The tree is binary branching and consistent. Formally, for every (s,t, X) in T, s ¢ t, there is exactly one r, Y, and Z such that s < r < t and ... crosses some constituent in the correct parse. On the other hand, the Bracketed Recall and Bracketed Tree Rates are easier to handle, since computing the probability that a bracke...

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