Báo cáo khoa học: "Manually Constructed Context-Free Grammar For Myanmar Syllable Structure" potx

... Association for Computational Linguistics, pages 203–207, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Movie-DiC: a Movie Dialogue Corpus for Research ... most common spatial distribution of the aforementioned information elements. It is important to mention that a lot of different variants to the format presented in Figure 1 can be act...

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

... y i ). In order to instantiate a clause of the grammar, we need to find ranges for all variables in the clause and for all occurrences of terminals. For convenience, we assume the variables in a ... predicate of the form A i (α 1 , . . . , α dim(A i ) ) with A i ∈ N and α j ∈ (T ∪ V ) ∗ for 1 ≤ j ≤ dim(A i ). Central to RCGs is the notion of ranges on strings. Definition 2. For ever...

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

... make a step back before Gildea and Juraf- sky defined the first set of features for Semantic Role Labeling (SRL). The idea that syntax may have been useful to derive semantic information was already ... frequent roles associated with verbal predicates, for a total of 37,948 arguments. We randomly selected 30% of sentences for testing and 70% for training. Addi- tionally, 30% of training...

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

... (c) is it normal or is it ab- normal? Therefore, when a radiologist looks for information, his search queries most likely con- tain terms from various information sources that provide this kind ... biomedical ontologies shall conform to for purposes of interoperability. The OBO confor- mant ontologies, such as the FMA, are available at the National Center for Biomedical Ontology (N...

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

... no manual effort for their training. Their output can be used either by itself, or as training material for modern supervised SRL algorithms. In this paper we present an algorithm for unsu- pervised ... bottom. For each of them we update the following counters: sentence(ST ) for the root ancestor’s ST , patter n i (ST ) for the ones complying to the i-th lexico-syntactic pattern a...

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

... Association for Computational Linguistics EdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar Chung-Chi Huang Mei-Hua Chen Shih-Ting Huang Jason S. Chang Institute of Information Systems ... (Burstein et al., 2004) for correlation. 28 procedure GrammarChecking(T,PatternGrammarBank) (1) Suggestions=“”//candidate suggestions (2) sentences=sentenceSplitting(T) for each sentenc...

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

... situation. Last, I argue for the development of entirely incremental grammar induction algorithms instead of the approaches of the systems discussed before. 1 Introduction Grammar induction is a ... grammars) that he can learn. Proved more strictly for formal grammars, Gold’s (1967) work showed that one cannot learn any type of su- perfinite grammar (e.g. regular languages, context-...

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

... implementation and Section 7 concludes with pointers for further research. 2 Description Grammars There is a range of grammar formalisms which depart from Tree Adjoining Grammar (TAG) by taking as basic building ... of natural language. The motivation for model theoretic grammars is initiallytheoretical: the use of logic should sup- port both a more precise formulation of grammars and...

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

... proposes a method for generating a logical- constraint-based internal representation from a unifica- tion grammar formalism with disjunctive information. Unification grammar formalisms based ... from formalisms (i) or ones that generate representation (b) from formalisms (ii). However, representation (b) is superior, and formalism (i) is far better. Representation (b) is superior...

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

... unification-based parser for relational grammars developed within the stratified feature grammar (SFG) frame- work, which generalizes Kasper-Rounds logic to handle relational grammar analyses. We ... tor, &, unique to SFG. Formulas involving ~ are called e~tension formulas and they have a more complicated semantics. For example, Dative has the following informal interpreta...

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