Carroll, J., Nicolov, N., Shaumyan, O., Smets, M., and Weir, D. (1999b). Parsing with an extended domain of locality. In Eighth Conference of the European chapter of the Association for Computational Linguistics (EACL'99), Bergen, Norway. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Shared Semantic Dependency Representations for LTAG - Gerdes, Lopez (2000) (Correct)
....the current derivation (which is possibly exponential in n being the length of the string to parse) But we argue that all phenomena that could not be localized in the elementary tree structure need such a mechanism. For instance, since syntactic dependencies are not localized in classical LTAG [Carroll et al. 1999b] the subject verb agreement need this twostep unification. On the contrary since semantic dependencies are localized in the tree structure of LTAG elementary trees, the predicate argument constraints are fulfilled straightforwardly. Consequently the retrieval of semantic dependency relations ....
Carroll, J., Nicolov, N., Shaumyan, O., Smets, M., and Weir, D. (1999b). Parsing with an extended domain of locality. In Eighth Conference of the European chapter of the Association for Computational Linguistics (EACL'99), Bergen, Norway.
Shared Semantic Dependency Representations for LTAG - Gerdes, Lopez (Correct)
....the current derivation (which is possibly exponential in n being the length of the string to parse) But we argue that all phenomena that could not be localized in the elementary tree structure need such a mechanism. For instance, since syntactic dependencies are not localized in classical LTAG [Carroll et al. 1999b] the subject verb agreement need this twostep uni cation. On the contrary since semantic dependencies are localized in the tree structure of LTAG elementary trees, the predicate argument constraints are ful lled straightforwardly. Consequently the retrieval of semantic dependency relations which ....
Carroll, J., Nicolov, N., Shaumyan, O., Smets, M., and Weir, D. (1999b). Parsing with an extended domain of locality. In Eighth Conference of the European chapter of the Association for Computational Linguistics (EACL'99), Bergen, Norway.
Engineering a Wide-Coverage Lexicalized Grammar - Carroll Nicolov Shaumyan Self-citation (Carroll Nicolov Shaumyan Smets Weir) (Correct)
....between predications being expressed through coindexation. 3. Localization of Syntactic Dependencies The LEXSYS grammar has been designed to localize syntactic dependencies, not only unbounded dependencies between filler and gap, but agreement relations, case and mode of the clause, etc. (Carroll et al. 1999). One immediate advantage is that there is no need for feature percolation during parsing: all syntactic features are grounded during anchoring. There are, however, a few cases where all syntactic features cannot be localized in the same tree. This happens when the values of syntactic features are ....
CARROLL J., NICOLOV N., SHAUMYAN O., SMETS M. & WEIR D. (1999). Parsing with an extended domain of locality. In Proceedings of the Eighth Conference of the European Chapter of the Association for Computational Linguistics, p. 217--224.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC