Unification: Computational Issues

Wintner, Shuly

doi:10.1016/b0-08-044854-2/00887-7

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work we employ unification grammars [65,66] and in particular unification grammars that are based on typed feature structures [13]. Such grammars underly linguistic theories such as Lexical Functional Grammar [28] and Head-Driven Phrase-Structure Grammars (HPSG) [48].…”

Section: Formal Grammarsmentioning

confidence: 99%

Formal Grammars of Early Language

Wintner

Lavie

MacWhinney

2009

Languages: From Formal to Natural

View full text Add to dashboard Cite

Abstract. We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. This approach provides a testbed for evaluating theories of language acquisition, in particular with respect to the extent to which innate, language-specific mechanisms must be assumed. Specifically, we focus on a single child learning English and use the CHILDES corpus for actual performance data. We describe a set of grammars which account for this child's utterances between the ages 1;8.02 and 2;0.30. The coverage of the grammars is carefully evaluated by extracting grammatical relations from induced structures and comparing them with manually annotated labels.

show abstract

Section: Formal Grammarsmentioning

confidence: 99%

Formal Grammars of Early Language

Wintner

Lavie

MacWhinney

2009

Languages: From Formal to Natural

View full text Add to dashboard Cite

show abstract

Highly Constrained Unification Grammars

Feinstein

Wintner

2008

J of Log Lang and Inf

View full text Add to dashboard Cite

Highly constrained unification grammars

Feinstein

Wintner

2006

Proceedings of the 21st International Conference on Computational Linguistics and the 44th Annual Meeting of the ACL - ACL '06

View full text Add to dashboard Cite

Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, offline parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity. We first show that non-reentrant unification grammars generate exactly the class of contextfree languages. We then relax the constraint and show that one-reentrant unification grammars generate exactly the class of tree-adjoining languages. We thus relate the commonly used and linguistically motivated formalism of unification grammars to more restricted, computationally tractable classes of languages.

show abstract

Unification: Computational Issues

Cited by 3 publications

References 16 publications

Formal Grammars of Early Language

Formal Grammars of Early Language

Highly Constrained Unification Grammars

Highly constrained unification grammars

Contact Info

Product

Resources

About