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)
BASE
Show 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)
Abstract: The clause-final verbal clusters in Dutch and German (and in general, in West Germanic languages) have been studied extensively in different syntactic theories. Standard Dutch prefers crossed dependencies (between verbs and their arguments) while Standard German prefers nested dependencies. Recently Bach, Brown, and Marslen-Wilson (1986) have investigated the consequences of these differences between Dutch and German for the processing complexity of sentences, containing either crossed or nested dependencies. Stated very simply, their results show that Dutch is 'easier' than German, thus showing that the push-down automaton (PDA) cannot be the universal basis for the human parsing mechanism. They provide an explanation for the inadequacy of PDA in terms of the kinds of partial interpretations the dependencies allow the listener to construct. Motivated by their results and their discussion of these results we introduce a principle of partial interpretation (PPI) and present an automaton, embedded push-down automaton (EPDA), which permits processing of crossed and nested dependencies consistent with PPI. We show that there are appropriate complexity measures (motivated by the discussion in Bach, Brown, and Marslen-Wilson (1986)) according to which the processing of crossed dependencies is easier than the processing of nested dependencies. We also discuss a case of mixed dependencies. This EPDA characterization of the processing of crossed and nested dependencies is significant because EPDAs are known to be exactly equivalent to Tree Adjoining Grammars (TAG), which are also capable of providing a linguistically motivated analysis for the crossed dependencies of Dutch (Kroch and Santorini 1988). This significance is further enhanced by the fact that two other grammatical formalisms, (Head Grammars (Pollard, 1984) and Combinatory Grammars (Steedman, 1987)), also capable of providing analysis for crossed dependencies of Dutch, have been shown recently to be equivalent to TAGS in their generative power. We have also discussed briefly some issues concerning the EPDAs and their associated grammars, and the relationship between these associated grammars and the corresponding 'linguistic' grammars.
URL: https://repository.upenn.edu/cis_reports/586
https://repository.upenn.edu/cgi/viewcontent.cgi?article=1618&context=cis_reports
BASE
Hide 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