DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5 6 7
Hits 81 – 100 of 137

81
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
82
Korean to English Translation Using Synchronous TAGs ...
BASE
Show details
83
Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing ...
Joshi, Aravind K.; Srinivas, B.. - : arXiv, 1994
BASE
Show details
84
A Formal Look at Dependency Grammars and Phrase-Structure Grammars, with Special Consideration of Word-Order Phenomena ...
Rambow, Owen; Joshi, Aravind. - : arXiv, 1994
BASE
Show details
85
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
86
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
87
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
88
The convergence of mildly context-sensitive grammar formalisms
BASE
Show details
89
Tree-Adjoining Grammars and Lexicalized Grammars
In: Technical Reports (CIS) (1991)
BASE
Show details
90
Unification-Based Tree Adjoining Grammars
In: Technical Reports (CIS) (1991)
Abstract: Many current grammar formalisms used in computational linguistics take a unification-based approach that use structures (called feature structures) containing sets of feature-value pairs. In this paper, we describe a unification-based approach to Tree Adjoining Grammars (TAG). The resulting formalism (UTAG) retains the principle of factoring dependencies and recursion that is fundamental to TAGs. We also extend the definition of UTAG to include the lexicalized approach to TAGs (see [Schabes et al., 1988]). We give some linguistic examples using UTAG and informally discuss the descriptive capacity of UTAG, comparing it with other unificationbased formalisms. Finally, based on the linguistic theory underlying TAGs, we propose some stipulations that can be placed on UTAG grammars. In particular, we stipulate that the feature structures associated with the nodes in an elementary tree are bounded ( there is an analogous stipulation in GPSG). Grammars that satisfy these stipulations are equivalent to TAG. Thus, even with these stipulations, UTAGs have more power than CFG-based unification grammars with the same stipulations.
URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1799&context=cis_reports
https://repository.upenn.edu/cis_reports/762
BASE
Hide details
91
Using Lexicalized Tags for Machine Translation
In: Technical Reports (CIS) (1991)
BASE
Show details
92
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
93
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
94
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
95
Using lexicalized tags for machine translation
In: COLING-90. Vol. 3. - Helsinki : Univ. of Helsinki (1990), 1-6
BLLDB
Show details
96
Two Recent Developments in Tree Adjoining Grammars: Semantics and Efficient Processing
In: DTIC (1990)
BASE
Show details
97
Parsing With Lexicalized Tree Adjoining Grammar
In: Technical Reports (CIS) (1990)
BASE
Show details
98
The Convergence of Mildly Context-Sensitive Grammar Formalisms
In: Technical Reports (CIS) (1990)
BASE
Show details
99
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
100
Processing Crossed and Nested Dependencies: An Automaton Perspective on the Psycholinguistic Results
In: Technical Reports (CIS) (1989)
BASE
Show details

Page: 1 2 3 4 5 6 7

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