Topics in Computational Linguistics Grammar Engineering

Similar documents
An Interactive Intelligent Language Tutor Over The Internet

Pre-Processing MRSes

CS 598 Natural Language Processing

Introduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.

Parsing of part-of-speech tagged Assamese Texts

Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm

Context Free Grammars. Many slides from Michael Collins

Applications of memory-based natural language processing

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

AQUA: An Ontology-Driven Question Answering System

Derivational: Inflectional: In a fit of rage the soldiers attacked them both that week, but lost the fight.

Hindi Aspectual Verb Complexes

The Interface between Phrasal and Functional Constraints

Basic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English.

Basic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1

Implementing the Syntax of Japanese Numeral Classifiers

Control and Boundedness

English Language and Applied Linguistics. Module Descriptions 2017/18

A Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many

Spoken Language Parsing Using Phrase-Level Grammars and Trainable Classifiers

Linguistics. Undergraduate. Departmental Honors. Graduate. Faculty. Linguistics 1

Interfacing Phonology with LFG

Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG

Some Principles of Automated Natural Language Information Extraction

Jacqueline C. Kowtko, Patti J. Price Speech Research Program, SRI International, Menlo Park, CA 94025

Developing a TT-MCTAG for German with an RCG-based Parser

Using dialogue context to improve parsing performance in dialogue systems

Derivational and Inflectional Morphemes in Pak-Pak Language

A relational approach to translation

A Neural Network GUI Tested on Text-To-Phoneme Mapping

The presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.

Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing. Grzegorz Chrupa la

Constraining X-Bar: Theta Theory

LQVSumm: A Corpus of Linguistic Quality Violations in Multi-Document Summarization

On the Notion Determiner

cambridge occasional papers in linguistics Volume 8, Article 3: 41 55, 2015 ISSN

CS 446: Machine Learning

UNIVERSITY OF OSLO Department of Informatics. Dialog Act Recognition using Dependency Features. Master s thesis. Sindre Wetjen

Dependency, licensing and the nature of grammatical relations *

Natural Language Processing. George Konidaris

ENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist

Chinese Language Parsing with Maximum-Entropy-Inspired Parser

NAME: East Carolina University PSYC Developmental Psychology Dr. Eppler & Dr. Ironsmith

FOREWORD.. 5 THE PROPER RUSSIAN PRONUNCIATION. 8. УРОК (Unit) УРОК (Unit) УРОК (Unit) УРОК (Unit) 4 80.

THE ROLE OF DECISION TREES IN NATURAL LANGUAGE PROCESSING

Structure-Preserving Extraction without Traces

Organizing Comprehensive Literacy Assessment: How to Get Started

Type-driven semantic interpretation and feature dependencies in R-LFG

ReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology

LTAG-spinal and the Treebank

An Introduction to the Minimalist Program

Specifying Logic Programs in Controlled Natural Language

Proof Theory for Syntacticians

Minimalism is the name of the predominant approach in generative linguistics today. It was first

Department of Anthropology ANTH 1027A/001: Introduction to Linguistics Dr. Olga Kharytonava Course Outline Fall 2017

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation

Generation of Referring Expressions: Managing Structural Ambiguities

Feature-Based Grammar

The Effect of Discourse Markers on the Speaking Production of EFL Students. Iman Moradimanesh

Lingüística Cognitiva/ Cognitive Linguistics

Survey on parsing three dependency representations for English

TESL /002 Principles of Linguistics Professor N.S. Baron Spring 2007 Wednesdays 5:30 pm 8:00 pm

Linking Task: Identifying authors and book titles in verbose queries

CS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus

LING 329 : MORPHOLOGY

Grammars & Parsing, Part 1:

Bachelor Class

Refining the Design of a Contracting Finite-State Dependency Parser

Measuring the relative compositionality of verb-noun (V-N) collocations by integrating features

LFG Semantics via Constraints

LINGUISTICS. Learning Outcomes (Graduate) Learning Outcomes (Undergraduate) Graduate Programs in Linguistics. Bachelor of Arts in Linguistics

Computer Science 141: Computing Hardware Course Information Fall 2012

Heads and history NIGEL VINCENT & KERSTI BÖRJARS The University of Manchester

The Structure of Relative Clauses in Maay Maay By Elly Zimmer

Achim Stein: Diachronic Corpora Aston Corpus Summer School 2011

Agnès Tutin and Olivier Kraif Univ. Grenoble Alpes, LIDILEM CS Grenoble cedex 9, France

Language Acquisition Fall 2010/Winter Lexical Categories. Afra Alishahi, Heiner Drenhaus

Inleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3

Construction Grammar. University of Jena.

Adapting Stochastic Output for Rule-Based Semantics

Psychology and Language

Ontologies vs. classification systems

Automatic Translation of Norwegian Noun Compounds

A Case Study: News Classification Based on Term Frequency

Compositional Semantics

BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS

- «Crede Experto:,,,». 2 (09) ( '36

Laboratorio di Intelligenza Artificiale e Robotica

What Can Neural Networks Teach us about Language? Graham Neubig a2-dlearn 11/18/2017

Program Matrix - Reading English 6-12 (DOE Code 398) University of Florida. Reading

MYCIN. The MYCIN Task

Self Study Report Computer Science

Florida Reading Endorsement Alignment Matrix Competency 1

Accurate Unlexicalized Parsing for Modern Hebrew

Building an HPSG-based Indonesian Resource Grammar (INDRA)

EdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar

Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming

Aviation English Solutions

Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form

Transcription:

Topics in Computational Linguistics Grammar Engineering Dan Flickinger CSLI Stanford & Saarland University danf@csli..edu Stephan Oepen Universitetet i Oslo & CSLI Stanford oe@csli..edu http://lingo..edu/courses/05/ge/

So, What is Computational Linguistics?... teaching computers our language. (Alien Researcher)... the scientific study of human language specifically of the system of rules and the ways in which they are used in communication using mathematical models and formal procedures that can be realized and validated using computers; a cross-over of many disciplines. (Stanford Professor)... a cornerstone of our pioneering.net initiative and the operating systems of the future; innovative technology that will change our world. (President of US-Based Software Company)... a sub-discipline of our Artificial Intelligence programmes. (CMU Professor) Computational Linguistics: Grammar Engineering (2)

What About (Computational) Grammar Then? Kim was happy because Wellformedness passed the exam. Kim was happy because final grade was an A. Kim was happy when she saw Meaning Kim gave Sandy a book. Kim gave a book to Sandy. Sandy was given a book by Kim. Ambiguity on television. I saw the astronomer with the telescope. Have her report on my desk immediately! Computational Linguistics: Grammar Engineering (3)

What We Are About to Do (and Why) Course Outline Develop understanding of (natural) language as a system of rules; learn how to formalize grammars through typed feature structures; adapt and develop sequence of trivial HPSG grammars in LKB; solve weekly excercises: immediate gratification (risk of late hours). Why Computational Grammars research formalize linguistic theories with complex interactions of language phenomena; identify cross-language generalizations; education teach frameworks or analyses in formal morphology, syntax, and semantics; support student experimentation; applications embed grammar-based natural language analysis or generation in research prototypes and commercial applications. Computational Linguistics: Grammar Engineering (4)

Student Experimentation Immediate Gratification Computational Linguistics: Grammar Engineering (5)

Some Applications of Computational Grammars Machine Translation Traditional: analyse source to some degree, transfer, generate target. Text Understanding Email auto- (or assisted) response: interpret customer requests; Semantic Web: annotate WWW with structured, conceptual data. (Spoken) Dialogue Systems Grammar & Controlled Language Checking Summarization & Text Simplification Computational Linguistics: Grammar Engineering (6)

Some Areas of Descriptive Grammar Phonetics The study of speech sounds. Phonology The study of sound systems. Morphology The study of word structure. Syntax The study of sentence structure. Semantics The study of language meaning. Prgamatics The study of language use. Computational Linguistics: Grammar Engineering (7)

Grammar Engineering from a CS Perspective Implementation Goals Translate linguistic constraints into specific formalism formal model; computational grammar provides mapping between form and meaning; assign correct analyses to grammatical, reject ungrammatical inputs; parsing and generation algorithms: apply mapping in either direction. Analogy to (Object-Oriented) Programming Computational system with observable behavior: immediately testable; typed feature structures as a specialized (OO) programming language; make sure that all the pieces fit together; revise test revise test... Computational Linguistics: Grammar Engineering (8)

The Linguistic Knowledge Builder (LKB) General & History Specialized grammar engineering environment for TFS grammars; main developers: Copestake (original), Carroll, Malouf, and Oepen; open-source and binary distributions (Linux, Windows, and Solaris). Grammar Engineering Fuctionality Compiler for typed feature structure grammars wellformedness; parser and generator: map from strings to meaning and vice versa; visualization: inspect trees, feature structures, intermediate results; debugging and tracing: interactive unification, stepping, et al. Computational Linguistics: Grammar Engineering (9)

Course Organization Computational Linguistics: Grammar Engineering (10)

Comments on Background Literature Formal Syntax Sag, Ivan A. Tom Wasow, and Emily M. Bender: Syntactic Theory. A Formal Introduction (2 nd Edition). Stanford, CA: CSLI Publications (2003); Pollard, Carl and Sag, Ivan: Head-Driven Phrase Structure Grammar. Chicago, IL and London, UK: University of Chicago Press (1994). Shieber, Stuart: An Introduction to Unification-Based Approaches to Grammar. Stanford, CA: CSLI Publications (1986). The Linguistic Knowledge Builder Copestake, Ann: Implementing Typed Feature Structure Grammars. Stanford, CA: CSLI Publications (2001). Computational Linguistics: Grammar Engineering (11)