a polynomialtime parsing algorithm

... with all natural language phenomena. This has been argued for tree-local and even set-local MCTAG on the basis of scrambling data from lan- guages such as German (Becker et al., 1992; Ram- bow, ... (TT-MCTAG) and Range Concatenation Grammars (RCG). In Carlos Mart´ın-Vide, Friedrich Otto, and Henning Fernaus, editors, Language and Automata Theory and Ap- plications. Second International Conference, ... On matrix languages. Information and Control, 23:86–96. Aravind K. Joshi and Yves Schabes. 1997. Tree- Adjoning Grammars. In G. Rozenberg and A. Salo- maa, editors, Handbook of Formal Languages,...

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

... are energyminimizationalgorithms(Schusteretal., 1997).Whilenotasaccurateascomparative sequence analysis, these algorithms have still pro- ven to be useful research tools. Thermodynamic parameters are available ... characterized bytheTurnergroup(Freieretal.,1986).Dangling bases can also appear inside multiloop diagrams. Notice also that the coaxial diagram in equation (11) really corresponds with four new diagrams because once we allow pairing, dangling bases also ... calculate the gap matrices. For a given gap matrix, we have to con- sider all the different ways that its diagram can be assembled using one or two matrices at a time. (Again, Feynman diagrams...

Ngày tải lên: 12/01/2014, 22:07

... most parsing algorithms attempt to maximize, namely the Labelled Tree Rate. That is, most parsing algorithms assume that the test corpus was generated by the model, and then attempt to evaluate ... the Bracketed Recall Rate. Matching parsing algorithms to evaluation crite- ria is a powerful technique that can be used to im- prove performance. In particular, the Labelled Re- call Algorithm ... inal ATIS data and the cleaned-up version is avail- able from ftp://ftp.das.harvard.edu/pub/goodman/atis- ed/ ti_tb.par-ed and ti_tb.pos-ed. The number of changes made was small, less than...

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

... COL- ING. J. Hajiˇc, E. Hajicova, P. Pajas, J. Panevova, P. Sgall, and B. Vidova Hladka. 2001. The Prague Dependency Treebank 1.0 CDROM. Linguistics Data Consor- tium Cat. No . LDC2001T10. K. Hall and ... sequence analysis (Daum´e and Marcu, 2005; McDonald et al., 200 5a) and phrase-structure parsing (Collins and Roark, 2004). This robustness to approximations comes from the fact that the online framework ... subgraphs. We also present an algorithm for acyclic dependency graphs, that is, dependency graphs in which a word may depend on multiple heads. In both cases parsing is in general intractable and...

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

... categories or a search for them, and a reduce action which pe,forms instanliation tit)ring parsing. Some details of the LR parsing algorithm are assumed from Aho and Ullman (1987) and Aho ... 1986. An Introduction to Unification-Based Approaches to Grammar. CSLI Lecture Notes 4. Stanford: CSLI. Tomita, Masaru 1986. Efficient Parsing for Natural Language: A Fast Algorithm for Practical ... attempt to incorporate feature-based categories into Tomita's extended LR parsing algorithm (Tomita 1986). A straightforwmd adaptation of feature- based categories into the algorithm introduces...

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

... C. These are all constraints in C. The range constraint vector of a clause c cap- tures all information about boundaries forming a range, ranges containing only a single terminal, and adjacent variables/terminal ... Programming, 24(1& 2):3–36. Anders Søgaard. 2008. Range concatenation gram- mars for translation. In Proceedings of COLING, Manchester, England. K. Vijay-Shanker, David Weir, and Aravind Joshi. 1987. Characterising ... that gives the maximal index in a clause, and we define Υ(c, x) for a given clause c and x a variable or an occur- rence of a terminal as the index of x in c. Definition 3. An instantiation of a...

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

... different approaches to sentence ranking: A simple paragraph-based approach intended as a baseline, two word-based approaches, and two coherence-based approaches. In the paragraph-based approach, ... sentence ranking 2.1 Paragraph-based approach Sentences at the beginning of a paragraph are usually more important than sentences that are further down in a paragraph, due in part to the way people ... number importance ranking NoParagraph WithParagraph Figure 6. Human ranking results for one text (wsj_1306). that there was a coherence tree annotation available in Carlson et al. (2002)’s database....

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

... (CP) parsing, which are al- gorithms capable of simultaneous processing of all com- mon prefixes. ELR and CP parsing are the foundation of tabular parsing algorithms and a parallel parsing al- ... can be added. 1. Add [A& apos; a] to Ti-l# for a = ai where A& apos; = {A I 3j3 [A */9] • Tj,i-1 3A , ha, B * /9C0' • pt[B • A A A Z* C]} is non-empty 2. Add [A& apos; * aa] for a = ai and ... to a problem of tabular parsing which can be described as follows. For each parsing algorithm working on a stack there is a realisation using a parse table, where the parse table allows sharing...

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

... Theory, Head-driven Phrase Structure Grammar and Categorial Grammar. In parsing with such formalisms, especially those formalisms that are unification-based, we find that traditional parsing- techniques, ... 86. Haas, A. 1989. A Parsing Algorithm for Unification Grammar. Computational Linguistics 15-4, 219-232. Karttunen, L. 1989. Radical Lexicalism. In M. Baltin & A. Kroch (eds.), Alternative ... (Pollard &: Sag, 1987), an- other lexicalist and unification-based framework. CHART PARSING OF UNIFICATION GRAMMAR (UG). Parsing methods for context-free grammar can be extended to unification-based...

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

... Language Technology, Dublin City University, Ireland. As with PP attachment, most previous attempts at tackling coordination as a subproblem of parsing have treated it as a separate task to parsing ... outlined above can be detected automatically by simple pat- tern matching. Automatically eliminating such ex- amples is a simple method of cleaning the data. 7 Experimental Evaluation We use a parsing ... non-terminal labels and head word part-of- speech tags for levels 0, 1 and 2. Learning a bias toward parallelism in conjuncts should improve the parsing model’s ability to correctly attach a coordi- nation...

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

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

... "stack search" similar to A* methods. One of the primary obstacles to making the statis- tical translation approach practical is slow speed of translation, as performed in A* fashion. ... search for statistical machine transla- tion. In PACLIC-IO, Pacific Asia Conference on Language, Information and Computation, pages 195-204, Hong Kong, December. Wu, Dekai and Xuanyin Xia. ... I can confirm now that the necessary funds will be made available to meet the key targets. Figure 4: Example translation outputs. translation accuracy was performed on a random sample drawn...

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

... 1983. [61 Kay, M. An algorithm for compiling parsing tables from a grammar. 1980. Xerox Pale Alto Research Center. Pale Alto, California. [7] Matsumoto, Y., H. Tanaka, H. Hira'kawa. II. Miyoshi. ... context-free- based PATR-II, we make one more purely notational change. Rather than associating with each grammar rule a set of unifications, we instead associate a dag that incorporates all of those ... generalizt,I I,hr:~,' ~l rlt,'l ur,. grammar (GPSG) [.1], even categorial systems such ,as M,,n- tague grammar [81 and Ades/Steedman grammar Ill ,~s can several of the grammar formalisms...

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

... harbusch~dfki.uni-sb.de ABSTRACT In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for nat- ural language description analysis as well as generation. In this paper we concentrate ... appropriate ex- tensions of the TAG formalism for analysis as well as generation of natural language with the ambi- tious aim to verify that TAGs (in some extension) are appropriate for a bidirectional ... section, the approach of Vijay- Shanker and Joshi is presented as the natural way of extending the CKY algorithm for context-free grammars to TAGs. As a precondition for that analysis, it has to...

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

... Linear Text Segmentation using a Dynamic Programming Algorithm Athanasios Kehagias Dept. of Math., Phys. and Comp. Sciences Aristotle Univ of Thessaloniki GREECE kehagias@egnatia.ee.auth.gr Fragkou ... (Heinonen, 1998) and Utiyama and Isahara (Utiyama and Isa- hara, 2001). Finally, other researchers use probabilistic ap- proaches to text segmentation including the use of hidden Markov models (Yamron et al., 1999), ... following Halliday and Hasan's theory (Halliday and Hasan, 1976), utilize statistical similarity measures such as word cooccurrence. For example the linear discourse segmentation algorithm proposed...

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

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

Ngày tải lên: 21/06/2014, 01:20

Ngày tải lên: 21/06/2014, 05:20

Ngày tải lên: 21/06/2014, 07:20

Ngày tải lên: 21/06/2014, 07:20