• Skip to primary navigation
  • Skip to main content
SRI logo
  • About
    • Press room
    • Our history
  • Expertise
    • Advanced imaging systems
    • Artificial intelligence
    • Biomedical R&D services
    • Biomedical sciences
    • Computer vision
    • Cyber & formal methods
    • Education and learning
    • Innovation strategy and policy
    • National security
    • Ocean & space
    • Quantum
    • QED-C
    • Robotics, sensors & devices
    • Speech & natural language
    • Video test & measurement
  • Ventures
  • NSIC
  • Careers
  • Contact
  • 日本支社
Search
Close
Speech & natural language publications March 1, 1989

Parsing and Type Inference For Natural and Computer Languages

Citation

Copy to clipboard


Shieber, S. M. (1989). Parsing and type inference for natural and computer languages. Stanford University.

Abstract

Computational and theoretical linguists and computer scientists interested in the computer processing of natural language have converged on a class of grammar formalisms for describing the well-formedness conditions of natural languages. This class is distinguished by its reliance on systems of declarative constraints to explicate natural-language syntax axiomatically, rather than generatively or procedurally. Intuition suggests that these various efforts from a broad range of disciplines form a natural methodological class; still, there is no general foundation on which to ground this impression. We provide a method for abstractly and uniformly characterizing a class of formalisms based on logical constraints, and use the uniformity to define and prove correct a parsing algorithm that applies to any formalism in the class. We discuss the applicability of these techniques to computer languages as well, specifically to type inference. In so doing, extensions of the simple formalism instances typically considered in natural-language analysis are motivated. This dissertation thus provides a mathematical and computational foundation for, and extensions of, current practices in theoretical and computational linguistics, as well as initiating a rapprochement between the techniques for describing well-formedness of natural and computer languages.

↓ Download

Share this

How can we help?

Once you hit send…

We’ll match your inquiry to the person who can best help you.

Expect a response within 48 hours.

Career call to action image

Make your own mark.

Search jobs

Our work

Case studies

Publications

Timeline of innovation

Areas of expertise

Institute

Leadership

Press room

Media inquiries

Compliance

Careers

Job listings

Contact

SRI Ventures

Our locations

Headquarters

333 Ravenswood Ave
Menlo Park, CA 94025 USA

+1 (650) 859-2000

Subscribe to our newsletter


日本支社
SRI International
  • Contact us
  • Privacy Policy
  • Cookies
  • DMCA
  • Copyright © 2022 SRI International