| { |
| "paper_id": "C86-1014", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T13:14:14.894588Z" |
| }, |
| "title": "PROCESSING WORD ORDER VARIATION WITHIN A MODIFIED ID/LP FRAMEWORK", |
| "authors": [ |
| { |
| "first": "Pradip", |
| "middle": [], |
| "last": "Dey", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "University of Alabama at Birmingham Birmingham~ AL 35294~ U.S.A", |
| "location": {} |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "From a well represented sample of world languages Steele (1978) shows that about 70% of languages exhibit significant word order variation. Only recently has this wlde-spread phenomenon been drawing appropriate attention. Perhaps ID/LP (Immediate Dominance and Linear Precedence) framework is the most debated theories in this area. We point out some difficulties in processing standard ID/LP grammar and present a modified version of the grammar. In the modified version, the right hand side of phrase structure rules is treated as a set or partially ordered set. An instance of the framework is implemented.", |
| "pdf_parse": { |
| "paper_id": "C86-1014", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "From a well represented sample of world languages Steele (1978) shows that about 70% of languages exhibit significant word order variation. Only recently has this wlde-spread phenomenon been drawing appropriate attention. Perhaps ID/LP (Immediate Dominance and Linear Precedence) framework is the most debated theories in this area. We point out some difficulties in processing standard ID/LP grammar and present a modified version of the grammar. In the modified version, the right hand side of phrase structure rules is treated as a set or partially ordered set. An instance of the framework is implemented.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "From a well represented sample of world languages Steele (1978) ~,~hows that about 76~ of the languages exhibit significant word order variation | . Until recently thls widespread phenomenon was not given proper attention in natural language processing. The primary goal of tbis study is to develop eomputatlonally efficient and linguistically adequate strategles for parsing word order variation. The strategies are implemented in a network based parser. At first we characterize the basic problem at an abstract level without going into details of the problem in any specific language (in Section-2). Then~ in Sectlon-3, the details of the problems in a specific language~ namely~ Iilndi~ are presented.", |
| "cite_spans": [ |
| { |
| "start": 50, |
| "end": 63, |
| "text": "Steele (1978)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The Immediate dominance and linear precedence (ID/LP) framework~ developed by Gazdar and Pullum~ is one of the most debated theories in the study of word order variation (Pullum 1982~ Uszkorelt 1082 , Shieber 1983 , Barton 1985 . The basic idea behind ID/LP framework is to separate immediate dominance from linear precedence in rewrite rules. Pullum (1982) expresses this via a metagrammar.", |
| "cite_spans": [ |
| { |
| "start": 170, |
| "end": 198, |
| "text": "(Pullum 1982~ Uszkorelt 1082", |
| "ref_id": null |
| }, |
| { |
| "start": 199, |
| "end": 213, |
| "text": ", Shieber 1983", |
| "ref_id": null |
| }, |
| { |
| "start": 214, |
| "end": 227, |
| "text": ", Barton 1985", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 344, |
| "end": 357, |
| "text": "Pullum (1982)", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The modified version presented in this paper expresses this directly in the object grammar eliminating the need for a metagrammar. It treats the right hand side of a PS (Phrase Structure) rule as a set or partially ordered set. Parsing with this type of rule can proceed by checking set membership.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The word order problem is the problem of processing the whole range of word order variation occurring in natural languages. Some Australian languages such as Warlpiri show extreme word order variation (Hale 1983) . Hindi, Japanese and German also allow considerable word order variation. In this section we develop descriptive formalisms and parsing mechanisms that are adequate for the whole range of word order variation.", |
| "cite_spans": [ |
| { |
| "start": 201, |
| "end": 212, |
| "text": "(Hale 1983)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Word Order Problem in General", |
| "sec_num": "2." |
| }, |
| { |
| "text": "Consider a grammar thdt allows a node labeled S to have daughters labeled $, O, and \u00a5 in any linear order~ and nothing else. Such a grammar can be presented with a set of rules such as that given in (2.1).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Word Order Problem in General", |
| "sec_num": "2." |
| }, |
| { |
| "text": "S--> OV$, S--> V$O, S--> VO$", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.1) S --> $ OV, S --> $VO, S --> 0 SV,", |
| "sec_num": null |
| }, |
| { |
| "text": "The problem with a grammar such as that given in (2.1) is that i~ needs too many rules to capture word order variation (in this case free word order). For 5 'words' such a grammar will need 5! = 120 rules. With the increase in the number of words, such a gralnmar will grow factorially. That is, for a number of words it will need n/ rules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.1) S --> $ OV, S --> $VO, S --> 0 SV,", |
| "sec_num": null |
| }, |
| { |
| "text": "There is a convYnient way of 'collapsing' rules in GPSG (Generalized Phrase Structure Grammar) of Gazder (1981) . It uses metarules that operate on basic rules to generate derived rules which then function as basic rules in derivations. Thus, (2.1) can be abbreviated as (2.2). Within GPSG Pullmn (1982) suggests another solution which also involves a metagrammar, tie suggests that a grammar such as (2.1) can be expressed via a metagrammar that treats immediate dominance and linear precedence separately. Pullum's theory is known as ID/LP analysis 2 According to this theory grammar (2.1) \"would be specified by means of the metagrammar\" given in (2.3). Similarlyj the metagrammar given in (2.4) \"determines\" the grammar shown in (2.5). In (2.3) and (2.4) i ..... diate doml .... e star .... ts are given under a~ and linear precedence statements are given~ under b. In the case of (2.3) however the set of linear precedence statements is empty. In the case of (2.4) $ ( O means 'it\" any rule introduces $ and O, $ linearly precedes O'. An important advantage of ID/LP analysis is that it can account for word order variation in a general way, capturing \"analytical intultion~ often hinted at in the literature, that fixing constituent order \"costs\" in the same way that having special NP case-marking rules or verb agreement rules does\" (Pnllum 1982: 211).", |
| "cite_spans": [ |
| { |
| "start": 98, |
| "end": 111, |
| "text": "Gazder (1981)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.1) S --> $ OV, S --> $VO, S --> 0 SV,", |
| "sec_num": null |
| }, |
| { |
| "text": "The main disadvantage of the standard ID/LP framework is th~:t it is difficult to process (Shieber 1983, Barton 1985) .", |
| "cite_spans": [ |
| { |
| "start": 105, |
| "end": 117, |
| "text": "Barton 1985)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.1) S --> $ OV, S --> $VO, S --> 0 SV,", |
| "sec_num": null |
| }, |
| { |
| "text": "The alternative solution proposed in this study treats the rigbt hand side of a rule as a set3 . Thus~ the grammar in (2.1) can be p ..... ted in this format, eith ....", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.1) S --> $ OV, S --> $VO, S --> 0 SV,", |
| "sec_num": null |
| }, |
| { |
| "text": "(2.6a) or as (2.6b). The latter rule is to be understood under the node admissibility condition.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.1) S --> $ OV, S --> $VO, S --> 0 SV,", |
| "sec_num": null |
| }, |
| { |
| "text": "Since the right hand side of the rule is a se G the order of $~ O and V does not matter. In parsing, this solution has definite advantages. Firstly~ the factorial growth of rules is eliminated. Secondly~ parsing can proceed by checking set membership or set difference. That is, instead of 'ordered match' the parser has to do 'unordered match'. The precise way of doing it will vary from parser to parser. We describe one way of implementing it in the ATN (Augmented Transition Network (Woods 1970, Finln and Hadden 1977)) formalism.", |
| "cite_spans": [ |
| { |
| "start": 487, |
| "end": 509, |
| "text": "(Woods 1970, Finln and", |
| "ref_id": null |
| }, |
| { |
| "start": 510, |
| "end": 523, |
| "text": "Hadden 1977))", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "Consider the ATN fragment presented below in (2.7) for the grammar given in (2.6). Conditions on are are given in . LISP like structures within parenthesis. Thus (null $) means 'if S-reglster is empty'. By the arc WRD $ (null $), the 'word' $ will be accepted if no $ has previously been found. (In natural language, one can assume $ ~ Subject, O ~ Object, V = Verb, and use PUSH arc in place of WRD in the following diagram.) 2.7WRD, (N~LL", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "~ :23 WRDO(NULL_ O) / / WRD V (NULL V) J ~ 4 POP (NOTNULL $)(NOTNULL O)(NOTNULL V)~", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "(2.7) parses any strings generated by (2.1) by scanning the input from left to right and checking the set membership. Thus, in recognition and parsing, (2.7) correctly reflects (2.0). Suppose, the input string is VO$. One way to see how a sentence is parsed is to trace through the analysis of the sentence as are sequence. This string is accepted by the arc sequence (3, 2, 1, 4) . The ATN given in (2.7) can be said to have conditioned multiple loops.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 368, |
| "end": 380, |
| "text": "(3, 2, 1, 4)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "For convenience of reference, we shall refer to ATN structures such as (2.7) as 'set-loops'. Further restrictions on set-loops (such as (2.7)) can be imposed and all constituent order variations can be parsed simply by imposing additional conditions on arcs. Thus, an ATN parser such as (2.8b) can parse the language generated by the grammar given in (2.5). Formally, (2.5) is presented with a partially ordered set such as (2.8a) in the proposed framework. The partial ordering is specified as a constrain after \"/\"~ as in a context-sensitlve rule contexts are specified after \"/''. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "( WRD $ _(NUL____~L ~D O (NULL O)(NOTNULL $) WRD V (NULL V) POP (NOTNULL $)(NOTNULL O)(NOTNULL V~", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "Suppose that $, O, and V are nontermlnals which are further expanded by appropriate rewrite rules. Right hand side of such expansions can also show word order variations as shown in (2.9).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "(2.9) $ --:> {a,b,c}, O --> (d,e}, V --~> {f,g,h} So far, we have described parsing strategies for constituent order variations. However, in natural language we often find a discontinuous constituent. That is, an element can be moved out of its constituent (toplcalization in English would be a good example if VP is a constituent) which can be described by categories with holes (eg. VP/NP). In cases such as this, VIR arcs in combination with hold lists arc used in ATN (Bates 1978) . Alternatively, temporary registers can be used to parse discontinuous constituents. Temporary registers are particularly suitable to handle large number of 'misplaced' words that cannot be handled by usual HOLD lists in combination with VIR arcs. We would llke to apply the general strategies described above to the case of Hindi which shows considerable word order variation.", |
| "cite_spans": [ |
| { |
| "start": 472, |
| "end": 484, |
| "text": "(Bates 1978)", |
| "ref_id": "BIBREF1" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2.a)a. S->($,o,v} b. (5 $'\u00b0'v}", |
| "sec_num": null |
| }, |
| { |
| "text": "In Hindl, the order of the major constituents such as $ (Subject), O (direct Object), I (Indirect object), and V (Verb (+aux)) is free. For example, out of the four constituents present in (3.11.1), we can make twenty four variants of the same senteneep all of which are perfectly good in Hindi as is obvious from (3.11.1-24).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Word Order in Hindi", |
| "sec_num": "3." |
| }, |
| { |
| "text": "(3.11/1. mohan ne raam ko sev dlaa thaa. ($IOV / Mohan ag Ram to apple gave was \"Mohan gave the apple to Ram.\"", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Word Order in Hindi", |
| "sec_num": "3." |
| }, |
| { |
| "text": "2. mohan ne raam ko dlaa thaa sev. ($IVO) 3. mohan ne diaa than raam ko sev. ($VIO) 4. mohan ne diaa than sev raam ko. ($VOI) 24. diaa thaa sev mohan ne raam ko.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 35, |
| "end": 41, |
| "text": "($IVO)", |
| "ref_id": null |
| }, |
| { |
| "start": 119, |
| "end": 125, |
| "text": "($VOI)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Word Order in Hindi", |
| "sec_num": "3." |
| }, |
| { |
| "text": "To capture the freedom of order of $, I, O~ and V in sentences such as (3.11) We can have a rule such as (3.12) in the grammar of Hindl. The V alone can stand as a sentence in Hindi since it is highly inflected (see Kachru 1980) . Hence (3.13) is more appropriate for Hindi where $~ I, and O are given within paratheses to show their optional occurrence. Suppose we are parsing (3.11.1) mohaa nc raam ko sev diaa than \"Mohan gave the apple to Ram\". It is accepted by the arc seq .....", |
| "cite_spans": [ |
| { |
| "start": 216, |
| "end": 228, |
| "text": "Kachru 1980)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(VO$I)", |
| "sec_num": null |
| }, |
| { |
| "text": "(1, 2, 3, 4, 5). The sentence given in (3.11.24) is accepted by the arc sequence (3, 1, 4, 2, 51 . (3.14) captures constituent order variation in Hindl in a general way. However, it is to be noted that sentences such as (3.11.1) have bl-transltive (or double transitive) V. We have to impose more conditions on arc 5, POP, to parse intransitive and transitive sentences. Informally, the conditions are: (1 / If the V is intransitive then the I and O must be empty. (2) If the V is transitive then the I must be empty. We have implemented a large parser of Hindl wlth wide coverage of construction types including relative clauses, interrogatives, passives, dative subjects, compound verbs and gapping which interact with word order variation (see Dey 1982 Dey , 1984 .", |
| "cite_spans": [ |
| { |
| "start": 747, |
| "end": 755, |
| "text": "Dey 1982", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 756, |
| "end": 766, |
| "text": "Dey , 1984", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 72, |
| "end": 105, |
| "text": "sequence (3, 1, 4, 2, 51 . (3.14)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "(VO$I)", |
| "sec_num": null |
| }, |
| { |
| "text": "Word order variation in Hindl is fairly restrictive. Thus, in the sentences of (3.11) the main verb must precede the AUX. (3.15) is unacceptable because it violates this restriction.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(VO$I)", |
| "sec_num": null |
| }, |
| { |
| "text": "(3.15) * thaa dlaa sev mohan ne raam ko. was gave apple Mohan ag Ram to Similarly, (3.16) violates the restrictlon that the case elements must follow the noun (Verma 1970 In the modified ID/LP fl'amework we allow strict order rules such as (3.17b), fr .. .. d ..... I ...... h as (3.14) and partial order rules such as (2.8a). We also allow notions llke subject and object. That means the grammar is an annotated PS grammar. The parsing strategy suggested above for this grammar has an important consequence. It does not recognize VP (thab dominates V, O, I) as a constituent. It advocates a 'flat' structure for sentences as shown in (3.1.8).", |
| "cite_spans": [ |
| { |
| "start": 159, |
| "end": 170, |
| "text": "(Verma 1970", |
| "ref_id": null |
| }, |
| { |
| "start": 255, |
| "end": 286, |
| "text": ".. d ..... I ...... h as (3.14)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(VO$I)", |
| "sec_num": null |
| }, |
| { |
| "text": "( 1 o v mohan ne raam ko sev dl aa \"Mohan gave tbe apple to Ram.\" It should be noted that actual structural representations should be given with mort details. Some parse trees given by the parser are presented below: It is t~o be noted that though case words llke ne and ko often help to identify subjects, objects etc. the parser must use semantic information in order to identify them in sentences mlch as the ones given in (3.21-22) (see Dey 1984 ).", |
| "cite_spans": [ |
| { |
| "start": 441, |
| "end": 449, |
| "text": "Dey 1984", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(3.18) S", |
| "sec_num": null |
| }, |
| { |
| "text": "(3.21.) (parse (mohan anDaa khaataa hat)) Mohan egg eats is \"Mohan eats an egg\" (S (NP-subj (NP (DET nil) (ADJ) (N mohan)) (K-ag nil)) (NP-Ind nil (K-dat nil)) (NP-obj (NP (DET nil) (ADJ) (i anDaa))) (VX: (ADV) (V khaataa (AUX hal))))t Processing word order variation with new techniques within the modified ID/LP framework seems to be revealing. But, it is not eontext\"fl'ee nnlike other ID/LP based parsers. Detailed comparison of II)/LP based parsers is a subject of further research.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(3.18) S", |
| "sec_num": null |
| }, |
| { |
| "text": "Footnotes:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(3.18) S", |
| "sec_num": null |
| }, |
| { |
| "text": "1. I am grateful to A. K. Joshi, A. Kroch, T. Finln, D. Itindle, S. Gambhlr, K. Reilly, D. Kaemmerer, K. Ryan, II. Bullock and the anonymous COLING-86 referees for thelr helpful suggestions and comments.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(3.18) S", |
| "sec_num": null |
| }, |
| { |
| "text": "2. See Uszkoreit (1982) for an implementation of ID/LP framework.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(3.18) S", |
| "sec_num": null |
| }, |
| { |
| "text": "3. The right hand side of a rule should be treated as a restricted set rather than as a pure set. The restriction can bc stated as follows: a membvr of a set can occur only once in the set unless specified otherwise. Thus, though formally the following two sets are equal, under the restrictions imposed they are notequah { $, O, V } =#= { $, O,V, $,V }", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(3.18) S", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "On the Complexity of ID/LP Parsing", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Barton", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "Computational Linguistics", |
| "volume": "11", |
| "issue": "", |
| "pages": "205--218", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Barton, G. ]5. Jr. 1985. \"On the Complexity of ID/LP Parsing\" Computational Linguistics, 11, 205-218", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "The Theory and Practice of Augmented Transition Network gramnlars", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Bates", |
| "suffix": "" |
| } |
| ], |
| "year": 1978, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "191--259", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bates, M. 1978. \"The Theory and Practice of Augmented Transition Network gramnlars\". In L. Bole (ed.) Natural Language Communication with Computers. Spring Verlag, ]]erlin: 191-259.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Computatlonally Efficient and Linguistically Adequate Parsing of Some Natural Language Structures", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Dey", |
| "suffix": "" |
| }, |
| { |
| "first": ";", |
| "middle": [ |
| ". . ." |
| ], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": 1982, |
| "venue": "Presented to 4th South Asian Languages Round Table", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dey, P. ]982. \"A Parser for Hindi\". Presented to 4th South Asian Languages Round Table, Syracuse, 1982. ...... 1984. Computatlonally Efficient and Linguistically Adequate Parsing of Some Natural Language Structures. Ph.D. diss., University of Pennsylvania.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Augmenting ATNs", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Finin", |
| "suffix": "" |
| }, |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Iiadden", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "the Proceedings of the 5th IJCAI", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Finin, T. and G. IIadden ].977. \"Augmenting ATNs\". In the Proceedings of the 5th IJCAI.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Syntactic Restrictions and Discourse Functions of Word Order of Standard tIindl", |
| "authors": [ |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Gambhlr", |
| "suffix": "" |
| } |
| ], |
| "year": 1980, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gambhlr, V. 1980. Syntactic Restrictions and Discourse Functions of Word Order of Standard tIindl. Ph.D. diss., University of Pennsylvania.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Unbounded Dependencies and Coordinatc Stmlcture", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Gazdar", |
| "suffix": "" |
| } |
| ], |
| "year": 1981, |
| "venue": "Linguistic Inquiry", |
| "volume": "12", |
| "issue": "", |
| "pages": "155--184", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gazdar, G. 1981. \"Unbounded Dependencies and Coordinatc Stmlcture\", Linguistic Inquiry 12, 155-184.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Warlpiri and the Grammar of Nonconfigurational Languages", |
| "authors": [ |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Hale", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "Natural Language and Linguistic Theory", |
| "volume": "1", |
| "issue": "", |
| "pages": "5--48", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hale, K. 1983. \"Warlpiri and the Grammar of Non- configurational Languages,\" Natural Language and Linguistic Theory, 1.5-48.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Free Word Order and Phrase Structure Rules", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [ |
| "K" |
| ], |
| "last": "Pullum", |
| "suffix": "" |
| } |
| ], |
| "year": 1982, |
| "venue": "NELS", |
| "volume": "12", |
| "issue": "", |
| "pages": "209--222", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Pullum, G. K. 1982. \"Free Word Order and Phrase Structure Rules,\" NELS, 12, 209-222.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Context-freeness and the Computer Processing of Human Languages", |
| "authors": [], |
| "year": 1983, |
| "venue": "Prec. of the 21st ACL Conference", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": ".... 1983. \"Context-freeness and the Computer Processing of Human Languages,\" Prec. of the 21st ACL Conference.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Direct Parsing of ID/LP Grammars", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Shleber", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "Lingnlstlcs and Philosophy", |
| "volume": "7", |
| "issue": "2", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shleber, S. 1fl83. \"Direct Parsing of ID/LP Grammars,\" Lingnlstlcs and Philosophy 7:2.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Word Order Variation: A Typological Study", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Steele", |
| "suffix": "" |
| } |
| ], |
| "year": 1981, |
| "venue": "Universals of Language", |
| "volume": "4", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Steele, S. 1981. \"Word Order Variation: A Typological Study,\" in J. Greenberg (ed.) Universals of Language, Vol. 4. Stanford, CA: Stanford University Press.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "A Framework for Parsing Partially Free Word Worder", |
| "authors": [ |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Uszkorelt", |
| "suffix": "" |
| } |
| ], |
| "year": 1982, |
| "venue": "Proceedings of the 21st ACL Conference", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Uszkorelt, H. 1982. \"A Framework for Parsing Partially Free Word Worder,\" Proceedings of the 21st ACL Conference.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "The Structure of Noun Phrase in English and Hindi", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [ |
| "K" |
| ], |
| "last": "Verma", |
| "suffix": "" |
| } |
| ], |
| "year": 1971, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Verma, M. K. 1971. The Structure of Noun Phrase in English and Hindi. Delhi: Motilal Banarsldas.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Transition Network Grammars for Natural Language Analysis", |
| "authors": [ |
| { |
| "first": "W", |
| "middle": [ |
| "A" |
| ], |
| "last": "Woods", |
| "suffix": "" |
| } |
| ], |
| "year": 1970, |
| "venue": "Comm. of ACM", |
| "volume": "3", |
| "issue": "", |
| "pages": "591--60", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Woods, W.A. 1970. \"Transition Network Grammars for Natural Language Analysis,\" Comm. of ACM ]3, 591-60{5.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "uris": null, |
| "type_str": "figure", |
| "text": "(2.2) Basic rule: [_~ $ O V] Metarule: [5....X...Y...] =:> [S....y...X...] where X and Y range over $, O, V.", |
| "num": null |
| }, |
| "FIGREF3": { |
| "uris": null, |
| "type_str": "figure", |
| "text": "We have been referring to rules such as (3.13 / as set rules. An ATN fragment, such as (3.14) would be appropriate for (3.13 / .IC PUSH CNULL,I _j / /5 POP (NOTNULL V) f (Assume appropriate subnets for $, I, O, V)", |
| "num": null |
| }, |
| "FIGREF4": { |
| "uris": null, |
| "type_str": "figure", |
| "text": "(3.19) (p ..... (inoh ....... aln k .... dlaa thaa))(S (NP-subj (NP (DEW nil) (ADJ) (N mohan)) (K-ag he)) (NP-ind (NP (DET nil) (ADJ) (N ...... )) (K-dat ko)) (NP-obj (NP (DET nil) (ADJ) (N sev))) (VX (ADV) (V dlaa (AUX thaa))))t(3.20) (parse (diaa thaa sev raam ko mohan ne)) (S (NP-sul,j (NP (DET nil) (ADJ) (i mohan)) (K-ag ne)) (NP-ind (NP (DET nil) (hDJ) (i raam)) (K-dat ko)) (iP-obj (il' (DET nil) (ADJ) (N sev))) (VX (ADV) (V diaa (AUX thaa))))t", |
| "num": null |
| }, |
| "TABREF0": { |
| "num": null, |
| "type_str": "table", |
| "html": null, |
| "content": "<table><tr><td/><td/><td/><td>).</td></tr><tr><td colspan=\"4\">(3.18) * m~ mohan ram ko sev diaa thaa.</td></tr><tr><td/><td colspan=\"3\">ag Mohan Ram to apple gave was</td></tr><tr><td colspan=\"4\">As obvious frmn (3.15-16), all rules of tIindi are not</td></tr><tr><td colspan=\"4\">'set.rules'. Thus, the subject\"NP, $, cannot be expanded by</td></tr><tr><td>(3.17a)(3.17)a.</td><td>{-*e NP, K }</td><td>b.</td><td>[ $ NP K ]</td></tr><tr><td colspan=\"3\">(Assume [NP mohan], [K ne])</td><td/></tr></table>", |
| "text": "; rat] .... w .... th ...... 1 (3.17b)." |
| } |
| } |
| } |
| } |
