OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages
Bookmark Share

Text

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

Shieber, Stuart M. - Personal Name;

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.OCLC-licensed vendor bibliographic record.


Availability

No copy data

Detail Information
Series Title
-
Call Number
-
Publisher
Cambridge, Mass. : : MIT Press Direct., 2003
Collation
1 online resource (xi, 183 pages) :illustrations
Language
English
ISBN/ISSN
9780262283519
Classification
NONE
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
-
Subject(s)
Grammar, Comparative and general
Computational linguistics.
Parsing (Computer grammar)
Programming languages (Electronic computers)
Specific Detail Info
-
Statement of Responsibility
Stuart M. Shieber
Other Information
Cataloger
imron
Source
-
Validator
https://doi.org/10.7551/mitpress/2123.001.0001
Digital Object Identifier (DOI)
-
Journal Volume
-
Journal Issue
-
Subtitle
-
Parallel Title
-
Other version/related

No other version available

File Attachment
  • Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?