政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/55034

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/55034

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113451/144438 (79%)
Visitors : 51291041 Online Users : 819

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Informatics > Department of Computer Science > Theses > Item 140.119/55034

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/55034

Title:	英文介系詞片語定位與英文介系詞推薦 Attachment of English prepositional phrases and suggestions of English prepositions
Authors:	蔡家琦 Tsai, Chia Chi
Contributors:	劉昭麟 Liu, Chao Lin 蔡家琦 Tsai, Chia Chi
Keywords:	語義分析機器翻譯文本校對 semantic analysis machine translation text proofreading
Date:	2011
Issue Date:	2012-10-30 15:21:59 (UTC+8)
Abstract:	英文介系詞在句子裡所扮演的角色通常是用來使介系詞片語更精確地補述上下文，英文的母語使用者可以很直覺地使用。然而電腦不瞭解語義，因此不容易判斷介系詞修飾對象；非英文母語使用者則不容易直覺地使用正確的介系詞。所以本研究將專注於介系詞片語定位與介系詞推薦的議題。在本研究將這二個介系詞議題抽象化為一個決策問題，並提出一個一般化的解決方法。這二個問題共通的部分在於動詞片語，一個簡單的動詞片語含有最重要的四個中心詞（headword）：動詞、名詞一、介系詞和名詞二。由這四個中心詞做為出發點，透過WordNet做階層式的選擇，在大量的案例中尋找語義上共通的部分，再利用機器學習的方法建構一般化的模型。此外，針對介系詞片語定的問題，我們挑選較具挑戰性介系詞做實驗。藉由使用真實生活語料，我們的方法處理介系詞片語定位的問題，比同樣考慮四個中心詞的最大熵值法（Max Entropy）好；但與考慮上下文的Stanford剖析器差不多。而在介系詞推薦的問題裡，較難有全面比較的對象，但我們的方法精準度可達到53.14%。本研究發現，高層次的語義可以使分類器有不錯的分類效果，而透過階層式的選擇語義能使分類效果更佳。這顯示我們確實可以透過語義歸納一套準則，用於這二個介系詞的議題。相信成果在未來會對機器翻譯與文本校對的相關研究有所價值。 This thesis focuses on problems of attachment of prepositional phrases (PPs) and problems of prepositional suggestions. Determining the correct PP attachment is not easy for computers. Using correct prepositions is not easy for learners of English as a second language. I transform the problems of PPs attachment and prepositional suggestion into an abstract model, and apply the same computational procedures to solve these two problems. The common model features four headwords, i.e., the verb, the first noun, the preposition, and the second noun in the prepositional phrases. My methods consider the semantic features of the headwords in WordNet to train classification models, and apply the learned models for tackling the attachment and suggestion problems. This exploration of PP attachment problems is special in that only those PPs that are almost equally possible to attach to the verb and the first noun were used in the study. The proposed models consider only four headwords to achieve satisfactory performances. In experiments for PP attachment, my methods outperformed a Maximum Entropy classifier which also considered four headwords. The performances of my methods and of the Stanford parsers were similar, while the Stanford parsers had access to the complete sentences to judge the attachments. In experiments for prepositional suggestions, my methods found the correct prepositions 53.14% of the time, which is not as good as the best performing system today. This study reconfirms that semantic information is instrument for both PP attachment and prepositional suggestions. High level semantic information helped to offer good performances, and hierarchical semantic synsets helped to improve the observed results. I believe that the reported results are valuable for future studies of PP attachment and prepositional suggestions, which are key components for machine translation and text proofreading.
Reference:	[1] Eneko Agirre, Timothy Baldwin, and David Martinez. Improving Parsing and PP Attachment Performance with Sense Information. In 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2008. [2] Michaela Atterer and Hinrich Schütze. Prepositional Phrase Attachment without Oracles. Computational Linguistics, 33(4):469–476, 2007. [3] Timothy Baldwin, Valia Kordoni, and Aline Villavicencio. Prepositions in Applications: A Survey and Introduction to the Special Issue. Computational Linguistics, 35(2):119–149, 2009. [4] Michael John Collins. Head-driven Statistical Models for Natural Language Parsing. PhD thesis, 1999. [5] Gregory F. Coppola, Alexandra Birch, Tejaswini Deoskar, and Mark Steedman. Simple Semi-supervised Learning for Prepositional Phrase Attachment. In Proceedings of the 12th International Conference on Parsing Technologies, pages 129–139, 2011. [6] RacheleDeFeliceandStephenG.Pulman.AutomaticallyAcquiringModelsofPreposition Use. In Proceedings of the Fourth ACL-SIGSEM Workshop on Prepositions, pages 45–50, 2007. [7] Rachele De Felice and Stephen G. Pulman. A Classifier-based Approach to Preposition and Determiner Error Correction in L2 English. In Proceedings of the 22nd International Conference on Computational Linguistics, volume 1, pages 169–176, 2008. [8] Michael Gamon, Jianfeng Gao, Chris Brockett, and Re Klementiev. Using Contextual Speller Techniques and Language Modeling for ESL Error Correction. In Proceedings of Joint Conference on Natural Language Processing 2008, pages 449–456, 2008. [9] Na-Rae Han, Joel Tetreault, Soo-Hwa Lee, and Jin-Young Ha. Using an Error-annotated Learner Corpus to Develop an ESL/EFL Error Correction System. In Proceedings of the Seventh conference on International Language Resources and Evaluation, 2010. [10] Donald Hindle and Mats Rooth. Structural Ambiguity and Lexical Relations. Computational Linguistics, 19(1):103–120, 1993. [11] Dirk Hovy, Stephen Tratz, and Eduard Hovy. What’s in a Preposition?: Dimensions of Sense Disambiguation for an Interesting Word Class. In Proceedings of the 23rd International Conference on Computational Linguistics: Posters, pages 454–462, 2010. [12] Dan Klein and Christopher D. Manning. Fast Exact Inference with a Factored Model for Natural Language Parsing. In Advances in Neural Information Processing Systems, volume 15, pages 3–10, 2003. [13] Claudia Leacock, Michael Gamon, and Chris Brockett. User Input and Interactions on Microsoft Research ESL Assistant. In Proceedings of the Fourth Workshop on Innovative Use of NLP for Building Educational Applications, pages 73–81, 2009. [14] Ken C. Litkowski and Orin Hargraves. Coverage and Inheritance in The Preposition Project. In Proceedings of the Third ACL-SIGSEM Workshop on Prepositions, pages 37– 44, 2006. [15] Chao-Lin Liu, Jing-Shin Chang, and Keh-Yih Su. The Semantic Score Approach to the Disambiguation of PP Attachment Problem. In Proceedings of the ROC Computational Linguistics Conference III, pages 253–270, 1990. [16] Tom O’Hara and Janyce Wiebe. Exploiting Semantic Role Resources for Preposition Disambiguation. Computational Linguistics, 35(2):151–184, 2009. [17] Marian Olteanu and Dan Moldovan. PP-Attachment Disambiguation Using Large Context. In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pages 273–280, 2005. [18] Patrick Pantel and Dekang Lin. An Unsupervised Approach to Prepositional Phrase Attachment Using Contextually Similar Words. In Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, pages 101–108, 2000. [19] Li Quan, Oleksandr Kolomiyets, and Marie-Francine Moens. KU Leuven at HOO-2012: A Hybrid Approach to Detection and Correction of Determiner and Preposition Errors in Non-native English Text. In Proceedings of the Seventh Workshop on Building Educational Applications Using NLP, pages 263–271, 2012. [20] Adwait Ratnaparkhi, Jeff Reynar, and Salim Roukos. A Maximum Entropy Model for Prepositional Phrase Attachment. In Proceedings of the Workshop on Human Language Technology, pages 250–255, 1994. [21] Jiri Stetina and Makoto Nagao. Corpus Based PP Attachment Ambiguity Resolution with a Semantic Dictionary. In Proceedings of the Fifth Workshop on Very Large Corpora, pages 66–80, 1997. [22] JoelR.TetreaultandMartinChodorow.TheUpsandDownsofPrepositionErrorDetection in ESL Writing. In Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1, pages 865–872, 2008. [23] Stephen Tratz and Dirk Hovy. Disambiguation of Preposition Sense Using Linguistically Motivated Features. In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium, pages 96–100, 2009. [24] Martin Volk. Combining Unsupervised and Supervised Methods for PP Attachment Disambiguation. In Proceedings of the 19th International Conference on Computational Linguistics, volume 1, pages 1–7, 2002. [25] Jian-Cheng Wu, Joseph Chang, Yi-Chun Chen, Shih-Ting Huang, Mei-Hua Chen, and Jason S. Chang. Helping Our Own: NTHU NLPLAB System Description. In Proceedings of the Seventh Workshop on Building Educational Applications Using NLP, pages 295–301, 2012.
Description:	碩士國立政治大學資訊科學學系 99753006 100
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0099753006
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Size	Format
300601.pdf	1153Kb	Adobe PDF2	1494	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - Feedback