Grammar Approximation by Representative Sublanguage: A New Model for Language Learning

We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic assumptions about natural language syntax. We show that the search space for grammar induction is a complete grammar lattice, which guarantees the uniqueness of the learned grammar.

• Type: Conference
• Year: 2007
• Where: ACL
• Authors: Smaranda Muresan, Owen Rambow
• Keywords: ACL 2007, Complete Grammar Lattice, Computational Linguistics, Grammar, Natural Language