probabilistic parsing for german

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

... Models for Probabilistic Parsing* Ezra Black Fred Jelinek John Lafferty David M. Magerman Robert Mercer Salim Roukos IBM T. J. Watson Research Center Abstract We describe a generative probabilistic ... describe a technique for estimat- ing the parameters for this model using decision trees. The history-based grammar model provides a mechanism for taking advantage of contextual information from ... h Grammar and parse tree for aabb. dexed the non-terminal (NT) nodes of the tree with this leftmost order. We denote by ~- the sen- tential form obtained just before we expand node i. Hence,...

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

... the format of the number in standard and Vietnamese format. For example, “123456.78” in standard format is “123,456.78” which in Vietnamese format is “123.456,78”. We use regular expression for ... average precision of the probabilistic framework is much higher than baseline approach, increasing 29% for query 1, 59% for query 2, 55% for query 3, 27% for query 4 and 22% for the last query. ... crucial for Internet users to obtain the desired information in an efficient and direct manner. Currently, there is a lot of information available in structured format on the web. For example,...

Ngày tải lên: 23/11/2012, 15:04

... of dependency parsing for Czech, (McDonald et al., 2005b) even outperforms projective parsing, and was one of the top systems in the CoNLL-06 shared task in multilingual dependency parsing. 2.1 ... Efficient pars- ing for bilexical context-free grammars and head- automaton grammars. In Proc. of ACL, pages 457– 464. J. Eisner. 1996. Three new probabilistic models for de- pendency parsing: An exploration. ... of projective dependency trees, would yield poor performance. That is not the case: dependency accuracy for non- projective parsing is 90.2% for English (McDon- ald et al., 2005b), only 0.7% lower...

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

... beam function, base beam value) for pars- ing using development test data consisting of strings for which we have annotated parse trees. The parsing accuracy for parsing word lattices was not directly ... the overparsing extension can be seen in Table 1. Each of the PARSEVAL measures improves when overparsing is used. 5.2 Parsing Lattices The success of the parsing model as a language model for speech ... Exploiting Syntactic Structure for Natural Language Modeling. Ph.D. thesis, Johns Hopkins University. Christopher Collins. 2004. Head-Driven Probabilistic Parsing for Word Lattices. M.Sc. thesis,...

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

