Skip to main content

Computational Linguistics and Natural Language Processing

  • Conference paper
Book cover Computational Linguistics and Intelligent Text Processing (CICLing 2011)

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

Abstract

Researches in Computational Linguistics (CL) and Natural Language Processing (NLP) have been increasingly dissociated from each other. Empirical techniques in NLP show good performances in some tasks when large amount of data (with annotation) are available. However, in order for these techniques to be adapted easily to new text types or domains, or for similar techniques to be applied to more complex tasks such as text entailment than POS taggers, parsers, etc., rational understanding of language is required. Engineering techniques have to be underpinned by scientific understanding. In this paper, taking grammar in CL and parsing in NLP as an example, we will discuss how to re-integrate these two research disciplines. Research results of our group on parsing are presented to show how grammar in CL is used as the backbone of a parser.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Oepen, S., Flickinger, D., Tsujii, J., Uszkoreit, H. (eds.): Collaborative Language Engineering. A Case Study in Efficient Grammar-based Processing. CSLI Lecture Notes. CSLI Publications, Stanford (2002)

    Google Scholar 

  2. Miyao, Y., Makino, T., Torisawa, K., Tsujii, J.: The LiLFes abstract machine and its evaluation with the LinGO grammar. Journal of Natural Language Engineering 6, 47–61 (2000)

    Article  Google Scholar 

  3. Miyao, Y., Tsujii, J.: Feature Forest Models for Probabilistic HPSG Parsing. Computational Linguistics 34, 35–80 (2008)

    Article  MathSciNet  Google Scholar 

  4. Ninomiya, T., Tsuruoka, Y., Miyao, Y., Tsujii, J.: Efficacy of beam thresholding, unification filtering and hybrid parsing in probabilistic HPSG parsing. In: Proc. of IWPT 2005, pp. 103–114 (2005)

    Google Scholar 

  5. Ninomiya, T., Tsuruoka, Y., Miyao, Y., Tsujii, J.: Fast and Scalable HPSG Parsing. TAL 46 (2005)

    Google Scholar 

  6. Ninomiya, T., Matsuzaki, T., Tsuruoka, Y., Miyao, Y., Tsujii, J.: Extermely lexicalized models for accurate and fast HPSG parsing. In: Proc. of EMNLP 2006, pp. 155–163 (2006)

    Google Scholar 

  7. Matsuzaki, T., Miyao, Y., Tsujii, J.: Efficient HPSG Parsing with Supertagging and CFG-filtering. In: The Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (2007)

    Google Scholar 

  8. Tsuruoka, Y., Tsujii, J.: Iterative CKY parsing for probabilistic context-free grammars. In: Su, K.-Y., Tsujii, J., Lee, J.-H., Kwong, O.Y. (eds.) IJCNLP 2004. LNCS (LNAI), vol. 3248, pp. 52–60. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Zhang, Y., Matsuzaki, T., Tsujii, J.: A Simple Approach for HPSG Supertagging Using Dependency Information. In: The Proceedings of 11th Annual Conference of the North American Chapter of the Association for Computational Linguistics, NAACL-HLT 2010 (2010)

    Google Scholar 

  10. Chomsky, N.: Syntactic Structures. Mouton, The Hague (1957)

    MATH  Google Scholar 

  11. Chomsky, N.: Aspects of the theory of syntax. MIT Press, Cambridge (1965)

    Google Scholar 

  12. Gazdar, G., Klein, E.H., Pullum, G.K., Sag, I.A.: Generalized Phrase Structure Grammar. Harvard University Press, Blackwell, Oxford, Cambridge (1985)

    Google Scholar 

  13. Bresnan, J.: Lexical Functional Syntax. Blackwell, Malden (2001)

    Google Scholar 

  14. Pollard, C., Sag, I.A.: Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago (1994)

    Google Scholar 

  15. Steedman, M.: The Syntactic Process. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  16. Abeilllé, A., Rambow, O.: Tree Adjoining Grammar: An Overview. In: Abeilllé, A., Rambow, O. (eds.) Tree Adjoining Grammars: Formalisms, Linguistic Analyses and Processing, pp. 1–68. CSLI Publications, Stanford (2000)

    Google Scholar 

  17. Sornlertlamvanich, V., Inui, K., Tanaka, H., Tokunaga, T., Takezawa, T.: Empirical support for new probabilistic generalized LR parsing. Journal of Natural Language Processing 6, 3–22 (1999)

    Article  Google Scholar 

  18. Nederhof, M.J., Satta, G.: Probabilistic Parsing Strategies. Journal of ACM 53, 406–436 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yoshinaga, N., Miyao, Y., Torisawa, K., Tsujii, J.: Parsing comparison across grammar formalisms using strongly equivalent grammars. TAL 44, 15–39 (2003)

    Google Scholar 

  20. Schabes, Y., Abeille, A., Joshi, A.: Parsing strategies with ’lexicalized’ grammars: Application to tree adjoining grammars. In: The Proceedings of COLING 1988, pp. 578–583 (1988)

    Google Scholar 

  21. Joshi, A., Vijay Shanker, K., Weir, D.: The Convergence of Mildly Context-Sensitive Grammar Formalisms. Technical Report MS-CIS-90-01, University of Pennsylvania (1990)

    Google Scholar 

  22. Keller, B.: Feature Logics, Infinitary Descriptions and Grammars. CSLI Publications, Stanford (1994)

    Google Scholar 

  23. Yoshinaga, N., Miyao, Y.: Grammar conversion from LTAG to HPSG. WEB-SLS: the European Student Journal on Language and Speech (2002)

    Google Scholar 

  24. XTAG Research Group: A lexicalized Tree Adjoining Grammar for English. Technical Report IRCS-01-03, University of Pennsylvania (2001)

    Google Scholar 

  25. Sarkar, A.: Practical experiments in parsing using tree adjoining grammars. In: Proc. of the fifth TAG+, pp. 193–198 (2000)

    Google Scholar 

  26. Van Noord, G.: Head Corner Parsing for TAG. Computational Intelligence 10, 525–534 (1994)

    Article  Google Scholar 

  27. Schieber, S.M.: An Introduction to Unification-Based Approaches to Grammar. Center for the Study of Language and Information, Stanford University, Stanford, CA (1986)

    Google Scholar 

  28. Torisawa, K., Nishida, K., Miyao, Y., Tsujii, J.: An HPSG parser with CFG filtering. Natural Language Engineering 6, 63–80 (2000)

    Article  Google Scholar 

  29. Perreira, F.C.N., Wright, R.N.: Finite-State Approximation of Phrase-Structure Grammars. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing. The MIT Press, Cambridge (1997)

    Google Scholar 

  30. Nederhof, M.J.: Practical Experiments with Regular Approximation of Context-Free Languages. Computational Lingusitics 26, 17–44 (2000)

    Article  MathSciNet  Google Scholar 

  31. Schieber, S.M.: Using restrictions to extend parsing algorithms for complex-feature-based formalisms. In: Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics (1985)

    Google Scholar 

  32. Carpenter, B.: The logic of typed feature structures. Cambridge University Press, Cambridge (1992)

    Book  MATH  Google Scholar 

  33. Boullier, P., Benout, S.: Efficient and robust LFG parsing: SXLFG. In: Proc. of IWPT 2005, pp. 1–10 (2005)

    Google Scholar 

  34. Johnson, M.: Deductive parsing with multiple levels of representation. In: Proceedings of Association for Computational Linguistics, pp. 241–248 (1988)

    Google Scholar 

  35. Haegeman, L.: Introduction to Government and Binding Theory. Blackwell Textbooks in Linguistics. Wiley-Blackwell (1991)

    Google Scholar 

  36. Fass, D., Wilks, Y.: Preference semantics, ill-formedness, and metaphor. Computational Lingusitics 9 (1983)

    Google Scholar 

  37. Hobbs, J.R., Bear, J.: Two Principles of Parse Preference. In: Proceedings of COLING 1990, pp. 162–167 (1990)

    Google Scholar 

  38. Hobbs, J.R., Stickel, M.E., Appelt, D.E., Martin, P.A.: Interpretation as Abduction. Artificial Intelligence 63, 69–142 (1993)

    Article  Google Scholar 

  39. Bednarek, M.: Semantic preference and semantic prosody re-examined. Corpus Linguistics and Linguistic Theory 4, 119–139 (2008)

    Article  Google Scholar 

  40. Fodor, J.: The modularity of mind. MIT Press, Cambridge (1983)

    Google Scholar 

  41. Ferreira, F., Christianson, K., Hollingworth, A.: Misinterpretations of Garden-Path Sentences: Implications for Models of Sentence Processing and Reanalysis. Journal of Psycholinguistic Research 30 (2001)

    Google Scholar 

  42. Abney, S.: A computational model of human parsing. Journal of Psycholinguistic Research 18, 129–144 (1989)

    Article  Google Scholar 

  43. Weinberg, A.: Parameters in the theory of sentence processing: Minimal Commitment theory goes east. Journal of Psycholinguistic Research 22, 339–364 (1993)

    Article  Google Scholar 

  44. Chitrao, M.V., Grishman, R.: Statistical parsing of messages. In: Proceedings of the DARPA Speech and Natural Language Workshop, pp. 263–266 (1990)

    Google Scholar 

  45. Charniak, E., Goldwater, S., Johnson, M.: Edge-based best-first chart parsing. In: Proceedings of the Sixth Workshop on Very Large Corpora, pp. 127–133 (1998)

    Google Scholar 

  46. Klein, D., Manning, C.D.: A* Parsing: Fast Exact Viterbi Parse Selection. In: HLT-NAACL (2003)

    Google Scholar 

  47. Kasper, W., Krieger, H.U., Spilker, J., Weber, H.: From Word Hypotheses to Logical Form: An Efficient Interleaved Approach. In: Proceedings of Natural Language Processing and Speech Technology. Results of the 3rd KONVENS Conference, pp. 77–88 (1996)

    Google Scholar 

  48. Briscoe, T., Carrol, J.: Generalized probabilistic LR-parsing of natural language (corpora) with unification grammars. Computational Linguistics 9 (1993)

    Google Scholar 

  49. Kiefer, B., Krieger, H.U., Prescher, D.: A Novel Disambiguation Method For Unification-Based Grammars Using Probabilistic Context-Free Approximations. In: Proc. of COLING 2002 (2002)

    Google Scholar 

  50. Berger, A., Pietra, S.D., Pietra, V.D.: A Maximum Entropy Approach to Natural Language Processing. Computational Linguistics 22, 39–71 (1996)

    Google Scholar 

  51. Riezler, S., Prescher, D., Kuhn, J., Johnson, M.: Lexicalized Stochastic Modeling of Constraint-Based Grammars using Log-Linear Measures and EM Training. In: Proc. of ACL 2000, pp. 480–487 (2000)

    Google Scholar 

  52. Malouf, R., van Noord, G.: Wide Coverage Parsing with Stochastic Attribute Value Grammars. In: Proc. of IJCNLP 2004 Workshop Beyond Shallow Analyses (2004)

    Google Scholar 

  53. Kaplan, R.M., Riezler, S., King, T.H., III, J.T.M., Vasserman, A.: Speed and accuracy in shallow and deep stochastic parsing. In: Proc. of HLT/NAACL 2004 (2004)

    Google Scholar 

  54. Miyao, Y., Tsujii, J.: Probabilistic dismabiguation models for wide-coverage HPSG grammar. In: Proc. of ACL 2005, pp. 83–90 (2005)

    Google Scholar 

  55. Geman, S., Johnson, M.: Dynamic programming for parsing and estimation of stochastic unification-based grammars. In: Proc. of ACL 2002, pp. 279–286 (2002)

    Google Scholar 

  56. Miyao, Y., Tsujii, J.: Maximum Entropy Estimation for Feature Forests. In: Proc. of HLT 2002, pp. 292–297 (2002)

    Google Scholar 

  57. Miyao, Y., Ninomiya, T., Tsujii, J.: Corpus-oriented grammar development for acquiring a head-driven phrase structure grammar from the penn treebank. In: Su, K.-Y., Tsujii, J., Lee, J.-H., Kwong, O.Y. (eds.) IJCNLP 2004. LNCS (LNAI), vol. 3248, pp. 684–693. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  58. Bangalore, S., Joshi, A.: Supertagging: An approach to almost parsing. Computational Linguistics 25, 237–265 (1999)

    Google Scholar 

  59. Clark, S., Curran, J.R.: The importance of supertagging for wide-coverage CCG parsing. In: Proc. of COLING 2004 (2004)

    Google Scholar 

  60. Clark, S., Curran, J.R.: Parsing the WSJ using CCG and log-linear models. In: Proc. of ACL 2004, pp. 104–111 (2004)

    Google Scholar 

  61. Shen, L., Joshi, A.K.: A SNoW based supertagger with application to NP chunking. In: Proc. of ACL 2003, pp. 505–512 (2003)

    Google Scholar 

  62. Zhang, Y., Ahn, B., Clark, S., Wyk, C.V., Curran, J.R., Rimell, L.: Chart Pruning for Fast Lexicalised-Grammar Parsing. In: The Proceedings of 23rd International Conference on Computational Linguistics (COLING 2010), pp. 1471–1479 (2010)

    Google Scholar 

  63. Kaji, N., Fujiwara, Y., Yoshinaga, N., Kitsuregawa, M.: Efficient Staggered Decoding for Sequence Labeling. In: The Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL 2010), pp. 485–494 (2010)

    Google Scholar 

  64. Zhang, Y., Matsuzaki, T., Tsujii, J.: Forest-guided Supertagger Training. In: The Proceedings of 23rd International Conference on Computational Linguistics, COLING 2010 (2010)

    Google Scholar 

  65. Sag, I.A., Wasow, T.: Performance-Compatible Competence Grammar. In: Borsley, R., Borjars, K. (eds.) Non-Transformational Syntax. Blackwell, Cambridge (in press)

    Google Scholar 

  66. Marr, D.: Vision: A Computational Investigation into the Human Representation and Processing of Visual Information. Freeman, New York (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsujii, J. (2011). Computational Linguistics and Natural Language Processing. In: Gelbukh, A.F. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2011. Lecture Notes in Computer Science, vol 6608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19400-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19400-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19399-6

  • Online ISBN: 978-3-642-19400-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics