View in EDS PDF Full Text

Constraint-Based Grammar Formalisms : Parsing and Type Inference for Natural and Computer Languages

Saved in:
Bibliographic Details
Title: Constraint-Based Grammar Formalisms : Parsing and Type Inference for Natural and Computer Languages
Description: Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. It introduces new applications to both natural and computer languages and brings together Stuart Shieber's many contributions that have been at the core of developments ranging from the discovery of improved explanations of linguistic phenomena such as binding and coordination to the detailed mathematical analysis of constraint-solving and parsing in a variety of grammar formalisms. This thorough examination of the theoretical and computational foundations of constraint-based grammars and applications to natural-language analysis is unique in several respects. Shieber's theoretical framework may be applied to a whole class of formalisms with properties that make it possible to define a general parsing algorithm for all members of the class, with results that provide essential guidance to the implementer of constraint-based language processing systems. Shieber also brings out new connections between grammatical categories and data types, and between constraint-based natural-language analysis and type inference in computer languages. These connections should be of increasing interest both to computational and theoretical linguists and to computer scientists.
Authors: Stuart M. Shieber
Resource Type: eBook.
Subjects: Programming languages (Electronic computers)--Syntax, Parsing (Computer grammar), Computational linguistics, Grammar, Comparative and general--Data processing
Categories: PSYCHOLOGY / Cognitive Psychology & Cognition
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 347687
RelevancyScore: 959
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 959.155151367188
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$347687$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$347687$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Constraint-Based Grammar Formalisms : Parsing and Type Inference for Natural and Computer Languages
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. It introduces new applications to both natural and computer languages and brings together Stuart Shieber's many contributions that have been at the core of developments ranging from the discovery of improved explanations of linguistic phenomena such as binding and coordination to the detailed mathematical analysis of constraint-solving and parsing in a variety of grammar formalisms. This thorough examination of the theoretical and computational foundations of constraint-based grammars and applications to natural-language analysis is unique in several respects. Shieber's theoretical framework may be applied to a whole class of formalisms with properties that make it possible to define a general parsing algorithm for all members of the class, with results that provide essential guidance to the implementer of constraint-based language processing systems. Shieber also brings out new connections between grammatical categories and data types, and between constraint-based natural-language analysis and type inference in computer languages. These connections should be of increasing interest both to computational and theoretical linguists and to computer scientists.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Stuart+M%2E+Shieber%22">Stuart M. Shieber</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Programming+languages+%28Electronic+computers%29--Syntax%22">Programming languages (Electronic computers)--Syntax</searchLink><br /><searchLink fieldCode="DE" term="%22Parsing+%28Computer+grammar%29%22">Parsing (Computer grammar)</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+linguistics%22">Computational linguistics</searchLink><br /><searchLink fieldCode="DE" term="%22Grammar%2C+Comparative+and+general--Data+processing%22">Grammar, Comparative and general--Data processing</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22PSYCHOLOGY+%2F+Cognitive+Psychology+%26+Cognition%22">PSYCHOLOGY / Cognitive Psychology & Cognition</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=347687
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 410.285
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Programming languages (Electronic computers)--Syntax
        Type: general
      – SubjectFull: Parsing (Computer grammar)
        Type: general
      – SubjectFull: Computational linguistics
        Type: general
      – SubjectFull: Grammar, Comparative and general--Data processing
        Type: general
    Titles:
      – TitleFull: Constraint-Based Grammar Formalisms : Parsing and Type Inference for Natural and Computer Languages
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Stuart M. Shieber
      – PersonEntity:
          Name:
            NameFull: Stuart M. Shieber
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 1992
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9780262513852
            – Type: isbn-print
              Value: 9780262193245
            – Type: isbn-electronic
              Value: 9780262283519
          Titles:
            – TitleFull: Constraint-Based Grammar Formalisms : Parsing and Type Inference for Natural and Computer Languages
              Type: main
ResultId 1