| { |
| "paper_id": "P93-1015", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T08:52:14.568849Z" |
| }, |
| "title": "Parsing Free Word Order Languages in the Paninian Framework", |
| "authors": [ |
| { |
| "first": "Akshar", |
| "middle": [], |
| "last": "Bharati", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Indian Institute of Technology Kanpur", |
| "location": { |
| "postCode": "208016", |
| "settlement": "Kanpur", |
| "country": "India" |
| } |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Rajeev", |
| "middle": [], |
| "last": "Sangal", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Indian Institute of Technology Kanpur", |
| "location": { |
| "postCode": "208016", |
| "settlement": "Kanpur", |
| "country": "India" |
| } |
| }, |
| "email": "sangal@iitk.ernet.in" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more efficient. Second, such a formalism is also likely to be linguistically more elegant and satisfying. In this paper, we describe such a formalism, called the Paninian framework, that has been successfully applied to Indian languages. This paper shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between surface form (vibhakti) and semantic (karaka) roles. The mapping is elegant and compact. The same basic account also explains active-passives and complex sentences. This suggests that the solution is not just adhoc but has a deeper underlying unity. A constraint based parser is described for the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems. It is interesting to observe that such a parser (designed for free word order languages) compares well in asymptotic time complexity with the parser for context free grammars (CFGs) which are basically designed for positional languages.", |
| "pdf_parse": { |
| "paper_id": "P93-1015", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more efficient. Second, such a formalism is also likely to be linguistically more elegant and satisfying. In this paper, we describe such a formalism, called the Paninian framework, that has been successfully applied to Indian languages. This paper shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between surface form (vibhakti) and semantic (karaka) roles. The mapping is elegant and compact. The same basic account also explains active-passives and complex sentences. This suggests that the solution is not just adhoc but has a deeper underlying unity. A constraint based parser is described for the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems. It is interesting to observe that such a parser (designed for free word order languages) compares well in asymptotic time complexity with the parser for context free grammars (CFGs) which are basically designed for positional languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "A majority of human languages including Indian and other languages have relatively free word order. tn free word order languages, order of words contains only secondary information such as emphasis etc. Primary information relating to 'gross' meaning (e.g., one that includes semantic relationships) is contained elsewhere. Most existing computational grammars are based on context free grammars which are basically positional grammars. It is important to develop a suitable computational grammar formalism for free word order languages for two reasons:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "1. A suitably designed formalism will be more efficient because it will be able to make use of primary sources of information directly.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "2. Such a formalism is also likely to be linguistically more elegant and satisfying. Since it will be able to relate to primary sources of information, the grammar is likely to be more economical and easier to write.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In this paper, we describe such a formalism, called the Paninian framework, that has been successfully applied to Indian languages. 1 It uses the notion of karaka relations between verbs and nouns in a sentence. The notion of karaka relations is central to the Paninian model. The karaka relations are syntactico-semantic (or semantico-syntactic) relations between the verbals and other related constituents in a sentence. They by themselves do not give the semantics. Instead they specify relations which mediate between vibhakti of nominals and verb forms on one hand and semantic relations on the other (Kiparsky, 1982) (Cardona (1976 (Cardona ( ), (1988 ). See Fig. 1 . Two of the important karakas are karta karaka and karma karaka. Frequently, the karta karaka maps to agent theta role, and the karma to theme or goal theta role. Here we will not argue for the linguistic significance of karaka relations and differences with theta relations, as that has been done elsewhere (Bharati et al. (1990) and (1992)). In summary, karta karaka is that participant in the action that is most independent. At times, it turns out to be the agent. But that need not be so. Thus, 'boy' and 'key' are respectively the karta karakas in the following sentences 1The Paninian framework was originally designed more than two millennia ago for writing a grammar of Sanskrit; it has been adapted by us to deal with modern Indian languages. The boy opened the lock. The key opened the lock.", |
| "cite_spans": [ |
| { |
| "start": 606, |
| "end": 622, |
| "text": "(Kiparsky, 1982)", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 623, |
| "end": 637, |
| "text": "(Cardona (1976", |
| "ref_id": null |
| }, |
| { |
| "start": 638, |
| "end": 657, |
| "text": "(Cardona ( ), (1988", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 981, |
| "end": 1003, |
| "text": "(Bharati et al. (1990)", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 665, |
| "end": 671, |
| "text": "Fig. 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Note that in the first sentence, the karta (boy) maps to agent theta role, while in the second, karta (key) maps to instrument theta role. As part of this framework, a mapping is specified between karaka relations and vibhakti (which covers A. 2 collectively case endings, post-positional markers, etc.). This mapping between karakas and vibhakti depends on the verb and its tense aspect modality (TAM) label. The mapping is represented by two structures: default karaka charts and karaka chart transformations. The default karaka chart for a verb or a class of verbs gives the mapping for the TAM label tA_hE called basic. It specifies the vibhakti permitted for the applicable karaka relations for a verb when the verb has the basic TAM label. This basic TAM label roughly corresponds to present indefinite tense and is purely syntactic in nature. For other B. 1 TAM labels there are karaka chart transformation rules. Thus, for a given verb with some TAM label, appropriate karaka chart can be obtained using its basic karaka chart and the transformation rule B.2 depending on its TAM label. 2", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In Hindi for instance, the basic TAM label is tA_hE (which roughly stands for the present indefinite). The default karaka chart for three of the B.3 karakas is given in Fig. 2 . This explains the vibhaktis in sentences A.1 to A.2. In A.1 and A.2, 'Ram' is karta and 'Mohan' is karma, because of their vibhakti markers \u00a2 and ko, respectively. 3 (Note that B.4 'rAma' is followed by \u00a2 or empty postposition, and 'mohana' by 'ko' postposition.)", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 169, |
| "end": 175, |
| "text": "Fig. 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "A.I rAma mohana ko pltatA hE.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "2The transformation rules are a device to represent the karaka charts more compactly. However, as is obvious, they affect the karaka charts and not the parse structure. Therefore, they are different from transformational granmlars. Formally, these rules can be eliminated by having separate karaka charts for each TAM label. But one would miss the liguistic generalization of relating the karaka charts based on TAM labels in a systematic manner.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "3In the present examples karta and karma tm'n out to be agent and theme, respectively. Fig. 3 gives some transformation rules for the default mapping for Hindi. It explains the vibhakti in sentences B.1 to B.4, where Ram is the karta but has different vibhaktis, \u00a2, he, ko, se, respectively. In each of the sentences, if we transform the karaka chart of Fig.2 by the transformation rules of Fig.3 , we get the desired vibhakti for the karta Ram. In general, the transformations affect not only the vibhakti of karta but also that of other karakas. They also 'delete' karaka roles at times, that is, the 'deleted' karaka roles must not occur in the sentence.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 87, |
| "end": 93, |
| "text": "Fig. 3", |
| "ref_id": null |
| }, |
| { |
| "start": 354, |
| "end": 359, |
| "text": "Fig.2", |
| "ref_id": null |
| }, |
| { |
| "start": 391, |
| "end": 396, |
| "text": "Fig.3", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The Paninian framework is similar to the broad class of case based grammars. What distinguishes the Paninian framework is the use of karaka relations rather than theta roles, and the neat dependence of the karaka vibhakti mapping on TAMs and the transformation rules, in case of Indian languages. The same principle also solves the problem of karaka assignment for complex sentences (Discussed later in Sec. 3.)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The Paninian theory outlined above can be used for building a parser. First stage of the parser takes care of morphology. For each word in the input sentence, a dictionary or a lexicon is looked up, and associated grammatical information is retrieved. In the next stage local word grouping takes place, in which based on local information certain words are grouped together yielding noun groups and verb groups. These are the word groups at the vibhakti level (i.e., typically each word group is a noun or verb with its vibhakti, TAM label, etc.). These involve grouping post-positional markers with nouns, auxiliaries with main verbs etc. Rules for local word grouping are given by finite state machines. Finally, the karaka relations among the elements are identified in the last stage called the core parser.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Morphological analyzer and local word grouper have been described elsewhere (Bharati et al., 1991 ). Here we discuss the core parser. Given the local word groups in a sentence, the task of the core parser is two-fold: 1. To identify karaka relations among word groups, and 2. To identify senses of words.", |
| "cite_spans": [ |
| { |
| "start": 76, |
| "end": 97, |
| "text": "(Bharati et al., 1991", |
| "ref_id": "BIBREF3" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The first task requires karaka charts and transformation rules. The second task requires lakshan charts for nouns and verbs (explained at the end of the section). A data structure corresponding to karaka chart stores information about karaka-vibhakti mapping including optionality of karakas. Initially, the default karaka chart is loaded into it for a given verb group in the sentence. Transformations are performed based on the TAM label. There is a separate data structure for the karaka chart for each verb group in the sentence being processed. Each row is called a karaka restriclion in a karaka chart.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "For a given sentence after the word groups have been formed, karaka charts for the verb groups are created and each of the noun groups is tested against the karaka restrictions in each karaka chart. When testing a noun group against a karaka restriction of a verb group, vibhakti information is checked, and if found satisfactory, the noun group becomes a candidate for the karaka of the verb group.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The above can be shown in the form of a constraint graph. Nodes of the graph are the word groups and there is an arc labeled by a karaka from a verb group to a noun group, if the noun group satisfies the karaka restriction in the karaka chart of the verb group. (There is an arc from one verb group to another, if the karaka chart of the former shows that it takes a sentential or verbal karaka.)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The verb groups are called demand groups as they make demands about their karakas, and the noun groups are called source groups because they satisfy demands.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "As an example, consider a sentence containing the verb KA (eat):", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "baccA hATa se kelA KAtA hE. child hand -se banana eats (The child eats the banana with his hand.)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Its word groups are marked and KA (eat) has the same karaka chart as in Fig. 2 . Its constraint graph is shown in Fig. 4 .", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 72, |
| "end": 78, |
| "text": "Fig. 2", |
| "ref_id": null |
| }, |
| { |
| "start": 114, |
| "end": 120, |
| "text": "Fig. 4", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "A parse is a sub-graph of the constraint graph satisfying the following conditions:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "1. For each of the mandatory karakas in a karaka chart for each demand group, there should be exactly one out-going edge from the demand group labeled by the karaka.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "2. For each of the optional karakas in a karaka chart for each demand group, there should be at most one outgoing edge from the demand group labeled by the karaka.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "3. There should be exactly one incoming arc into each source group.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "If several sub-graphs of a constraint graph satisfy the above conditions, it means that there are multiple parses and the sentence is ambiguous. If no subgraph satisfies the above constraints, the sentence does not have a parse, and is probably ill-formed.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "There are similarities with dependency grammars here because such constraint graphs are also produced by dependency grammars (Covington, 1990 ) (Kashket, 1986) .", |
| "cite_spans": [ |
| { |
| "start": 125, |
| "end": 141, |
| "text": "(Covington, 1990", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 144, |
| "end": 159, |
| "text": "(Kashket, 1986)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "It differs from them in two ways. First, the Paninian framework uses the linguistic insight regarding karaka relations to identify relations between constituents in a sentence. Second, the constraints are sufficiently restricted that they reduce to well known bipartite graph matching problems for which efficient solutions are known. We discuss the latter aspect next.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "If karaka charts contain only mandatory karakas, the constraint solver can be reduced to finding a matching in a bipartite graph. 4 Here is what needs to be done for a given sentence. (Perraju, 1992) . For every source word group create a node belonging to a set U; for every karaka in the karaka chart of every verb group, create a node belonging to set V; and for every edge in the constraint graph, create an edge in E from a node in V to a node in U as follows: if there is an edge labeled in karaka k in the constraint graph from a demand node d to a source node s, create an edge in E in the bipartite graph from the node corresponding to (d, k) in V to the node corresponding to s in U. The original problem of finding a solution parse in the constraint graph now reduces to finding a complete matching in the bipartite graph {U,V,E} that covers all the nodes in U and V. 5 It has several known efficient algorithms. The time complexity of augmenting path algorithm is O (rain (IV], [U]). ]ED which in the worst case is O(n 3) where n is the number of word groups in the sentence being parsed. (See Papadimitrou et al. (1982 Papadimitrou et al. ( ), ihuja et al. (1993 .) The fastest known algorithm has asymptotic cornof O problem (Hopcroft and Sarp (1973) ).", |
| "cite_spans": [ |
| { |
| "start": 184, |
| "end": 199, |
| "text": "(Perraju, 1992)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 1106, |
| "end": 1131, |
| "text": "Papadimitrou et al. (1982", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 1132, |
| "end": 1175, |
| "text": "Papadimitrou et al. ( ), ihuja et al. (1993", |
| "ref_id": null |
| }, |
| { |
| "start": 1239, |
| "end": 1264, |
| "text": "(Hopcroft and Sarp (1973)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "If we permit optional karakas, the problem still has an efficient solution. It now reduces to finding a matching which has the maximal weight in the weighted matching problem. To perform the reduction, we need to form a weighted bipartite graph. We first form a bipartite graph exactly as before. Next the edges are weighted by assigning a weight of 1 if the edge is from a node in V representing a mandatory karaka and 0 if optional karaka. The problem now is to find the largest maximal matching (or assignment) that has the maximum weight (called the maximum bipartite matching problem or assignment problem). The resulting matching represents a valid parse if the matching covers all nodes in U and covers those nodes in V that are for mandatory karakas. (The maximal weight condition en-4 We are indebted to Sonmath Biswas for suggesting the connection.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "5A matching in a bipartite graph {U,V,E)is a subgraph with a subset of E such that no two edges are adjacent. A complete matching is also a largest maximal matching (Deo, 197\"4) .", |
| "cite_spans": [ |
| { |
| "start": 165, |
| "end": 170, |
| "text": "(Deo,", |
| "ref_id": null |
| }, |
| { |
| "start": 171, |
| "end": 177, |
| "text": "197\"4)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "sures that all edges from nodes in V representing mandatory karakas are selected first, if possible.) This problem has a known solution by the Hungarian method of time complexity O(n 3) arithmetic operations (Kuhn, 1955) .", |
| "cite_spans": [ |
| { |
| "start": 208, |
| "end": 220, |
| "text": "(Kuhn, 1955)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Note that in the above theory we have made the following assumptions: (a) Each word group is uniquely identifiable before the core parser executes, (b) Each demand word has only one karaka chart, and (c) There are no ambiguities between source word and demand word. Empirical data for Indian languages shows that, conditions (a) and (b) hold. Condition (c), however, does not always hold for certain Indian languages, as shown by a corpus. Even though there are many exceptions for this condition, they still produce only a small number of such ambiguities or clashes. Therefore, for each possible demand group and source group clash, a new constraint graph can be produced and solved, leaving the polynomial time complexity unchanged.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The core parser also disambiguates word senses. This requires the preparation of lakshan charts (or discrimination nets) for nouns and verbs. A lakshan chart for a verb allows us to identify the sense of the verb in a sentence given its parse. Lakshan charts make use of the karakas of the verb in the sentence, for determining the verb sense. Similarly for the nouns. It should be noted (without discussion) that (a) disambiguation of senses is done only after karaka assignment is over, and (b) only those senses are disambiguated which are necessary for translation", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The key point here is that since sense disambiguation is done separately after the karaka assignment is over it leads to an efficient system. If this were not done the parsing problem would be NP-complete (as shown by Barton et al. (1987) if agreement and sense ambiguity interact, they make the problem NP-complete).", |
| "cite_spans": [ |
| { |
| "start": 218, |
| "end": 238, |
| "text": "Barton et al. (1987)", |
| "ref_id": "BIBREF1" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Constraint Based Parsing", |
| "sec_num": "2" |
| }, |
| { |
| "text": "This theory captures the linguistic intuition that in free word order languages, vibhakti (case endings or post-positions etc.) plays a key role in determining karaka roles. To show that the above, though neat, is not just an adhoc mechanism that explains the isolated phenomena of semantic roles mapping to vibhaktis, we discuss two other phenomena: activepassive and control. No separate theory is needed to explain activepassives. Active and passive turn out to be special cases of certain TAM labels, namely those used to mark active and passive. Again consider for example in Hindi. Verb in F.2 has TAM label as yA_gayA. Consequently, the vibhakti 'dvArA' for karta (Ram) follows from the transformation already given earlier in Fig. 3 .", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 734, |
| "end": 740, |
| "text": "Fig. 3", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Active-Passives and Complex Sentences", |
| "sec_num": "3" |
| }, |
| { |
| "text": "A major support for the theory comes from complex sentences, that is, sentences containing more than one verb group. We first introduce the problem and then describe how the theory provides an answer. Consider the ttindi sentences G.1, G.2 and G.3.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Active-Passives and Complex Sentences", |
| "sec_num": "3" |
| }, |
| { |
| "text": "In G.1, Ram is the karta of both the verbs: KA (eat) and bulA (call). However, it occurs only once. The problem is to identify which verb will control its vibhakti. In G.2, karta Ram and the karma Pala (fruit) both are shared by the two verbs kAta (cut) and KA (eat). In G.3, the karta 'usa' (he) is shared between the two verbs, and 'cAkU' (knife) the karma karaka of 'le' (take) is the karana (instrumental) karaka of 'kAta' (cut). The observation that the matrix verb, i.e., main verb rather than the intermediate verb controls the vibhakti of the shared nominal is true in the above sentences, as explained below. The theory we will outline to elaborate on this theme will have two parts. The first part gives the karaka to vibhakti mapping as usual, the second part identifies shared karakas.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Active-Passives and Complex Sentences", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The first part is in terms of the karaka vibhakti mapping described earlier. Because the intermediate verbs have their own TAM labels, they are handled by exactly the same mechanism. For example, kara is the TAM label 6 of the intermediate verb groups in G.1 and G.2 (KA (eat) in G.1 and kAta (cut) in G.2), and nA 7 is the TAM label 6,kara, TAM label roughly means 'having completed the activity'. But note that TAM labels are purely syntactic, hence the meaning is not required by the system.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "G.I rAma Pala", |
| "sec_num": null |
| }, |
| { |
| "text": "ZThis is the verbal noun. As usual, these TAM labels have transformation rules that operate and modify the default karaka chart. In particular, the transformation rules for the two TAM labels (kara and nA) are given in Fig. 5 . The transformation rule with kara in Fig. 5 says that karta of the verb with TAM label kara must not be present in the sentence and the karma is optionally present.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 219, |
| "end": 225, |
| "text": "Fig. 5", |
| "ref_id": "FIGREF3" |
| }, |
| { |
| "start": 265, |
| "end": 271, |
| "text": "Fig. 5", |
| "ref_id": "FIGREF3" |
| } |
| ], |
| "eq_spans": [], |
| "section": "G.I rAma Pala", |
| "sec_num": null |
| }, |
| { |
| "text": "By these rules, the intermediate verb KA (eat) in G.1 and kAta (cut) in G.2 do not have (independent) karta karaka present in the sentence. Ram is the karta of the main verb. Pala (fruit) is the karma of the intermediate verb (KA) in G.1 but not in G.2 (kAta). In the latter, Pala is the karma of the main verb. All these are accommodated by the above transformation rule for 'kara'. The tree structures produced are shown in Fig. 6 (ignore dotted lines for now) where a child node of a parent expresses a karaka relation or a verb-verb relation.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 426, |
| "end": 432, |
| "text": "Fig. 6", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "G.I rAma Pala", |
| "sec_num": null |
| }, |
| { |
| "text": "In the second part, there are rules for obtaining the shared karakas. Karta of the intermediate verb KA in G.1 can be obtained by a sharing rule of the kind given by S1.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "G.I rAma Pala", |
| "sec_num": null |
| }, |
| { |
| "text": "Rule SI: Karta of a verb with TAM label 'kara' is the same as the karta of the verb it modifies s.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "G.I rAma Pala", |
| "sec_num": null |
| }, |
| { |
| "text": "The sharing rule(s) are applied after the tentative karaka assignment (using karaka to vibhakti mapping) is over. The shared karakas are shown by dotted lines in Fig. 6 .", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 162, |
| "end": 168, |
| "text": "Fig. 6", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "G.I rAma Pala", |
| "sec_num": null |
| }, |
| { |
| "text": "In summary, this paper makes several contributions:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "\u2022 It shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between vibhakti and karaka roles. The mapping is elegant and compact.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "8The modified verb in the present sentences is the main verb. \u2022 karana (knife) Fig. 6 : Modifier-modified relations for sentences G.1, G.2 and G.3,respectively. (Shared karakas shown by dotted lines.)", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 79, |
| "end": 85, |
| "text": "Fig. 6", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "\u2022 The same basic account also explains activepassives and complex sentences in these languages. This suggest that the solution is not just adhoc but has a deeper underlying unity.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "\u2022 It shows how a constraint based parser can be built using the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "It is interesting to observe that such a parser (designed for free word order languages) compares well in asymptotic time complexity with the parser for context free grammars (CFGs) which are basically designed for positional languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "A parser for Indian languages based on the Paninian theory is operational as part of a machine translation system.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| }, |
| { |
| "text": "As part of our future work, we plan to apply this framework to other free word order languages (i.e., other than the Indian languages). This theory can also be attempted on positional languages such as English. What is needed is the concept of generalized vibhakti in which position of a word gets incoporated in vibhakti. Thus, for a pure free word order language, the generalized vibhakti contains preor post-positional markers, whereas for a pure positional language it contains position information of a word (group). Clearly, for most natural languages, generalized vibhakti would contain information pertaining to both markers and position.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion and future work", |
| "sec_num": "4" |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "Vineet Chaitanya is the principal source of ideas in this paper, who really should be a co-author. We gratefully acknowledge the help received from K.V. Ramakrishnamacharyulu of Rashtriya Sanskrit Sansthan, Tirupati in development of the theory. For complexity results, we acknowledge the contributions of B. Perraju, Somnath Biswas and Ravindra K. Ahuja.Support for this and related work comes from the following agencies of Government of India: Ministry of Human Resource Development, Department of Electronics, and Department of Science and Technology.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgement", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Network Flows: Theory, Algorithms and Applications", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "K" |
| ], |
| "last": "Ahuja", |
| "suffix": "" |
| }, |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Thomas", |
| "suffix": "" |
| }, |
| { |
| "first": "James", |
| "middle": [ |
| "B" |
| ], |
| "last": "Magnanti", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Orlin", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ahuja, R.K., Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, 1993 (forth- coming).", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Computational Complexity and Natural Language", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Barton", |
| "suffix": "" |
| }, |
| { |
| "first": "Robert", |
| "middle": [ |
| "C" |
| ], |
| "last": "Edward", |
| "suffix": "" |
| }, |
| { |
| "first": "Eric", |
| "middle": [ |
| "S" |
| ], |
| "last": "Berwick", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ristad", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Barton, G. Edward, Robert C. Berwick, and Eric S. Ristad, Computational Complexity and Nat- ural Language, MIT Press, Cambridge, MA, 1987.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "A Computational Grammar for Indian Languages Processing", |
| "authors": [ |
| { |
| "first": "Akshar", |
| "middle": [], |
| "last": "Bharati", |
| "suffix": "" |
| }, |
| { |
| "first": "Vineet", |
| "middle": [], |
| "last": "Chaitanya", |
| "suffix": "" |
| }, |
| { |
| "first": "Rajeev", |
| "middle": [], |
| "last": "Sangal", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Journal of Indian Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bharati, Akshar, Vineet Chaitanya, and Rajeev Sangal, A Computational Grammar for Indian Languages Processing, Journal of Indian Lin- guistics, IL-51. (Also available as TRCS-90-96, Dept. of CSE, IIT Kanpur, 1990.)", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Local Word Grouping and Its Relevance to Indian Languages", |
| "authors": [ |
| { |
| "first": "Akshar", |
| "middle": [], |
| "last": "Bharati", |
| "suffix": "" |
| }, |
| { |
| "first": "Vineet", |
| "middle": [], |
| "last": "Chaitanya", |
| "suffix": "" |
| }, |
| { |
| "first": "Rajeev", |
| "middle": [], |
| "last": "Sangal", |
| "suffix": "" |
| } |
| ], |
| "year": 1991, |
| "venue": "Frontiers in Knowledge Based Computing (KBCS90)", |
| "volume": "", |
| "issue": "", |
| "pages": "277--296", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bharati, Akshar, Vineet Chaitanya, and Rajeev Sangal, Local Word Grouping and Its Rel- evance to Indian Languages, in Frontiers in Knowledge Based Computing (KBCS90), V.P. Bhatkar and K.M. Rege (eds.), Narosa Publish- ing House, New Delhi, 1991, pp. 277-296.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "An NLP Viewpoint, Part of NLP tutorial for CPAL-2: UNESCO 2nd Regional Workshop on Computer Processing of Asian Languages", |
| "authors": [ |
| { |
| "first": "Akshar", |
| "middle": [], |
| "last": "Bharati", |
| "suffix": "" |
| }, |
| { |
| "first": "Vineet", |
| "middle": [], |
| "last": "Chaitanya", |
| "suffix": "" |
| }, |
| { |
| "first": "Rajeev", |
| "middle": [], |
| "last": "Sangal", |
| "suffix": "" |
| }, |
| { |
| "first": "G", |
| "middle": [ |
| "B" |
| ], |
| "last": "Lfg", |
| "suffix": "" |
| }, |
| { |
| "first": "Paninian", |
| "middle": [], |
| "last": "Frameworks", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "12--16", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bharati, Akshar, Vineet Chaitanya, and Rajeev Sangal, LFG, GB, and Paninian Frameworks: An NLP Viewpoint, Part of NLP tutorial for CPAL-2: UNESCO 2nd Regional Workshop on Computer Processing of Asian Languages, 12- 16 March 1992, I.I.T. Kanpur. (Also available as TRCS-92-140, Dept. of CSE, IIT Kanpur.)", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "His Work and Its Tradition", |
| "authors": [ |
| { |
| "first": "George", |
| "middle": [], |
| "last": "Cardona", |
| "suffix": "" |
| }, |
| { |
| "first": "Panini", |
| "middle": [], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": 1988, |
| "venue": "", |
| "volume": "1", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Cardona, George, Panini: His Work and Its Tra- dition (Vol. 1: Background and Introduction), Motilal Banarsidas, Delhi, 1988.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Parsing Discontinuous Constituents in Dependency Grammar (Technical Correspondence)", |
| "authors": [ |
| { |
| "first": "Michael", |
| "middle": [ |
| "A" |
| ], |
| "last": "Covington", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Computational Linguistics", |
| "volume": "16", |
| "issue": "4", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Covington, Michael A., Parsing Discontinuous Constituents in Dependency Grammar (Tech- nical Correspondence), Computational Lin- guistics, 16,4 (Dec. 1990), p.234.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "A n 5/2 Algorithm for Maximum Matching in Bipartite Graphs", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [ |
| "E" |
| ], |
| "last": "Hopcroft", |
| "suffix": "" |
| }, |
| { |
| "first": "R", |
| "middle": [ |
| "M" |
| ], |
| "last": "Karp", |
| "suffix": "" |
| } |
| ], |
| "year": 1973, |
| "venue": "J. SIAM Comp", |
| "volume": "2", |
| "issue": "", |
| "pages": "225--231", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hopcroft, J.E. and R.M. Karp, \"A n 5/2 Algorithm for Maximum Matching in Bipartite Graphs,\" J. SIAM Comp. 2 (1973), pp.225-231.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Parsing a free-word-order language: Warlpiri", |
| "authors": [ |
| { |
| "first": "Michael", |
| "middle": [ |
| "B" |
| ], |
| "last": "Kashket", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "Proc. of 24th Annual Meeting of ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "60--66", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kashket, Michael B., Parsing a free-word-order language: Warlpiri, Proc. of 24th Annual Meeting of ACL, pp. 60-66.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Some Theoretical Problems in Panini's Grammar, Bhandarkar Oriental Research Institute", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Kiparsky", |
| "suffix": "" |
| } |
| ], |
| "year": 1982, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kiparsky, P., Some Theoretical Problems in Panini's Grammar, Bhandarkar Oriental Re- search Institute, Poona, India, 1982.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "The Hungarian Method for the Assignment Problem", |
| "authors": [ |
| { |
| "first": "H", |
| "middle": [ |
| "W" |
| ], |
| "last": "Kuhn", |
| "suffix": "" |
| } |
| ], |
| "year": 1955, |
| "venue": "Naval Research Logistics Quarterly", |
| "volume": "2", |
| "issue": "", |
| "pages": "83--97", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kuhn, H.W. \"The Hungarian Method for the As- signment Problem\", Naval Research Logistics Quarterly, 2 (1955), pp.83-97.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Combinatorial Optimization", |
| "authors": [ |
| { |
| "first": "Christos", |
| "middle": [ |
| "H" |
| ], |
| "last": "Papadimitrou", |
| "suffix": "" |
| }, |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Steiglitz", |
| "suffix": "" |
| } |
| ], |
| "year": 1982, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Papadimitrou, Christos H., and K. Steiglitz, Com- binatorial Optimization, Prentice-Hall, Engle- wood Cliffs, 1982.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Algorithmic Aspects of Natural Language Parsing using Paninian Framework", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Perraju", |
| "suffix": "" |
| }, |
| { |
| "first": "V", |
| "middle": [ |
| "S" |
| ], |
| "last": "Bendapudi", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Perraju, Bendapudi V.S., Algorithmic Aspects of Natural Language Parsing using Paninian Framework, M.Tech. thesis, Dept. of Com- puter Science and Engineering, I.I.T. Kanpur, Dec. 1992.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "text": "Levels in the Paninian model", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF1": { |
| "text": "Fig. 4: Constraint graph", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF2": { |
| "text": ".I rAma mohana ko pItatA hE. (active) Ram Mohan -ko beat pres. (Ram beats Mohan.) F.2 rAma dvArA mohana ko pItA gayA.(passv.)", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "FIGREF3": { |
| "text": "More transformation rules of the intermediate verb (kAta (cut)) in G.3.", |
| "type_str": "figure", |
| "uris": null, |
| "num": null |
| }, |
| "TABREF3": { |
| "text": "", |
| "type_str": "table", |
| "html": null, |
| "content": "<table><tr><td/><td>)</td></tr><tr><td>G.2 rAma ne Pala kAtakara</td><td>KAyA.</td></tr><tr><td colspan=\"2\">Ram ne fruit having-cut ate</td></tr><tr><td colspan=\"2\">(Ram ate having cut the fruit.)</td></tr><tr><td colspan=\"2\">G.3 Pala kAtane ke liye usane cAkU liyA.</td></tr><tr><td>fruit to-cut for</td><td>he-ne knife took</td></tr><tr><td colspan=\"2\">(To cut fruit, he took a knife.)</td></tr></table>", |
| "num": null |
| } |
| } |
| } |
| } |
