0

disambiguation in morphological parsing

Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Arabic Tokenization, Part-of-Speech Tagging and Morphological Disambiguation in One Fell Swoop" pdf

Báo cáo khoa học

... total of 71machine learning features per word. We specify awindow of two words preceding and following thecurrent word, using all 71 features for each word in this 5-word window. In addition, ... +y ‘my’). In our approach, tokenizing and morphologicallytagging (including part-of-speech tagging) are thesame operation, which consists of three phases.First, we obtain from our morphological ... supportvector machines which includes Viterbi decoding.6As training features, we use two sets. These setsare based on the ten morphological features in Fig-ure 2, plus four other “hidden” morphological...
  • 8
  • 385
  • 0
Báo cáo khoa học:

Báo cáo khoa học: "Advances in Discriminative Parsing" potx

Báo cáo khoa học

... training speed of discrimina-tive parsing. Our discriminative parsing method has no generative component, yetsurpasses a generative baseline on con-stituent parsing, and does so with mini-mal ... & Norvig, 1995).3 Training Method3.1 General SettingOur training set I consists of candidate inferencesfrom the parse trees in the training data. Fromeach training inference i ∈ I we generate ... development set as training progressed. Eventhough the baseline training made progress morequickly than the kitchen sink, the kitchen sink’s F1surpassed the baseline’s F1early in training, and at6.3K...
  • 8
  • 377
  • 0
Báo cáo khoa học:

Báo cáo khoa học: "Constituent-Based Morphological Parsing: A New Approach to the Problem of Word-Recognition" pdf

Báo cáo khoa học

... but nothing hinges on this decision; indeed, as we point out below, we will ultimately want a left-to-right parsing algorithm so that the phonological and syntactic parsing can be interleaved. ... necessary to provide a principled way of dealing with certain morphological processes, but such an approach to phonological processing is crucial for any interface of current parsing systems with ... correspondences. However, in our model, phonological rules are defined for particular domains of application rather than continuously applying as in the KIMMO parser for Finnish. For example, Warlpiri...
  • 8
  • 522
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Using Smaller Constituents Rather Than Sentences in Active Learning for Japanese Dependency Parsing" docx

Báo cáo khoa học

... dependency pars-ingthat the algorithm in Figure 4 does not generateevery pair of bunsetsus.34 Active Learning for Parsing Most of the methods of active learning for parsing in previous work ... FernandoPereira. 2005. Online large-margin training of de-pendency parsers. In Proc. of ACL-2005, pages523–530.Joakim Nivre. 2003. An efficient algorithm for pro-jective dependency parsing. In Proc. of ... analysis using cascaded chunking. In Proc. of CoNLL-2002, pages 63–69.Sadao Kurohashi and Makoto Nagao. 1998. Building aJapanese parsed corpus while improving the parsing system. In Proc. of...
  • 10
  • 432
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation" doc

Báo cáo khoa học

... Dan Klein, 2010. Painless unsu-pervised learning with features. In Proc. of NAACL.Taylor Berg-Kirkpatrick and Dan Klein, 2010. Phyloge-netic Grammar Induction. In Proc. of ACL.Cristina Bosco ... conversion schemes in Ger-man supervised constituency parsing and found oneto have positive in uence on parsing quality.Dependency Model with Valence (DMV). DMV(Klein and Manning, 2004) defines ... shown in Figure 4. In this case, the sec-ond corpus is obtained from the gold standard by replacing eachprepositional phrase in the gold standard withthe corresponding670model prefers setting...
  • 10
  • 411
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Non-Projective Dependency Parsing in Expected Linear Time" pptx

Báo cáo khoa học

... deterministicdependency parsing. In Proceedings of the Work-shop on Incremental Parsing: Bringing Engineeringand Cognition Together (ACL), pages 50–57.Joakim Nivre. 2006. Constraints on non-projective ... dependency parsing. In Proceedings of IWPT, pages 122–131.Ryan McDonald, Koby Crammer, and FernandoPereira. 2005a. Online large-margin training of de-pendency parsers. In Proceedings of ACL, ... Marinov. 2006. Labeledpseudo-projective dependency parsing with supportvector machines. In Proceedings of CoNLL, pages221–225.Joakim Nivre. 2004. Incrementality in deterministicdependency parsing. ...
  • 9
  • 627
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "The Effect of Corpus Size in Combining Supervised and Unsupervised Training for Disambiguation" pdf

Báo cáo khoa học

... 4.8+mechanismsubjlink+mechanismsubjlink + currencyobjlink 10.2mechanismsubjlink 3.4+European Monetary Systemsubjlink 0+currencyobjlink+Systemsubjlink +currencyobjlink 0European Monetary Systemsubjlink 0Systemsubjlink ... 0Systemsubjlink 0+systemsubjlink +currencyobjlink 0systemsubjlink 1.2+companysubjlink +currencyobjlink 0companysubjlink -1.1empty 3Table 3: Queries f or computing high attach-ment ... Unlabeled Data in Ma-chine Learning and Data Mining, ICML.Mark Johnson and Stefan Riezler. 2000. Ex-ploiting auxiliary distributions in stochasticunification-based grammars. In NAACL.David...
  • 8
  • 515
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Is the End of Supervised Parsing in Sight?" pdf

Báo cáo khoa học

... modeling the end of supervised parsing has come in sight. 1 Introduction A major challenge in natural language parsing is the unsupervised induction of syntactic structure. While most parsing ... strings (we will come back to word strings in section 5). Each corpus was divided into 10 training/test set splits of 90%/10% (n-fold testing), and each training set was randomly divided into ... believe that our result is quite promising for the future of unsupervised parsing. In putting our best f-score in table 4 into perspective, it should be kept in mind that the gold standard trees...
  • 8
  • 525
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "SenseLearner: Word Sense Disambiguation for All Words in Unrestricted Text" doc

Báo cáo khoa học

... previously seen in the training corpus,and therefore their overall coverage is not 100%.Starting with an annotated corpus consisting of allannotated files in SemCor, a separate training data setis ... Min-imally supervised word sense disambiguation for allwords in open text. In Proceedings of ACL/SIGLEXSenseval-3, Barcelona, Spain, July.R. Mihalcea and D. Moldovan. 2002. Pattern learningand ... sense disambiguation algorithm, in that it usesa relatively small data set for training purposes, andgeneralizes the concepts learned from the training datato disambiguate the words in the...
  • 4
  • 399
  • 0

Xem thêm