Domains of locality

Authors:
Aravind K. Joshi
Affiliations:
Department of Computer and Information Science, Institute for Research in Cognitive Science, Room 555, Moore School, University of Pennsylvania, Philadelphia, PA
Venue:
Data & Knowledge Engineering - Special jubilee issue: DKE 50
Year:
2004

Citing 6
Cited 1

Tree-adjoining grammars

Handbook of formal languages, vol. 3
An Introduction to Formal Languages and Automata

An Introduction to Formal Languages and Automata
A study of tree adjoining grammars

A study of tree adjoining grammars
Sentence planning as description using tree adjoining grammar

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Disambiguation of super parts of speech (or supertags): almost parsing

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A SNoW based supertagger with application to NP chunking

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

A grammar formalism specifies a domain of locality, i.e., a domain over which various dependencies (syntactic and semantic) can be specified. This issue is related to the use of constrained formal/computational systems just adequate for modeling various aspects of language. It leads to some novel ways of describing locality of structures and brings out the relationship between the complexity of description of primitives and local computations over them. In this paper, we will briefly explore the extended domain of locality provided by the Lexicalized Tree-Adjoining Grammar (LTAG) in the context of some linguistic, computational, and statistical properties.