Skip to main content

Determining the Dependency Among Clauses Based on Machine Learning Techniques

  • Conference paper
Adaptive and Natural Computing Algorithms (ICANNGA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4431))

Included in the following conference series:

  • 2177 Accesses

Abstract

The longer the input sentences, the worse the syntactic parsing results. Therefore, a long sentence is first divided into several clauses, and syntactic analysis for each clause is performed. Finally, all the analysis results are merged into one. In the merging process, it is difficult to determine the dependency among clauses. To handle such syntactic ambiguity among clauses, this paper proposes two-step clause-dependency determination method based on machine learning techniques. We extract various clause-specific features, and analyze the effect of each feature on the performance. For the Korean texts, we experiment using four kinds of machine-learning methods. Logitboosting method performed best and it also outperformed the previous rule-based methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shirai, S., Ikehara, S., Yokoo, A., Kimura, J.: A new dependency analysis method based semantically embedded sentence structures and its performance on Japanese subordinate clauses. Transactions of Information Processing Society of Japan 36(10), 2353–2361 (1995)

    Google Scholar 

  2. Kawahara, D., Kurohashi, S.: Corpus-based Dependency Analysis of Japanese Sentences using Verb Bunsetsu Transitivity. In: Proceedings of the 5th Natural Language Processing Pacific Rim Symposium, pp. 387–391 (1999)

    Google Scholar 

  3. Minami, F.: Gendai Nihongo no Kouzou (structures of Modern Japanese Language). Taishuukan shoten, Tokyo (1974)

    Google Scholar 

  4. Hideki, N.: The relations between Korean surface forms and grammars (in Korean) (2002)

    Google Scholar 

  5. Roh, Y.-H., Seo, Y.A., Lee, K.-Y., Choi, S.-K.: Long Sentence Partitioning using Structure Analysis for Machine Translation. In: Proceeding on NLPRS, pp. 646–652 (2001)

    Google Scholar 

  6. Utsuro, T., Nishiokayama, S., Fujio, M., Matsumoto, Y.: Analyzing dependencies of Japanese subordinate clauses based on statistics of scope embedding preference. In: Proc. 1st Conference of the North American Chapter of the ACL, pp. 110–117 (2000)

    Google Scholar 

  7. Haruno, M., Shirai, S., Ooyama, Y.: Using decision trees to construct a practical parser. In: Proc. 36th Annual Meeting of the Association for Computational Linguistics, Montreal, Quebec, Canada, pp. 505–511 (1998)

    Google Scholar 

  8. Nomoto, T., Matsumoto, Y.: Discourse parsing: a decision tree approach. In: Proc. 6th Workshop on Very Large Corpora, Montreal, Quebec, Canada, pp. 216–224 (1998)

    Google Scholar 

  9. Sornertlamvanich, V., Potipiti, T., Charoenporn, T.: Automatic corpus-based Thai word extraction with the C4.5 learning algorithm. In: Proc. 18th International Conference on Computational Linguistics, Saarbrücken, Germany, pp. 802–807 (2000)

    Google Scholar 

  10. Kudo, T., Matsumoto, Y.: Chunking with Support Vector Machines. In: Proc. 2nd meeting of North American Chapter of Association for Computational Linguistics (NAACL), Pittsburgh, PA, USA, pp. 192–199 (2001)

    Google Scholar 

  11. Kudo, T., Matsumoto, Y.: Japanese Dependency Structure Analysis Based on Support Vector Machines. In: Proc. 2000 SIDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora (EMNLP/VLC-2000), Hongkong, China, pp. 18–25 (2000)

    Google Scholar 

  12. Yamada, H., Matsumoto, Y.: Statistical Dependency Analysis with Support Vector Machines. In: Proc. 8th International Workshop on Parsing Technology, Nancy, France, pp. 195–206 (2003)

    Google Scholar 

  13. Carreras, X., Marquez, L.: Boosting Trees for Clause Splitting. In: Proc. CoNLL-2001, Toulouse, France, pp. 73–75 (2001)

    Google Scholar 

  14. Henderson, J.C., Brill, E.: Bagging and Boosting a Treebank Parser. In: Proc. NAACL-2000, Seattle, Washington, USA, pp. 34–41 (2000)

    Google Scholar 

  15. Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines (2001), Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm

  16. Quinlan, J.R.: C4.5 Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  17. Freund, Y., Schapire, R.E.: Experiments with a New Boosting Algorithm. In: Machine Learning: Proc. 13th International Conference, Bari, Italy, pp. 148–156 (1996)

    Google Scholar 

  18. Friedman, J., Hastie, T., Tibsherani, R.: Additive Logistic Regression: A Statistical View of Boosting. Annals of Statistics 28(2), 337–374 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bartlomiej Beliczynski Andrzej Dzielinski Marcin Iwanowski Bernardete Ribeiro

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Kim, MY. (2007). Determining the Dependency Among Clauses Based on Machine Learning Techniques. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_91

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71618-1_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71589-4

  • Online ISBN: 978-3-540-71618-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics