Formal Grammar
15th and 16th International Conference on Formal GrammarFG 2010 Copenhagen, Denmark, August 2010FG 2011 Lubljana, Slovenia, August 2011
Published on 16. July 2012
X, 290 pages
978-3-642-32024-8 (ISBN)
Description
This book constitutes the refereed proceedings of the 15th and 16th International Conference on Formal Grammar 2010 and 2011,collocated with the European Summer School in Logic, Language and Information
in July 2010/2011.
The 19 revised full papers were carefully reviewed and selected from a total of 50 submissions. The papers papers deal with the following topics: formal and computational phonology, morphology, syntax, semantics and pragmatics; model-theoretic and proof-theoretic methods in linguistics; logical aspects of linguistic structure; constraint-based and resource-sensitive approaches to grammar; learnability of formal grammar;
integration of stochastic and symbolic models of grammar; foundational, methodological and architectural issues in grammar; mathematical foundations of statistical approaches to linguistic analysis.
More details
Other editions
Additional editions
Philippe de Groote | Mark-Jan Nederhof
Formal Grammar
15th and 16th International Conference on Formal GrammarFG 2010 Copenhagen, Denmark, August 2010FG 2011 Lubljana, Slovenia, August 2011
Book
07/2012
Springer
€53.49
Shipment within 7-9 days
Content
- Title
- Preface
- FG 2010 Organization
- Table of Contents
- Formal Grammar 2010: Contributed Papers
- Polarized Montagovian Semantics for the Lambek-Grishin Calculus
- The Lambek-Grishin Calculus
- Derivational Montagovian Semantics
- Case Analysis: Extraction
- Comparison
- References
- Two Models of Learning Iterated Dependencies
- Introduction
- Background
- Categorial Dependency Grammars
- Learnability, Finite Elasticity and Limit Points
- Limit Points for CDGs with Iterated Subtypes
- Incremental Learning
- Learnability from Positive Examples
- Original Algorithm on Functor-Argument Data
- Functor-Argument Structures for CDG with Iterated Subtypes
- On RG-Like Algorithms and Iteration
- Bounds and String Learnability
- Conclusion
- References
- The Lambek-Grishin Calculus Is NP-Complete
- Introduction
- Lambek-Grishin Calculus
- Preliminaries
- Derivation Length
- Additional Notations
- Derived Rules of Inference
- Type Similarity
- Reduction from SAT to LG
- Example
- Intuition
- Proof
- Only If-Part
- If-Part
- Conclusion
- References
- Resumption and Island-Hood in Hausa
- Introduction
- Overt Resumptive Pronouns
- Null Anaphora in Extraction
- Previous Analyses
- Resumption: Extraction or Anaphora?
- Anaphoric Processes in Rightward Movement
- Analysis
- Conclusion
- References
- Iterated Dependencies and Kleene Iteration
- Introduction
- Basics of Dependency Structures
- Categorial Dependency Grammars
- Problem of Iteration and a Multimodal Solution
- Expressiveness of mmCDG with Negative Modes
- Conclusion
- References
- Property Grammar Parsing Seen as a Constraint Optimization Problem
- Introduction
- Property Grammars
- Model-Theoretic Semantics of Property Grammar
- Representing Tree Models Using a Grid
- Handling Instances of Properties
- Implementation
- Comparison with Existing Work
- Conclusion
- References
- Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems
- Introduction
- Preliminaries and Notation
- Traditional Perspective on Optimality Systems
- Controlled Optimality Systems
- Application to Reference-Set Computation
- Focus Economy Explained
- A Model of Focus Economy
- Conclusion
- References
- Hyperintensional Dynamic Semantics
- Introduction
- Facts about Definiteness Presuppositions in English
- Hyperintensional Dynamic Semantics
- Information Structures
- Continuations and Dynamic Semantics
- Modeling Definiteness
- Definite Anaphora with It
- The Definite Determiner
- Conclusion and Future Work
- References
- Distinguishing Phenogrammar from Tectogrammar Simplifies the Analysis of Interrogatives
- Introduction
- An Overview of the Framework
- Phenogrammar
- Tectogrammar
- Semantics
- A Small Example
- The Data
- Interrogatives in Chinese
- Interrogatives in English
- The Analysis
- Polar Questions
- Constituent Questions
- Discussion and Conclusion
- References
- Generalized Discontinuity
- Introduction: Architecture of Logical Grammar
- Logic of Strings: The Lambek Calculus L
- Logic of Segmented Strings: The Displacement Calculus D
- Examples
- Defined Nondeterministic Continuous and Discontinuous Connectives
- Embedding Translation between ND and DA
- Defined Unary Connectives
- Discussion
- References
- Controlling Extraction in Abstract Categorial Grammars
- Introduction
- ACG: Definitions and Properties
- Definitions
- Grammatical Architecture
- Examples
- The Syntax-Semantics Interface
- Tensed Clauses as Scope Islands for Quantifiers
- Rooted and Embedded Wh-Extraction
- Multiple Extraction
- Related Approaches
- Parallel Architectures
- Continuation Semantics
- TAG and Lambek Grammars in ACG
- Conclusion
- References
- Plural Quantifications and Generalized Quantifiers
- Introduction
- Expressive Limitations of Elementary Languages
- From Singular Languages to Plural Languages
- References
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
- Introduction
- Preliminaries
- Basic Definitions and Notations
- Linear Regular Functions
- Multiple Context-Free Grammars
- Congruential Multiple Context-Free Grammars
- Learning of Congruential Multiple Context-Free Grammars with a Minimally Adequate Teacher
- Minimally Adequate Teacher
- Hypotheses
- Observation Tables
- Undergeneralization
- Overgeneralization
- Algorithm
- Slight Enhancement
- Conclusion
- References
- Formal Grammar 2011: Contributed Papers
- Locality and the Complexity of Minimalist Derivation Tree Languages
- Preliminaries and Notation
- Minimalist Grammars
- Introduction and Examples
- Minimalist Grammars, Derivation Trees, and Slices
- Locality and Subclasses of Derivation Tree Languages
- (Un)Definability in Some Subregular Language Classes
- Deterministic Top-Down Automata
- Strictly Local and Locally Threshold Testable Languages
- Definability in First-Order Logic
- Conclusion
- References
- Building a Formal Grammar for a Polysynthetic Language
- Introduction
- Lexical Functional Grammar
- Some Properties of Aymara
- Agglutinative Morphology
- Vowel Elision
- Differential Object Marking
- Case Stacking
- Polypersonal Agreement
- Causatives
- Converbs
- Free Word Order
- Relative and Complement Clauses
- Topic-Focus Articulation
- Lexical Mapping Theory and D-Structures
- Conclusions and Further Research
- References
- Eliminating Ditransitives
- The Semantics of Promise
- The Tectogrammar of Promise
- The Formal Model
- Representation by Machines
- Slot-Filling
- Conclusions
- References
- Lambek Grammars with the Unit
- L-Grammars
- L1-Grammars
- References
- Resolving Plural Ambiguities by Type Reconstruction
- Introduction
- The Extensional Version of Montague's PTQ
- Different Meanings of Plural Noun Phrases
- Verb Types and Overloaded Verbs
- Choosing among Noun Phrase Meaning
- Extension of PTQ by Plural Noun Phrases and Reciprocal Pronouns
- Type Reconstruction
- Simple Types and Subtyping Rules
- Typing Rules
- Type Reconstruction
- Application
- Conclusion and Open Questions
- Related Work
- References
- Weak Familiarity and Anaphoric Accessibility in Dynamic Semantics
- Overview
- The Problem of Anaphora across Inaccessible Domains
- Some Attempts to Rectify the Problem
- Strong and Weak Familiarity
- A Formalization in Hyperintensional Dynamic Semantics
- Types and Constants
- Context-Dependent Propositions, Updates, and Dynamic Propositions
- Connectives and Quantifiers
- Dynamic Generalized Determiners
- Extensions for Modeling Weak Familiarity
- A Small Fragment Demonstrating Weak Familiarity
- Overgeneration and Pragmatic Effects
- Conclusions and Remaining Issues
- References
- Author Index
