Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Semantic Processing for Finite Domains
  • Cited by 11
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      November 2009
      September 1990
      ISBN:
      9780511554414
      9780521362269
      9780521024037
      DOI:
      https://doi.org/10.1017/CBO9780511554414
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.412kg, 212 Pages
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.323kg, 212 Pages
      • Series:
      Studies in Natural Language Processing
      Subjects:
      Computational Linguistics, Computer Science, Artificial Intelligence and Natural Language Processing, Language and Linguistics, Computing: General Interest
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Series:
    Studies in Natural Language Processing
    Subjects:
    Computational Linguistics, Computer Science, Artificial Intelligence and Natural Language Processing, Language and Linguistics, Computing: General Interest
    Information

    Book description

    A primary problem in the area of natural language processing has been that of semantic analysis. This book aims to look at the semantics of natural languages in context. It presents an approach to the computational processing of English text that combines current theories of knowledge representation and reasoning in Artificial Intelligence with the latest linguistic views of lexical semantics. This results in distinct advantages for relating the semantic analysis of a sentence to its context. A key feature is the clear separation of the lexical entries that represent the domain-specific linguistic information from the semantic interpreter that performs the analysis. The criteria for defining the lexical entries are firmly grounded in current linguistic theories, facilitating integration with existing parsers. This approach has been implemented and tested in Prolog on a domain for physics word problems and full details of the algorithms and code are presented. Semantic Processing for Finite Domains will appeal to postgraduates and researchers in computational linguistics, and to industrial groups specializing in natural language processing.

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.