... trigrams: A probabilistic model of link grammar. In Proc. of the AAAI Conf. on Probabilistic Approaches to Nat. Lang., October. D. Magerman. 1995. Statistical decision-tree mod- els for parsing. ... techniques for cheaply attaching head information to deriva- tions can also be exploited in parsing formalisms other than rewriting systems. The authors have developed an O(nT)-time parsing ... We present O(n 4) parsing algorithms for two bilexical formalisms, improv- ing the prior upper bounds of O(n5). For a com- mon special case that was known to allow O(n 3) parsing (Eisner,...

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

... performance, with an LF of around 88.5%, in the settings of parsing time less than 500ms/sentence for Section 22. For comparison with previous studies using the packed parse forest, the performances ... between LF and parsing time for the development set (Section 22, gold POS). As seen in the figure, the LF increased as the parsing time increased. The increase in LF for determi- nistic parsing without ... shift-reduce pars- ing approach for unification-based grammars without the mechanisms of the packed parse for- est. Shift-reduce parsing for CFG and dependen- cy parsing have recently been studied...

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

... CDD-based Formal Model for Expert Finding. In Proc. of CIKM 2007. Hertzum, M. and Pejtersen, A. M., 2000. The informa- tion-seeking practices of engineers: searching for documents as well as for ... present different qualities. For example, both topic “css test” and “test suite” are the bi-gram matching for query “css test suite”; however, the former might be more informative. To model that, ... kinds of documents. For example, for web pages, we can construct the <Title> from either the ‘title’ metadata or the con- tent of web pages (Hu et al., 2006). As for e-mail, we can use...

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

... Keller. 2003. Probabilistic parsing for German using Sister-Head dependencies. In Erhard Hinrichs and Dan Roth, editors, Proceedings of the 41st Annual Meeting of the Association for Computational ... 505–512, Sydney, July 2006. c 2006 Association for Computational Linguistics Creating a CCGbank and a wide-coverage CCG lexicon for German Julia Hockenmaier Institute for Research in Cognitive Science University ... Miyao and Jun’ichi Tsujii. 2005. Probabilistic dis- ambiguation models for wide-coverage HPSG parsing. In Pr oceedings of the 43rd Annual Meeting of the Associa- tion for Computational Linguistics,...

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

... completeness of parsing are proved. INTRODUCTION Our aim is twofold. First to provide a linguistical- ly well motivated categorial grammar for French (henceforth, FG) which accounts for word order ... precompiled before parsing and the number of rules increases rapidly or LP statements are checked on the fly during parsing thus slowing down proces- sing. 2. THE GRAMMAR The formal characteristics ... C. J. and Sag, I. (1988) An Information-Based Approach to Syntax and Semantics : Volume 1 Fundamentals. Stanford, Ca. : Center for the Study of Language and Information. S teedman, M. (1985)...

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

... argues that head-corner parsing is especially useful for parsing with non-concatenative grammar formalisms. In [Lavelli and Satta, 1991] a head-driven parsing strategy for Lexicalized Tree Adjoining ... step, thus leading to inferior performance. Bottom-up parsing is far more attractive for lexi- calist formalisms, as it is driven by the syntactic in- formation associated with lexical elements. ... bottom-up information. The top-down information is available through a left- corner resp. head-corner table, which turn out to be quite informative for this grammar. The head-corner parser performs...

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

... dyMERGER is unity for an acquiring bank in the year before the merger and zero otherwise. In order to account for the unit root of RISK, all variables are first differenced, before applying the ... index for owner-occupied Claudia Kurz housing in West Germany 1985 to 1998 Johannes Hoffmann 9 2004 The Inventory Cycle of the German Economy Thomas A. Knetsch 10 2004 Evaluating the German ... dyMERGER is unity for an acquiring bank in the year before the merger and zero otherwise. In order to account for the unit root of RISK, all variables are first first-differenced, before applying...

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

... Nahrung (German noun for: food). The Para- phrase column contains a description of a synset, e.g., for the selected synset the paraphrase is: der essbare Kern einer Nuss (German phrase for: the ... Tübingen, Germany. erhard.hinrichs@uni- tuebingen.de Abstract GernEdiT (short for: GermaNet Editing Tool) offers a graphical interface for the lexicogra- phers and developers of GermaNet ... the main orthographic form prior to the Neue Deutsche Recht- schreibung. This means that Nuß was the correct spelling instead of Nuss before the German spell- ing reform. Old Orth Var contains...

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

... WebLicht's own data exchange format TCF. 5 The TCF Format The D-SPIN Text Corpus Format TCF (Heid et al, 2010) is used by WebLicht as an internal data exchange format. The TCF format allows the combination ... based data formats were developed beside the TCF format (for example, an encoding for lexi- con based data). In order to avoid any confusion of element names between these different for- mats, ... exchange format, which is preferably based on widely accepted formats already in use (UTF-8, XML). WebLicht uses the RESTstyle API and its own XML-based data exchange for- mat (Text Corpus Format,...

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

... grammars for parsing German sen- tences. On the NEGRA corpus (Skut et al., 1998), they achieve an accuracy of 89.0% on parsing de- pendency edges. In Callmeier (2000), a platform for efficient HPSG parsing ... 2000. PET–a platform for experimen- tation with efficient HPSG processing techniques. Natural Language Engineering, 6(01):99–107. A. Dubey and F. Keller. 2003. Probabilistic parsing for German using ... Stylebook for the Tubingen Tree- bank of Written German (T ¨ uBa-D/Z). Seminar fur Sprachwissenschaft, Universitat Tubingen, Tubin- gen, Germany. T. Ule. 2003. Directed Treebank Refinement for PCFG Parsing. ...

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

... pars- ing performance for this language. German has a flexible word order and a flat treebank annotation, both of which could be responsible for this counter- intuitive effect. The results for French ... performance, or like German, in that lexicalization has only a small effect on pars- ing performance. The lexicalized parsing experiments were run us- ing Dan Bikel’s probabilistic parsing engine (Bikel, 2002) ... best performance: 81% constituency F-score and 84% de- pendency accuracy. All lexicalized mod- els outperform the unlexicalized baseline, consistent with probabilistic parsing re- sults for English,...

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

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

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

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

Ngày tải lên: 17/03/2014, 19:21