| Hoffman, B., The Computational Analysis of The Syntax and Interpretation of Free Word Order in Turkish, Ph.D. Thesis, University of Pennsylvania, 1995. |
....higher than the coverage pre sented in his thesis and we also use a full scale external morphological generator to deal with complex morphological phenomena of agglutinative lexical forms of Turkish, which he has attempted embedding into the sentence gener ator itself. Hoffman, in her thesis (Hoffman, 1995a, Hoffman, 1995b) has used the MultisetCombinatory Categorial Grammar formalism (Hoffman, 1992) an extension of Combinatory Categorial Grammar to handle free word order languages, to develop a generator for Turkish. Her generator also uses relevant features of the information structure of the ....
Beryl Hoffman. 1995a. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in 88
....and the result of a derivation using this rule is shown in figure 6, for the sentence Bill runs. The unary rule of generalised weak permutation [Briscoe 1999] allows a functor category with any number of arguments to combine with its arguments in any order, keeping the direction of the argument. Hoffman [1995] uses a similar system, that is able to handle scrambling elegantly and generate some mildly context sensitive languages. As the arguments in the subcategorisation list are in a sequential order, the generalised weak permutation rule is particularly useful, since it rotates the arguments until ....
Hoffman, B. The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish. PhD dissertation, University of Pennsylvania. 1995.
....verb phrase at any level, e.g. the verb of a matrix clause or the verb of an embedded clause. And v is matched to all of the v[X]nArgs patterns of the verb categories. Since all case marked nouns in Korean occur in front of the verb, we don t need to employ the directional rules introduced by (Hoffman, 1995). We extend the combinatory rules for uncurried functions as follows. The sets indicated by braces in these rules are order free. ffl Forward Application (A ) X= Args [ fYg) Y = X=Args ffl Backward Application (A ) Y Xn(Args [ fYg) XnArgs Using these rules, a verb can apply to its ....
B. Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. Ph.D. thesis, University of Pennsylvania. IRCS Report 95-17.
....inflection as a lexical entry, such as the locative da with the category NP loc nN and semantics x:at 0 x. Fourthly, the same grammar and lexicon can be used for both parsing and generation. Furthermore, CCGs are non transformational grammars that do not posit empty categories or movement rules (Hoffman, 1995). Transformations greatly increase the power of grammar which may affect its computational efficiency. Moreover, CCGs are mildly context sensitive. Shieber (1985) showed that competence grammars for natural language must be more powerful than context free grammars. The class of mildly ....
....which in unbounded dependencies, can carry on indefinitely. 74) Ahmet [Zeynep in kedi ye sut ver dig i ] ni gor du Ahmet.NOM Zeynep GEN.3 cat DAT milk.ACC give SUB POSS.3s ACC2 see TENSE Ahmet saw that Zeynep gave the milk to the cat. Another study of Turkish surface form generation is by Hoffman (1994; 1995). She used Multi set Combinatory Categorial Grammar formalism (Hoffman, 1992) which is an extension of CCGs for free word order languages. The subcategorization information associated with each verb does not specify the order of the arguments in the Multi set CCG. Each verb in the lexicon is ....
[Article contains additional citation context not shown here]
Hoffman, Beryl. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. Ph.D. thesis, University of Pennsylvania.
.... i, 1990) Under suitable formal definitions related to alternative semantics (Rooth, 1985) or structured meanings (Cresswell, 1985) information structural analyses have been successfully applied to generation of contextually appropriate utterances: Prevost, 1995) for English prosody and (Hoffman, 1995) for Turkish word order. In Japanese, particles wa and ga have close association with related aspects of information structure (Kuno, 1973; Uetake, 1992) In such a language, derivation of information structure is necessary to retrieve the context dependent information signaled by these ....
....associated with each word. We will pass over the details of this process, except to note that this is accomplished via morphological 9 The theme rheme status of the verb in (8A) does not seem to be identified by the informal definition of terms in the present form (cf. Vallduv i, 1990; Hoffman, 1995)) 8 categories like u=rhnX for wa. ga in the matrix clause always marks the rheme. However, the extent of the rheme including the ga marked phrase cannot in general be uniquely identified much as in the case of English unmarked theme (Steedman, 1991) This situation is already seen in the ....
[Article contains additional citation context not shown here]
Hoffman, Beryl. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. Ph.D. thesis, University of Pennsylvania.
.... #) #sv## (coordination) ##### (extraction) ###ffi) ###### j #2M (long distance dependency)### ,# # # #j UW # ae #UW # ###9L### ,### (intonation) ### ,#ffi (scrambling) scope #### ae #.#) 8# #9L 4 ) f # f# ##ae,# (stipulation) # ,# #### :L ### ### ffi. #chim # ae #j [14, 9, 13]. ## ffi # ffi # #,# ## ,#### j ### ##,#### ,# # ae ### ### .#) 8# ####### UXae,# j # ## # sw#### ### ffi #ffi # 2L ,# # # #### ae #ae,# #### # # type raising## compositionchim # ahXZ## ###ae # f ffi ###ffi ### ##:L f #j . 2 ## #BO svdfae,#chim fp # # ....
Berryl Hoffman. The computational analysis of the syntax and interpretation of free word order in Turkish. PhD thesis, University of Pennsylvania, 1995.
....simple clauses such as Kim loves Sandy become available, Figure 2 shows the non conventional left branching one. Composition also makes alternative non conventional semantically equivalent (leftbranching) derivations available. This set of GCG rule schemata represents a plausible kernel of UG; Hoffman (1995, 1996) explores the descriptive power of a very similar system, in which P is not required because functor arguments are interpreted as multisets. She demonstrates that this system can handle (long distance) scrambling elegantly and generate some mildly context sensitive languages (e.g. languages ....
Hoffman, B. (1995) The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish, PhD dissertation, University of Pennsylvania.
....same verb, morphemebased grammar modeling is considered as a natural consequence for Korean. In this paper, we try to model Korean through the combinatory categorial grammar[3] with some extensions to cope with the specific characteristics of Korean. Variable categories and set arguments notations[4] are some of the extensions for relatively free word order treatment. To cope with the morphological complexities in Korean, a morpheme graph instead of a morpheme sequence is constructed and used as a parsing input and an incremental technique to parse the morpheme graph at once is developed. To ....
....word to the Korean morpheme, so they suggest us a morpheme based Korean syntax modeling. 3 Korean Combinatory Categorial Grammar(K CCG) In our previous categorial modeling of Korean[1] 2] we tried to model the free word order through the set arguments in functors. As developed later in Hoffman[4], since Korean is a verb final language we have used the same notation SnfNn, Nag for a transitive verb. In this paper, we extend these previous works to model the coordination and case markers more accurately in Korean. 3.1 Type raising using case marker and variable Following Steedman[3] ....
[Article contains additional citation context not shown here]
Beryl Hoffman, "Computational Analysis of the Syntax and Interpretation of Free Word-order in Turkish," Ph.D. thesis, U.Penn. IRCS Report 95-17, 1995.
....as Hajicov a and Sgall (1987,1988) Kuno 4 The terms contribution and cognitive starting point are borrowed from Gussenhoven s description of his [ focus] and [ focus] features respectively (Gussenhoven 1983b, p. 18) The reader should note that (1976) Vallduv i (1990) Prince (1986) and Hoffman (1995), make similar information structural distinctions which are described in detail in Chapter 3. While information structure describes how a single utterance relates to its discourse context, the present research must also be concerned with the overall structure of discourse. That is, we are ....
....by such an approach. Once the high level content generation and mid level sentence planning processing have completed, a surface generation phase must translate the semantic representation into a surface string, as described in work by Gerdeman and Hinrichs (1990) Shieber and Schabes (1991) and Hoffman (1995) among others. The model of tactical generation proposed here and described in Prevost and Steedman (1993a) shares many similarities with the Shieber and Schabes model for Tree Adjoining Grammars (TAGs) particularly in the manner in which the syntactic and semantic representations are tightly ....
[Article contains additional citation context not shown here]
Hoffman, B. (1995). The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish. PhD thesis, University of Pennsylvania, Philadelphia.
....Park, 1995, Park, 1996] The mechanisms independently motivated to cover the wide range of non traditional constituency can also provide an analysis for the NP NP sequences in (1) as follows: I am grateful to Mark Steedman for his numerous suggestions and comments. I would also like to thank Beryl Hoffman, Anoop Sarkar, K. Vijay Shanker, B. Srinivas, David Weir and reviewers of ACL EACL 97 for their comments. The research was supported in part by NSF Grant Nos. IRI95 04372, STC SBR 8920230, ARPA Grant No. N66001 94 C6043, and ARO Grant No. DAAH04 94 G0426. This technical report (IRCS 97 15) is a ....
Beryl Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish.
....for simple clauses such as Kim loves Sandy become available, Figure 2 shows the non conventional left branching one. Composition also makes alternative nonconventional semantically equivalent (left branching) derivations available. This set of GCG rule schemata represents a plausible kernel of UG; Hoffman (1995, 1996) explores the descriptive power of a very similar system, in which P is not required because functor arguments are interpreted as multisets. She demonstrates that this system can handle (long distance) scrambling elegantly and generate some mildly context sensitive languages (e.g. languages ....
Hoffman, B. (1995) The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish, PhD dissertation, University of Pennsylvania.
....Morrill, 1994) Nevertheless, GCG does represent a plausible kernel of UG; 9 Wood (1993) is a general introduction to categorial grammar and possible extensions to the basic theory. The most closely related theories to that presented here are those of Steedman (e.g. 1988, 1996) and especially Hoffman (1995, 1996) 10 Generalized weak permutation (P) is more powerful than the rule sometimes called associativity (e.g. Wood, 1993:37f) which licenses (X Y)n Z ) Xn Z) Y but not (X Y) Z ) X Z) Y, since the latter is also licensed by P. However, P is less powerful than permutation in the extended ....
.... (P(x) C P [the (x) big 0 (bad 0 (P(x) C the 0 (x) big 0 (bad 0 (wolf 0 (x) Figure 3: GCG Derivation for The big bad wolf Hoffman (1995, 1996) explores the descriptive power of a very similar system, in which P is not required because functor arguments are interpreted as multisets. She demonstrates that this system can handle (long distance) scrambling elegantly and generate some mildly context sensitive, though not some MIX, ....
Hoffman, B. (1995) The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish, PhD dissertation, University of Pennsylvania.
....categories needs extending to deal with featural variation, and the rule schemata, especially composition and weak permutation, must be restricted in various parametric ways so that overgeneration is prevented for specific languages. Nevertheless, GCG does represent a plausible kernel of UG; Hoffman (1995, 1996) explores the descriptive power of a very similar system, in which generalized weak permutation is not required because functor arguments are interpreted as multisets. She demonstrates that this system can handle (long distance) scrambling elegantly, and can generate mildly ....
Hoffman, B. (1995) The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish, PhD dissertation, University of Pennsylvania.
....for simple clauses such as Kim loves Sandy become available, Figure 2 shows the non conventional left branching one. Composition also makes alternative nonconventional semantically equivalent (left branching) derivations available. This set of GCG rule schemata represents a plausible kernel of UG; Hoffman (1995, 1996) explores the descriptive power of a very similar system, in which Forward Application: X Y Y ) X y [X(y) y) X(y) Backward Application: Y XnY ) X y [X(y) y) X(y) Forward Composition: X Y Y Z ) X Z y [X(y) z [Y(z) z [X(Y(z) Backward Composition: YnZ XnY ) XnZ z [Y(z) ....
Hoffman, B. (1995) The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish, PhD dissertation, University of Pennsylvania.
.... there are meta tools for constructing computational models from formal descriptions, such as Attribute Logic Engine (ALE) 5] CUF [6] and Typed Feature System (TFS) 15] Tomita s parser for LFG [19] This work is one of the early attempts, together with LFG [10] and Categorial Grammar Models [13, 3] to study Turkish from the perspective of modern linguistic theories. Our motivation was to design a parser based on the principled account of Turkish syntax in the HPSG framework. It makes use of the ALE formalism to model HPSG style definitions. HPSG makes universal claims about human languages. ....
Beril Hoffman. "The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish". PhD thesis, University of Pennsylvania, 1995.
....and second persons) mainly due to the morphological realization of the subject verb (possessor possessed noun) agreement on the verb (possessed noun) In addition, other complements can also be dropped so long as they are recoverable in a given discourse. Consider, for example, the following from Hoffman (1995): 1.11) Fatma Fatma ; kitab n book 3sPoss ACC ara d. search PAST ; Bul ama d. find NEG PAST Fatma searched for (her) book. She) could not find (it) Introduction 9 Kornfilt (1984) notes that the postpositions that bear agreement morphology with their objects (see page 5) also let their ....
....NPs are determined via factors such as word order, stress, the use of an indefinite determiner and or case marking, tense and modality (Dede (1986) Turkish doesn t have a definite article. 3 Bare subject nouns can be either definite or nonreferential depending on the word order and stress (Hoffman (1995)) Sentence initial subjects are usually interpreted as definite, referring to specific discourse entities (cf. 1.13a) In the (non sentence initial) immediately preverbal position, however, subjects are preferably interpreted as nonspecific or nonreferential (cf. 1.13b) 1.13) a. Kopek dog ....
[Article contains additional citation context not shown here]
Hoffman, B. (1995). The computational analysis of the syntax and interpretation of "free" word order in Turkish. Ph.D. thesis, Philadelphia, Pa.
.... into Free Word Order Languages Beryl Hoffman Centre for Cognitive Science University of Edinburgh 2 Buccleuch Place Edinburgh, EH8 9LW, U.K. hoffman cogsci.ed.ac.uk in the Proceedings of COLING 1996 Abstract In this paper, I discuss machine translation of English text into a relatively free word order language, specifically ....
Beryl Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. Ph.D. dissertation. IRCS Tech Report 95-17. Dept. of Computer and Information Science.
.... Order, Information Structure, and Centering in Turkish Beryl Hoffman Dept. of Computer and Information Sciences University of Pennsylvania (hoffman linc.cis.upenn.edu) in Centering in Discourse, eds. Marilyn Walker, Ellen Prince, and Aravind Joshi. Oxford University Press. to appear 1997. 1 Introduction In this paper, I investigate the interaction between ....
Beryl Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. Ph.D. dissertation. IRCS Tech Report 95-17. Dept. of Computer and Information Science. University of Pennsylvania.
No context found.
Hoffman, B., The Computational Analysis of The Syntax and Interpretation of Free Word Order in Turkish, Ph.D. Thesis, University of Pennsylvania, 1995.
No context found.
B. Hoffman, "The Computational Analysis of the Syntax and Interpretation of Free Word Order in Turkish", PhD Dissertation, University of Pennsylvania Institute for Research in Cognitive Science.
No context found.
Beryl Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. PhD thesis, University of Pennsylvania.
No context found.
Beryl Hoffman. 1995. Computational Analysis of the Syntax and Interpretation of Free Word-order in Turkish.
No context found.
Beryl Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish. Ph.D. thesis, University of Pennsylvania.
No context found.
Beryl Hoffman. 1995. The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish.
No context found.
Hoffman, B. (1995) The Computational Analysis of the Syntax and Interpretation of `Free' Word Order in Turkish, PhD dissertation, University of Pennsylvania.
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