Skip to content
Register Sign in Wishlist

Graph-based Natural Language Processing and Information Retrieval

$69.99 (P)

  • Date Published: April 2011
  • availability: Available
  • format: Hardback
  • isbn: 9780521896139

$ 69.99 (P)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Graph theory and the fields of natural language processing and information retrieval are well-studied disciplines. Traditionally, these areas have been perceived as distinct, with different algorithms, different applications, and different potential end-users. However, recent research has shown that these disciplines are intimately connected, with a large variety of natural language processing and information retrieval applications finding efficient solutions within graph-theoretical frameworks. This book extensively covers the use of graph-based algorithms for natural language processing and information retrieval. It brings together topics as diverse as lexical semantics, text summarization, text mining, ontology construction, text classification, and information retrieval, which are connected by the common underlying theme of the use of graph-theoretical methods for text and information processing tasks. Readers will come away with a firm understanding of the major methods and applications in natural language processing and information retrieval that rely on graph-based representations and algorithms.

    • Brings together graph theory and natural language processing
    • Offers extensive overview of NLP and IR methods that rely on graphs
    • Provides a detailed description of state-of-the-art methods and many pointers to related research work
    Read more

    Reviews & endorsements

    "For the first time, a computational framework that unifies many algorithms and representations from the fields of natural language processing and information retrieval. This book is a comprehensive introduction to both theory and practice."
    Giorgio Satta, University of Padua

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: April 2011
    • format: Hardback
    • isbn: 9780521896139
    • length: 202 pages
    • dimensions: 236 x 157 x 18 mm
    • weight: 0.45kg
    • contains: 136 b/w illus. 11 tables
    • availability: Available
  • Table of Contents

    Part I. Introduction to Graph Theory:
    1. Notations, properties, and representations
    2. Graph-based algorithms
    Part II. Networks:
    3. Random networks
    4. Language networks
    Part III. Graph-Based Information Retrieval:
    5. Link analysis for the World Wide Web
    6. Text clustering
    Part IV. Graph-Based Natural Language Processing:
    7. Semantics
    8. Syntax
    9. Applications.

  • Authors

    Rada Mihalcea, University of North Texas
    Rada Mihalcea is an Associate Professor in the Department of Computer Science and Engineering at the University of North Texas, where she leads the Language and Information Technologies research group. In 2009, she received the Presidential Early Career Award for Scientists and Engineers, awarded by President Barack Obama. She served on the editorial board of several journals, including Computational Linguistics, the Journal of Natural Language Engineering and Language Resources and Evaluations, and she co-chaired the Empirical Methods in Natural Language Processing conference in 2009 and the Association for Computational Linguistics conference in 2011. She has been published in IEEE Intelligent Systems, the Journal of Natural Language Engineering, the Journal of Machine Translation, Computational Intelligence, the International Journal of Semantic Computing and Artificial Intelligence Magazine.

    Dragomir Radev, University of Michigan, Ann Arbor
    Dragomir Radev is a Professor in the School of Information, the Department of Electrical Engineering and Computer Science, and the Department of Linguistics at the University of Michigan, where he is leader of the Computational Linguistics and Information Retrieval research group (CLAIR). He has more than 100 publications in conferences and journals such as Communications of the ACM, the Journal of Artificial Intelligence Research, Bioinformatics, Computational Linguistics, Information Processing and Management and the American Journal of Political Science, among others. He is on the editorial boards of Information Retrieval, the Journal of Natural Language Engineering and the Journal of Artificial Intelligence Research. Radev is an ACM distinguished scientist as well as the coach of the US high school team in computational linguistics.

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.