guided parsing of range

... the guided process. In our case, the guided processes are the RCL parsers for called guided parser and -guided parser . 4 Parsing with a Guide Parsing with a guide proceeds as follows. The guided ... LTAG parsing the number of trees selected by the words in a sentence (a measure of the syntactic lexical ambiguity of the sentence) is a better predictor of complexity than the num- ber of words ... in the parse forest of that last sentence). 9 Considering the last line of Table 2, one can notice that the times taken by the guided phases of the guided parser and the -guided parser are noticeably...

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

... the right edge of the potential expunction site; and 2) the expunged part is the left-hand member of a pair of copies, one on each side of the editing signal. The copies may be of three types: ... part of a deterministic parser, and tested on a wide range of sentences from transcribed speech. Further study of the self-correction system promises to provide insights into the units of production ... corpus of over twenty hours of transcribed speech, in the process of using the parser to search for various syntactic constructions. Tht~ transcripts are of sociolinguistic interviews of the...

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

... links. In the rest of this paper, we first give a very brief overview a general model of statistical depen- dency parsing and then introduce three models for dependency parsing of Turkish. We then ... average of about 8 words; 8 90% of the sentences had less than or equal to 15 words. In terms of IG s, the sentences comprised 2 to 55 IGs with an average of 10 IG s per sentence; 90% of the sentences ... Dependency Parsing of Turkish G ¨ uls¸en Eryi ˇ git Department of Computer Engineering Istanbul Technical University Istanbul, 34469, Turkey gulsen@cs.itu.edu.tr Kemal Oflazer Faculty of Engineering...

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

... Marcu, Daniel. 1997. The rhetorical parsing, sum- marization, and generation of natural language texts. Ph.D. thesis, Department of Computer Science, Uni- versity of Toronto, Forthcoming. Martin, ... correlation of cues with discourse structure: Results from a corpus study. Submitted for publication. Polanyi, Livia. 1988. A formal model of the structure of discourse. Journal of Pragmatics, ... Department of Computer Science University of Toronto Toronto, Ontario Canada M5S 3G4 marcu~cs, toronto, edu Abstract We derive the rhetorical structures of texts by means of two new,...

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

... Efficient Parsing Algorithm for TAGs. In Proceedings of the 28th Annual Meeting of the Association for Computational Linguistics. Pittsburgh, PA. Jackendoff, Ray, 1977. X.bar Syntax: A Study of ... the set of all nodes in the left (right) portion of some tree in IuA. Note that the three sets Middle-nodes, Left-nodes and Right-nodes constitute a partition of the set of all nodes of trees ... tends the domain of locality of context-free gram- mars (CFGs). TAGs are tree rewriting systems spec- ified by a finite set of elementary trees (for a detailed description of TAGs, see (Joshi,...

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

... make a difference in the adequacy of the parsings of natural-language sentences will be alterations of the format itself in terms of in- creasing the degree of context-sensitivity. This in effect ... subroutines. This raises the further question of the functions and design of the executive routine and sub- routines. In this type of parsing program, the function of the executive routine will be to ... what then are the major com- ponents of a parsing program? The answer which this author has found satisfactory is the well-known one of structuring the parsing pro- gram as an executive main...

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

... advantage of the fact that regardless of the length of the category only a bounded amount of information (at the beginning and end of the cate- 5Although this category is also the result of combination ... production. POLYNOMIAL TIME PARSING OF COMBINATORY CATEGORIAL GRAMMARS* K. Vijay-Shanker Department of CIS University of Delaware Delaware, DE 19716 David J. Weir Department of EECS Northwestern ... tinguished member of VN, f is a function that maps elements of VT to finite sets of categories, R is a fi- nite set of combinatory rules. Combinatory rules have the following form. In each of the rules...

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

... shallow form of parsing which identifies the ma- jor sections of a sentence in relation to the clausal main verb and the subordinat- ing heads. We report the results of topo- logical field parsing of German ... field parsing, a shallow form of parsing which identifies the ma- jor sections of a sentence in relation to the clausal main verb and subordinating heads, when present. We report the results of parsing ... below. All of the topological parsing proposals pre- date the advent of the Berkeley parser. The exper- iments of this paper demonstrate that the Berke- ley parser outperforms previous methods, many of which...

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

... Dependency Parsing Here, the head bunsetsu of the final bunsetsu of a clause boundary unit is identified. Let B (= B 1 ···B n ) be the sequence of bunset- sus of one sentence and S fin be a set of de- pendency ... parsing times of both methods are shown in Table 3. The parsing speed of our method im- proves by about 5 times on average in comparison with the conventional method. Here, the parsing time of ... accuracy of our method was higher than that of the conventional method. In this section, we first discuss the effect of our method on parsing accuracy, separately for bun- Table 6: Comparison of parsing...

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

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

... because of unknown words, style and frequently used grammatical structures). As the fiction subcorpus consists of three books and the law subcorpus consists of two rules, we took half of one of the ... annotate any internal struc- ture of Named Entities. We consider the last word of multiword named entities as the head because of morphological reasons (the last word of multi- word units gets inflected ... Academy of Sciences vinczev@inf.u-szeged.hu Abstract Hungarian is a stereotype of morpholog- ically rich and non-configurational lan- guages. Here, we introduce results on de- pendency parsing of Hungarian...

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

... syntactic and se- mantic parsing to improve the performance of both syntactic and semantic parsing, in particular that of semantic parsing. Evaluation shows that our integrated parsing approach outperforms ... syntactic parsing significantly improves the performance of both syntactic and semantic parsing. This is very promising and encouraging, considering the complexity of both syntactic and semantic parsing. ... dependency parsing, instead of constituent-based syntactic parsing. Thus the SRL performances of their systems are not di- rectly comparable to ours. 5.2 Results and Discussions Results of pipeline...

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

... Computational Linguistics Minimalist Parsing of Subjects Displaced from Embedded Clauses in Free Word Order Languages Asad B. Sayeed Department of Computer Science University of Maryland at College Park A. ... Latin provides a specific set of chal- lenges in the development of a robust syntactic anal- ysis; for instance, in the process of building parse trees, nouns must often be committed to positions ... suggests that the word has become part of some form of articulated CP struc- ture. Since our parsing algorithm is inspired by mini- malism, we cannot make use of the full X-bar sys- tem. Instead,...

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

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

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

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

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

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

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

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