DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5 6
Hits 61 – 80 of 110

61
Topics, methods and formalisms in syntax, semantics and pragmatics
Joshi, Aravind K. (Mitarb.); Hobbs, Jerry R. (Mitarb.); Bear, John (Mitarb.)...
In: Linguistica computazionale. - Pisa : Giardini 9-10 (1994), 489-595
BLLDB
Show details
62
Some remarks on the subset principle : commentary
In: Syntactic theory and first language acquisition: cross-linguistic perspectives ; 2. Binding, dependencies, and learnability. - Hillsdale, NJ [u.a.] : Lawrence Erlbaum (1994), 509-513
BLLDB
Show details
63
Korean to English Translation Using Synchronous TAGs ...
BASE
Show details
64
Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing ...
Joshi, Aravind K.; Srinivas, B.. - : arXiv, 1994
BASE
Show details
65
The convergence of mildly context-sensitive grammar formalisms
In: Foundational issues in natural language processing (Cambridge, Mass, 1991), P. 31-82
MPI für Psycholinguistik
Show details
66
Long-distance scrambling and tree adjoining grammars
In: Association for Computational Linguistics / European Chapter. Conference of the European Chapter of the Association for Computational Linguistics. - Menlo Park, Calif. : ACL 5 (1991), 21-26
BLLDB
Show details
67
The convergence of mildly context-sensitive grammar formalisms
In: Foundational issues in natural language processing. - Cambridge, Mass. [u.a.] : The MIT Press (1991), 31-81
BLLDB
Show details
68
Tree-Adjoining Grammars and Lexicalized Grammars
In: Technical Reports (CIS) (1991)
BASE
Show details
69
Unification-Based Tree Adjoining Grammars
In: Technical Reports (CIS) (1991)
BASE
Show details
70
Using Lexicalized Tags for Machine Translation
In: Technical Reports (CIS) (1991)
BASE
Show details
71
Processing crossed and nested dependencies : an automation perspective on the psycholinguistic results
In: Language and cognitive processes. - Abingdon : Routledge, Taylor & Francis Group 5 (1990) 1, 1-27
BLLDB
Show details
72
Phrase structure and intonational phrases : comments on the chapters by Marcus and Steedman
In: Cognitive models of speech processing. - Cambridge, Mass. [u.a.] : The MIT Press (1990), 513-531
BLLDB
Show details
73
Fixed and flexible phrase structure : coordination in tree adjoining grammars
In: Eo hag yeon gu. - Seo ul 26 (1990) 4, 653-662
BLLDB
Show details
74
Using lexicalized tags for machine translation
In: COLING-90. Vol. 3. - Helsinki : Univ. of Helsinki (1990), 1-6
BLLDB
Show details
75
Two Recent Developments in Tree Adjoining Grammars: Semantics and Efficient Processing
In: DTIC (1990)
BASE
Show details
76
Parsing With Lexicalized Tree Adjoining Grammar
In: Technical Reports (CIS) (1990)
BASE
Show details
77
The Convergence of Mildly Context-Sensitive Grammar Formalisms
In: Technical Reports (CIS) (1990)
Abstract: Investigations of classes of grammars that are nontransformational and at the same time highly constrained are of interest both linguistically and mathematically. Context-free grammars (CFG) obviously form such a class. CFGs are not adequate (both weakly and strongly) to characterize some aspects of language structure. Thus how much more power beyond CFG is necessary to describe these phenomena is an important question. Based on certain properties of tree adjoining grammars (TAG) an approximate characterization of class of grammars, mildly context-sensitive grammars (MCSG), has been proposed earlier. In this paper, we have described the relationship between several different grammar formalisms, all of which belong to MCSG. In particular, we have shown that head grammars (HG), combinatory categorial grammars (CCG), and linear indexed grammars (LIG) and TAG are all weakly equivalent. These formalisms are all distinct from each other at least in the following aspects: (a) the formal objects and operations in each formalism, (b) the domain of locality over which dependencies are specified, (c) the degree to which recursion and the domain of dependencies are factored, and (d) the linguistic insights that are captured in the formal objects and operations in each formalism. A deeper understanding of this convergence is obtained by comparing these formalisms at the level of the derivation structures in each formalism. We have described a formalism, the linear context-free rewriting system (LCFR), as a first attempt to capture the closeness of the derivation structures of these formalisms. LCFRs thus make the notion of MCSGs more precise. We have shown that LCFRs are equivalent to muticomponent tree adjoining grammars (MCTAGs), and also briefly discussed some variants of TAGs, lexicalized TAGs, feature structure based TAGs, and TAGs in which local domination and linear precedence are factored TAG(LD/LP).
Keyword: Computer Sciences
URL: https://repository.upenn.edu/cis_reports/539
https://repository.upenn.edu/cgi/viewcontent.cgi?article=1571&context=cis_reports
BASE
Hide details
78
Unification and the new grammatism
Gazdar, Gerald (Mitarb.); Pulman, Steve (Mitarb.); Joshi, Aravind K. (Mitarb.)
In: Theoretical issues in natural language processing. - Hillsdale, N.J. [u.a.] : Erlbaum (1989), 29-54
BLLDB
Show details
79
Processing Crossed and Nested Dependencies: An Automaton Perspective on the Psycholinguistic Results
In: Technical Reports (CIS) (1989)
BASE
Show details
80
Phrase Structure and Intonational Phrases: Comments on the Papers by Marcus and Steedman
In: Technical Reports (CIS) (1989)
BASE
Show details

Page: 1 2 3 4 5 6

Catalogues
11
1
8
0
0
0
2
Bibliographies
50
0
0
1
0
0
0
0
10
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
32
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern