Báo cáo khoa học: "HPSG-Style Underspecified Japanese Grammar with Wide Coverage" docx

... HPSG-Style Underspecified Japanese Grammar with Wide Coverage MITSUISHI Yutaka t, TORISAWA Kentaro t, TSUJII Jun'ichi t* ... This paper describes a wide- coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attain- able using an underspecified grammar. Under- specification, ... Introduction Our purpose is to design a pr...

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

... logical- constraint-based internal representation from a unifica- tion grammar formalism with disjunctive information. Unification grammar formalisms based on path equa- tions and lists of pairs ... understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore, it is effective to translate unification...

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

... promised has. 3 A CCG for German 3.1 C ombinatory Categorial Grammar CCG (Steedman (1996; 2000)) is a lexicalized grammar formalism with a completely transparent syntax-semantics interface. Since ... dependency grammar. Each sentence is represented as a graph whose nodes are labeled with syntactic categories (NP, VP, S, PP, etc.) and POS tags. Edges are directed and la- beled with...

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

... than fea- ture templates since it can use the all-subtrees repre- sentation without loss of efficiency. 3 RankBoost with subtree features A simple question related to kernel-based parse reranking ... precision, which are slightly worse than the results obtained with our model. (Bod, 2001) also uses the all-subtrees repre- sentation with a very different parameter estimation method, and r...

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

... which employs a manu- ally constructed grammar and a lexicon derived from WordNet with an additional dictionary of proper names (130,000 entries in total). The grammar is represented as a network ... (4) would assign lower and lower probabilities to sentences with large numbers of features. Since we need to compare sentence pairs with varied numbers of features, we will normalize th...

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

... turn, combines with the np “Ronaldinho” to form a sentence. The example illustrates the rule of Application, denoted with < and > in derivations. The schemata for this rule, along with the Composition ... taken from the World Cup test-bed included with the OpenCCG grammar development system 1 and simplified considerably. This included 19 ex- ample sentences with a total of 10...

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

... 2004. Wide- coverage semantic representations from a CCG parser. In Proceedings of COLING, volume 4, page 1240–1246. S. Clark and J. R. Curran. 2007. Wide- Coverage ef- ficient statistical parsing with ... analyze a wide range of linguistic phenomena (Steedman, 2000). On the practical side, we have corpora with CCG deriva- tions for each sentence (Hockenmaier and Steed- man, 2007), a...

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

... early youth to have learned the grammar from his parents, without the help of innate knowledge (or: Universal Grammar) , that severely constrains the number of hypotheses (i.e. grammars) that he can learn. ... development of entirely incremental grammar induction algorithms instead of the approaches of the systems discussed before. 1 Introduction Grammar induction is a task within the...

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

... practical method to detect Japanese homophone errors in Japanese texts. It is very important to detect homophone errors in Japanese revision systems because Japanese texts suffer from homophone ... error detection. 1 Introduction In this paper, we propose a method of detect- ing Japanese homophone errors in Japanese texts. Our method is based on a decision list proposed by...

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

... structural representations. The grammar formalism for such a purpose is called the String-Tree Correspondence Grammar (STCG). The STCG is a more formal version of the Static Grammar developed by [Chappuy ... [Vauquois & Chappuy 85]. The Static Grammar (shortly later renamed the Structural Correspondence Specification Grammar) , was designed to be a declarative grammar fo...

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