Base_JSON/prefixY/json/Y06/Y06-1041.json

{
    "paper_id": "Y06-1041",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T13:33:59.661323Z"
    },
    "title": "Platform for Full-Syntax Grammar Development Using Meta-grammar Constructs",
    "authors": [
        {
            "first": "Ale\u0161",
            "middle": [],
            "last": "Hor\u00e1k",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Masaryk University",
                "location": {
                    "addrLine": "Brno Botanick\u00e1 68a",
                    "postCode": "602 00",
                    "settlement": "Brno",
                    "country": "Czech Republic"
                }
            },
            "email": ""
        },
        {
            "first": "Vladim\u00edr",
            "middle": [],
            "last": "Kadlec",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Masaryk University",
                "location": {
                    "addrLine": "Brno Botanick\u00e1 68a",
                    "postCode": "602 00",
                    "settlement": "Brno",
                    "country": "Czech Republic"
                }
            },
            "email": "xkadlec@fi.muni.cz"
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "This paper describes a combination of tools necessary for full or deep syntactic parsing of natural language-the syntactic parser synt, the graphical Grammar Development Workbench, GDW and the VerbaLex verb valency lexicon tools. We describe the development of the mentioned tools and how they integrate into one system that allows a team of experts (computational linguists as well as programmers) to cooperate on the development of grammar covering all Czech language phenomena.",
    "pdf_parse": {
        "paper_id": "Y06-1041",
        "_pdf_hash": "",
        "abstract": [
            {
                "text": "This paper describes a combination of tools necessary for full or deep syntactic parsing of natural language-the syntactic parser synt, the graphical Grammar Development Workbench, GDW and the VerbaLex verb valency lexicon tools. We describe the development of the mentioned tools and how they integrate into one system that allows a team of experts (computational linguists as well as programmers) to cooperate on the development of grammar covering all Czech language phenomena.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Abstract",
                "sec_num": null
            }
        ],
        "body_text": [
            {
                "text": "Full parsing of natural language sentences is a complicated task that provides a transition from unstructured text into structural information suitable for all forms of information retrieval. Any kind of higher level language understanding and/or semantic processing must rely on the results of syntactic parsing. The quality of state-of-the-art syntactic parsers [1, 2] is still not completely satisfiable even for analytical languages like English. In case of free-word-order languages like Czech, the situation is even more complicated.",
                "cite_spans": [
                    {
                        "start": 364,
                        "end": 367,
                        "text": "[1,",
                        "ref_id": "BIBREF0"
                    },
                    {
                        "start": 368,
                        "end": 370,
                        "text": "2]",
                        "ref_id": "BIBREF1"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "At the Centre for Natural Language Processing at the Faculty of Informatics, Masaryk University in Brno, a full syntactic parsing system is being developed since 1997. The core of the system, the syntactic parser synt is based on the meta-grammar formalism (e.g. [3] [4] [5] ), which allows to specify complex sentence constituent combination rules in a maintainable way. The composition of the formalism resembles structures in Lexical functional grammars [6] -the meta-grammar rules are expanded within the guidance of combinatorial constructs plus contextual constraints and are supplemented with additional actions and agreement tests.",
                "cite_spans": [
                    {
                        "start": 263,
                        "end": 266,
                        "text": "[3]",
                        "ref_id": "BIBREF2"
                    },
                    {
                        "start": 267,
                        "end": 270,
                        "text": "[4]",
                        "ref_id": "BIBREF3"
                    },
                    {
                        "start": 271,
                        "end": 274,
                        "text": "[5]",
                        "ref_id": "BIBREF4"
                    },
                    {
                        "start": 457,
                        "end": 460,
                        "text": "[6]",
                        "ref_id": "BIBREF5"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "The described full grammar development platform consists of the following components:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "the Czech morphological analyser ajka [7] . This tagger provides non-disambiguated output of plain text words. The ajka tagger covers almost 400.000 Czech word lemmas, which generates over 6 million word forms. the VerbaLex verb valency lexicon tools [8] . The contextual constraints that safeguard the syntactic analysis of free-word order language need extra lexical-semantic information about the sentence constituents. The creation of new verb valency lexicon which contains so called complex valency frames has thus become a part of the grammar development platform. the deep syntactic parser synt, see [9] [10] [11] . The parser development concentrates on high coverage on general corpus sentences (> 90 %). The parser is able to work with several parsing algorithms (GLR parsing, top-down, bottom-up and headdriven chart parsing). The synt parser also introduced a new variant of the headdriven technique, the head-driven dependent dot move [12] algorithm. This parsing technique allows to parse natural language sentences within median time of less than 0.1s/sentence. the user interface for linguists -the Grammar Development Workbench, GDW [13] .",
                "cite_spans": [
                    {
                        "start": 38,
                        "end": 41,
                        "text": "[7]",
                        "ref_id": "BIBREF6"
                    },
                    {
                        "start": 251,
                        "end": 254,
                        "text": "[8]",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 608,
                        "end": 611,
                        "text": "[9]",
                        "ref_id": "BIBREF8"
                    },
                    {
                        "start": 612,
                        "end": 616,
                        "text": "[10]",
                        "ref_id": "BIBREF9"
                    },
                    {
                        "start": 617,
                        "end": 621,
                        "text": "[11]",
                        "ref_id": "BIBREF10"
                    },
                    {
                        "start": 949,
                        "end": 953,
                        "text": "[12]",
                        "ref_id": "BIBREF11"
                    },
                    {
                        "start": 1151,
                        "end": 1155,
                        "text": "[13]",
                        "ref_id": "BIBREF12"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "The parser synt provides a command line interface, which is suitable for all forms of batch processing. However, the grammar development conducted by linguistic experts combines working with synt input parameters (the meta-grammar, the corpus text, parameters guiding the analysis) as well as thorough studying of synt outputs (tagged sentences, syntactic or dependency trees, chart graphs). All these tasks can be solved via GDW.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "In the following sections, we describe the functionality of the parsing platform in more detailed way and demonstrate the cooperation of its components on several examples.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "The grammar development platform includes several tools as described above. The Figure 1 shows, how these tools interact with each other. The Czech morphological analyser ajka and the VerbaLex verb valency lexicon provide lexical information about words or multi-word expressions in an input sentence. The syntactic parser synt uses the data from lexicon and the meta-grammar to create syntactic structures. The Grammar Development Workbench (GDW) is a user interface able to control the parser. Main tasks of linguistic experts working with GDW include running the parser, studying its outputs, edit and test the meta-grammar and also build a tree bank of correct derivation trees used for probability estimations and testing of grammar changes.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 76,
                        "end": 88,
                        "text": "The Figure 1",
                        "ref_id": "FIGREF0"
                    }
                ],
                "eq_spans": [],
                "section": "The System Architecture",
                "sec_num": "2"
            },
            {
                "text": "The lexicon of verb valencies, VerbaLex [14] , was created in 2005. VerbaLex is based on three valuable language resources for Czech, three independent electronic dictionaries of verb valency frames. The first resource, Czech WordNet valency frames dictionary, was created during the Balkanet project and contains semantic roles and links to the Czech WordNet semantic network. The other resource, VALLEX 1.0 [15] , is a lexicon based on the formalism of the Functional Generative Description (FGD) and was developed during the Prague Dependency Treebank (PDT) project [16] . The third source of information for VerbaLex is the syntactic lexicon of verb valencies denoted as BRIEF, which originated at FI MU Brno in 1996 [17] .",
                "cite_spans": [
                    {
                        "start": 40,
                        "end": 44,
                        "text": "[14]",
                        "ref_id": "BIBREF13"
                    },
                    {
                        "start": 409,
                        "end": 413,
                        "text": "[15]",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 569,
                        "end": 573,
                        "text": "[16]",
                        "ref_id": "BIBREF15"
                    },
                    {
                        "start": 721,
                        "end": 725,
                        "text": "[17]",
                        "ref_id": "BIBREF16"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "VerbaLex",
                "sec_num": "3"
            },
            {
                "text": "The resulting lexicon VerbaLex comprehends all the information found in these resources plus additional relevant information such as verb aspect, verb synonymy, types of use and semantic verb classes based on results of the VerbNet project [18] . The information in VerbaLex is organized in the form of complex valency frames (CVF). All the valency information in VerbaLex is specified regarding the particular verb senses, not only the verb lemmata, as it was found in some of the sources. The current work on the lexicon data aims at enlarging the lexicon to the size of about 16.000 Czech verbs. The VerbaLex lexicon displays syntactic dependencies of sentence constituents, their semantic roles and links to the corresponding Czech WordNet classes.",
                "cite_spans": [
                    {
                        "start": 240,
                        "end": 244,
                        "text": "[18]",
                        "ref_id": "BIBREF17"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "VerbaLex",
                "sec_num": "3"
            },
            {
                "text": "An example of such verb frame is presented in the Figure 2 .",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 50,
                        "end": 58,
                        "text": "Figure 2",
                        "ref_id": "FIGREF1"
                    }
                ],
                "eq_spans": [],
                "section": "VerbaLex",
                "sec_num": "3"
            },
            {
                "text": "The meta-grammar concept in the synt system [11] consists of three grammar forms denoted as G1, G2 and G3. Human experts work with the meta-grammar form, which encompasses high-level generative constructs reflecting the meta-level natural language phenomena like word order constraints, and enables to describe the language with a maintainable number of rules. The meta-grammar serves as a base for the second grammar form which comes into existence by expanding the constructs. This grammar consists of context-free rules equipped with feature agreement tests and other contextual actions. The last phase of grammar induction lies in the transformation of the tests into standard rules of the expanded grammar with the actions remaining to guarantee the contextual requirements.",
                "cite_spans": [
                    {
                        "start": 44,
                        "end": 48,
                        "text": "[11]",
                        "ref_id": "BIBREF10"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar",
                "sec_num": "4"
            },
            {
                "text": "Meta-grammar (G1) The meta-grammar consists of global order constraints that safeguard the succession of given terminals, special flags that impose particular restrictions to given non-terminals and terminals on the right hand side (RHS) and of constructs used to generate combinations of rule elements. grammatical case test for particular words and noun groups agreement test of case in prepositional construction agreement test of number and gender for relative pronouns agreement test of case, number and gender for noun groups type checking of logical constructions Expanded Grammar Form (G3) The feature agreement tests can be transformed into context-free rules. For instance in Czech, similar to other Slavic languages, we have 7 grammatical cases (nominative, genitive, dative, accusative, vocative, locative and instrumental), two numbers (singular and plural) and three genders (masculine, feminine and neuter), in which masculine exists in two forms -animate and inanimate. Thus, e.g., we get 56 possible variants for a full agreement between two constituents.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar",
                "sec_num": "4"
            },
            {
                "text": "The Figure 3 illustrates generative construct %list coord case prep in G1, that produces two context-free rules with pruning actions in G2 and fourteen contextfree rules in G3. The grammars are displayed by the GrammarView module, which is part of the Grammar Development Workbench environment, see the Section 6. Fig. 3 . Generative construct %list coord case prep in the grammar G1 and the appropriate (generated) rules and actions in G2 and G3.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 4,
                        "end": 12,
                        "text": "Figure 3",
                        "ref_id": null
                    },
                    {
                        "start": 314,
                        "end": 320,
                        "text": "Fig. 3",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Grammar",
                "sec_num": "4"
            },
            {
                "text": "The number of rules naturally grows in the direction G1 < G2 < G3. The current numbers of rules in the three grammar forms are 253 in G1, 3091 in G2 and 11530 in G3, but the grammar is still being developed and enhanced.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar",
                "sec_num": "4"
            },
            {
                "text": "In the current stage of the meta-grammar development, we have achieved an average of 92.08 % coverage 1 with 83.7 % cases where the correct syntactic tree was present in the result. However, the process of determining the correct tree is still premature.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar",
                "sec_num": "4"
            },
            {
                "text": "The parsing process consists of several stages. Firstly, the packed shared forest [19] is produced by the standard CF parsing algorithm. Then the contextual constraints are applied. Finally, the trees are ordered by an efficient tree rank computation counted over the chart structure and n trees with highest ranks are selected. The order of the last two steps (constraints application and tree rank computation) can be reversed. All functions are implemented as modules that can be modified as needed or even substituted with different implementation. For example, three different parsing algorithms have been implemented. All algorithms use identical internal data structures (Earley's top-down and bottom-up chart parser [19] , our variant of head-driven chart parser [12] and Tomita's GLR [20] ). These implementations produce the same structures, thus applying contextual constraints or selecting n best trees can be shared among them.",
                "cite_spans": [
                    {
                        "start": 82,
                        "end": 86,
                        "text": "[19]",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 724,
                        "end": 728,
                        "text": "[19]",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 771,
                        "end": 775,
                        "text": "[12]",
                        "ref_id": "BIBREF11"
                    },
                    {
                        "start": 793,
                        "end": 797,
                        "text": "[20]",
                        "ref_id": "BIBREF19"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Parser",
                "sec_num": "5"
            },
            {
                "text": "It was shown [21] that parsing is in general case NP-complete problem if grammars are allowed to have agreement features. The pruning constraints in synt are weaker than general feature structures. It allows an efficient implementation with the following properties. A node in the derivation tree has only limited number of values (e.g. the cardinality of the set for noun groups in our system is max. 56 = 7cases \u00d7 2nouns \u00d7 (3 + 1)genders). In synt instead of usual pruning of the original packed share forest, a new forest of values is built during the analysis. The worst case time complexity for one node in the forest of values is therefore 56 \u03b4 , where \u03b4 is the length of the longest right-hand side of grammar rules. Note that this complexity is independent of the input sentence.",
                "cite_spans": [
                    {
                        "start": 13,
                        "end": 17,
                        "text": "[21]",
                        "ref_id": "BIBREF20"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Parser",
                "sec_num": "5"
            },
            {
                "text": "All the above described tools and systems are presented to a user by means of a frontend tool -the Grammar Development Workbench (GDW). Because most of the platform components (synt, ajka, ...) are controlled only from command-line, the GDW graphical user interface has been created to allow users comfortable and well arranged work with the tools.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "GDW has been created by FI MUNI student Radek Vykydal [13] under supervision of Ale\u0161 Hor\u00e1k. The system is still under development and it is now extensively tested by linguists. GDW consists of five modules:",
                "cite_spans": [
                    {
                        "start": 54,
                        "end": 58,
                        "text": "[13]",
                        "ref_id": "BIBREF12"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "-Gsynt -graphical user interface of the synt parser.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "-TreeView -viewer for resulting syntactic trees.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "-ChartView -browser of resulting chart structure.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "-GrammarView -grammar forms viewer.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "-TBAdmin -tree bank creation tool.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "The linguistic work concentrates on the methodology of grammar development with respect to real-world natural language texts. The most important GDW tasks are enhancing the meta-grammar and creation of a tree bank.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "For building a tree bank of correct syntactic trees, the following steps are conducted. First of all, a corpus sentence is analysed by the Gsynt module. Figure 4 shows basic window with sentences from a corpus (PDTB-1.0 [16] in this case). The selected sentence is analyzed by the synt parser and the output of the parser is displayed. Several additional information about sentences is presented in the window.",
                "cite_spans": [
                    {
                        "start": 220,
                        "end": 224,
                        "text": "[16]",
                        "ref_id": "BIBREF15"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 153,
                        "end": 161,
                        "text": "Figure 4",
                        "ref_id": "FIGREF2"
                    }
                ],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "The syntactic trees are displayed by the TreeView module. The trees are all consistent with the imposed meta-grammar and they are ordered by the computed tree ranks. However, the ordering is still premature and the correct tree is often not in the first positions yet. The number of syntactic trees is reduced by successive specification of pruning constraints. The resulted syntactic tree is added to the tree bank at the end.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "Enhancing the meta-grammar lies in determining new rules for an unaccepted sentence. By means of the ChartView module, the problematic sentence construct that is not covered by the meta-grammar can be located. Then the exact specification of the needed rule(s) for the uncovered construct is determined and entered in the Grammar-View module, see the Figure 3 .",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 351,
                        "end": 359,
                        "text": "Figure 3",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "For more information about the GDW project see the project documentation page http://nlp.fi.muni.cz/projects/grammar workbench/manual-en/.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Grammar Development Workbench",
                "sec_num": "6"
            },
            {
                "text": "This paper has described several tools, methods and systems that together form a platform for full syntactic analysis of free-word order natural language, the Czech language. The development of the platform components is definitely not yet completed, however, already at this stage the system offers very high coverage on common corpus sentences while keeping the analysis time on the level suitable for batch processing of large texts.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "7"
            },
            {
                "text": "Measured on 10.000 Czech corpus sentences with an average time of 276 mili-seconds per sentence.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            }
        ],
        "back_matter": [
            {
                "text": "This work has been partly supported by Czech Science Foundation under the project 201/05/2781 and by the Ministry of Education of the Czech Republic in the National Research Programme II project 2C06009.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Acknowledgments",
                "sec_num": null
            }
        ],
        "bib_entries": {
            "BIBREF0": {
                "ref_id": "b0",
                "title": "Immediate-head parsing for language models",
                "authors": [
                    {
                        "first": "E",
                        "middle": [],
                        "last": "Charniak",
                        "suffix": ""
                    }
                ],
                "year": 2001,
                "venue": "Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Charniak, E.: Immediate-head parsing for language models. In: Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics, Toulouse, France (2001)",
                "links": null
            },
            "BIBREF1": {
                "ref_id": "b1",
                "title": "Head-driven Statistical Models for Natural Language Parsing",
                "authors": [
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Collins",
                        "suffix": ""
                    }
                ],
                "year": 1999,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Collins, M.: Head-driven Statistical Models for Natural Language Parsing. PhD thesis, Computer Science Department, University of Pennsylvenia, Philadelphia (1999)",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "A Parser System for Extensible Dependency Grammar",
                "authors": [
                    {
                        "first": ",",
                        "middle": [],
                        "last": "R Debusmann",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "In",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "103--106",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "R Debusmann, . In: A Parser System for Extensible Dependency Grammar, Loria, Nancy France (2003) 103-106",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "3-phase grammar learning",
                "authors": [
                    {
                        "first": "G",
                        "middle": [],
                        "last": "Kruijff",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceedings of Workshop on Ideas and Strategies for Multilingual Grammar Development",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kruijff, G.: 3-phase grammar learning. In: Proceedings of Workshop on Ideas and Strategies for Multilingual Grammar Development, Vienna Austria (2003)",
                "links": null
            },
            "BIBREF4": {
                "ref_id": "b4",
                "title": "New meta-grammar constructs in czech language parser synt",
                "authors": [
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Hor\u00e1k",
                        "suffix": ""
                    },
                    {
                        "first": "V",
                        "middle": [],
                        "last": "Kadlec",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "85--92",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hor\u00e1k, A., Kadlec, V.: New meta-grammar constructs in czech language parser synt. In: TSD. (2005) 85-92",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "The interface between phrasal and functional constraints",
                "authors": [
                    {
                        "first": "Iii",
                        "middle": [],
                        "last": "Maxwell",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [
                            "T"
                        ],
                        "last": "Kaplan",
                        "suffix": ""
                    },
                    {
                        "first": "R",
                        "middle": [
                            "M"
                        ],
                        "last": "",
                        "suffix": ""
                    }
                ],
                "year": 1991,
                "venue": "Proceedings of the Workshop on Constraint Propagation, Linguistic Description, and Computation",
                "volume": "19",
                "issue": "",
                "pages": "571--590",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Maxwell III, J.T., Kaplan, R.M.: The interface between phrasal and functional constraints. In Rosner, M., Rupp, C.J., Johnson, R., eds.: Proceedings of the Workshop on Constraint Propagation, Linguistic Description, and Computation, Instituto Dalle Molle IDSIA, Lugano (1991) 105-120 Also in Computational Linguistics, Vol. 19, No. 4, 571-590, 1994.",
                "links": null
            },
            "BIBREF6": {
                "ref_id": "b6",
                "title": "Morphemic Analyser for Czech",
                "authors": [
                    {
                        "first": "R",
                        "middle": [],
                        "last": "Sedl\u00e1\u010dek",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Sedl\u00e1\u010dek, R.: Morphemic Analyser for Czech. PhD thesis, Masaryk University, Brno, Czech Republic (2005)",
                "links": null
            },
            "BIBREF7": {
                "ref_id": "b7",
                "title": "Verbalex -new comprehensive lexicon of verb valencies for czech",
                "authors": [
                    {
                        "first": "D",
                        "middle": [],
                        "last": "Hlav\u00e1\u010dkov\u00e1",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Hor\u00e1k",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Proceedings of the Slovko Conference",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hlav\u00e1\u010dkov\u00e1, D., Hor\u00e1k, A.: Verbalex -new comprehensive lexicon of verb valencies for czech. In: Proceedings of the Slovko Conference, Bratislava, Slovakia (2005)",
                "links": null
            },
            "BIBREF8": {
                "ref_id": "b8",
                "title": "Best analysis selection in inflectional languages",
                "authors": [
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Hor\u00e1k",
                        "suffix": ""
                    },
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Smr\u017e",
                        "suffix": ""
                    }
                ],
                "year": 2002,
                "venue": "Proceedings of the 19th international conference on Computational linguistics",
                "volume": "",
                "issue": "",
                "pages": "363--368",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hor\u00e1k, A., Smr\u017e, P.: Best analysis selection in inflectional languages. In: Proceedings of the 19th international conference on Computational linguistics, Taipei, Taiwan, Association for Computational Linguistics (2002) 363-368",
                "links": null
            },
            "BIBREF9": {
                "ref_id": "b9",
                "title": "PACE -parser comparison and evaluation",
                "authors": [
                    {
                        "first": "V",
                        "middle": [],
                        "last": "Kadlec",
                        "suffix": ""
                    },
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Smr\u017e",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceedings of the 8th International Workshop on Parsing Technologies, IWPT 2003",
                "volume": "",
                "issue": "",
                "pages": "211--212",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kadlec, V., Smr\u017e, P.: PACE -parser comparison and evaluation. In: Proceedings of the 8th International Workshop on Parsing Technologies, IWPT 2003, Le Chesnay Cedex, France, INRIA, Domaine de Voluceau, Rocquencourt (2003) 211-212",
                "links": null
            },
            "BIBREF10": {
                "ref_id": "b10",
                "title": "New meta-grammar constructs in czech language parser synt",
                "authors": [
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Hor\u00e1k",
                        "suffix": ""
                    },
                    {
                        "first": "V",
                        "middle": [],
                        "last": "Kadlec",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Proceedings of Text, Speech and Dialogue",
                "volume": "",
                "issue": "",
                "pages": "85--92",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hor\u00e1k, A., Kadlec, V.: New meta-grammar constructs in czech language parser synt. In: Proceedings of Text, Speech and Dialogue 2005, Karlovy Vary, Czech Republic, Springer- Verlag (2005) 85-92",
                "links": null
            },
            "BIBREF11": {
                "ref_id": "b11",
                "title": "How many dots are really needed for head-driven chart parsing?",
                "authors": [
                    {
                        "first": "V",
                        "middle": [],
                        "last": "Kadlec",
                        "suffix": ""
                    },
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Smr\u017e",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of SOFSEM 2006",
                "volume": "",
                "issue": "",
                "pages": "483--492",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kadlec, V., Smr\u017e, P.: How many dots are really needed for head-driven chart parsing? In: Proceedings of SOFSEM 2006, Czech Republic, Springer-Verlag (2006) 483-492",
                "links": null
            },
            "BIBREF12": {
                "ref_id": "b12",
                "title": "N\u00e1stroje pro v\u00fdvoj gramatik p\u0159irozen\u00e9ho jazyka (tools for developing natural language grammars)",
                "authors": [
                    {
                        "first": "R",
                        "middle": [],
                        "last": "Vykydal",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Vykydal, R.: N\u00e1stroje pro v\u00fdvoj gramatik p\u0159irozen\u00e9ho jazyka (tools for developing natural language grammars). Master's thesis, Faculty of Informatics, Masaryk University, Brno, Czech Republic (2005) in Czech.",
                "links": null
            },
            "BIBREF13": {
                "ref_id": "b13",
                "title": "Exploitation of the verbalex verb valency lexicon in the syntactic analysis of czech",
                "authors": [
                    {
                        "first": "D",
                        "middle": [],
                        "last": "Hlav\u00e1\u010dkov\u00e1",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Hor\u00e1k",
                        "suffix": ""
                    },
                    {
                        "first": "V",
                        "middle": [],
                        "last": "Kadlec",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of Text, Speech and Dialogue",
                "volume": "",
                "issue": "",
                "pages": "79--85",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hlav\u00e1\u010dkov\u00e1, D., Hor\u00e1k, A., Kadlec, V.: Exploitation of the verbalex verb valency lexicon in the syntactic analysis of czech. In: Proceedings of Text, Speech and Dialogue 2006, Brno, Czech Republic, Springer-Verlag (2006) 79-85",
                "links": null
            },
            "BIBREF14": {
                "ref_id": "b14",
                "title": "Valency Frames of Czech Verbs in VALLEX 1.0",
                "authors": [
                    {
                        "first": "Z",
                        "middle": [],
                        "last": "\u017dabokrtsk\u00fd",
                        "suffix": ""
                    },
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Lopatkov\u00e1",
                        "suffix": ""
                    }
                ],
                "year": 2004,
                "venue": "HLT-NAACL 2004 Workshop: Frontiers in Corpus Annotation",
                "volume": "",
                "issue": "",
                "pages": "70--77",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "\u017dabokrtsk\u00fd, Z., Lopatkov\u00e1, M.: Valency Frames of Czech Verbs in VALLEX 1.0. In Meyers, A., ed.: HLT-NAACL 2004 Workshop: Frontiers in Corpus Annotation. (2004) 70-77",
                "links": null
            },
            "BIBREF15": {
                "ref_id": "b15",
                "title": "Building a syntactically annotated corpus: The Prague Dependency Treebank",
                "authors": [
                    {
                        "first": "J",
                        "middle": [],
                        "last": "Haji\u010d",
                        "suffix": ""
                    }
                ],
                "year": 1998,
                "venue": "Issues of Valency and Meaning",
                "volume": "",
                "issue": "",
                "pages": "106--132",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Haji\u010d, J.: Building a syntactically annotated corpus: The Prague Dependency Treebank. In: Issues of Valency and Meaning, Prague, Karolinum (1998) 106-132",
                "links": null
            },
            "BIBREF16": {
                "ref_id": "b16",
                "title": "Valence\u010desk\u00fdch sloves (Valencies of Czech Verbs)",
                "authors": [
                    {
                        "first": "K",
                        "middle": [],
                        "last": "Pala",
                        "suffix": ""
                    },
                    {
                        "first": "P",
                        "middle": [],
                        "last": "Sevecek",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Proceedings of Works of Philosophical Faculty at the University of Brno",
                "volume": "",
                "issue": "",
                "pages": "41--54",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Pala, K., Sevecek, P.: Valence\u010desk\u00fdch sloves (Valencies of Czech Verbs). In: Proceedings of Works of Philosophical Faculty at the University of Brno, Brno, Masaryk University (1997) 41-54",
                "links": null
            },
            "BIBREF17": {
                "ref_id": "b17",
                "title": "Investigating regular sense extensions based on intersective levin classes",
                "authors": [
                    {
                        "first": "H",
                        "middle": [
                            "T"
                        ],
                        "last": "Dang",
                        "suffix": ""
                    },
                    {
                        "first": "K",
                        "middle": [],
                        "last": "Kipper",
                        "suffix": ""
                    },
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Palmer",
                        "suffix": ""
                    },
                    {
                        "first": "J",
                        "middle": [],
                        "last": "Rosenzweig",
                        "suffix": ""
                    }
                ],
                "year": 1998,
                "venue": "Proceedings of Coling-ACL98",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Dang, H.T., Kipper, K., Palmer, M., Rosenzweig, J.: Investigating regular sense extensions based on intersective levin classes. In: Proceedings of Coling-ACL98, Montreal CA (August 11-17, 1998) http://www.cis.upenn.edu/\u223cmpalmer/.",
                "links": null
            },
            "BIBREF18": {
                "ref_id": "b18",
                "title": "An efficient context-free parsing algorithm",
                "authors": [
                    {
                        "first": "J",
                        "middle": [],
                        "last": "Earley",
                        "suffix": ""
                    }
                ],
                "year": 1970,
                "venue": "Communications of the ACM",
                "volume": "13",
                "issue": "",
                "pages": "94--102",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Earley, J.: An efficient context-free parsing algorithm. In: Communications of the ACM. Volume 13. (1970) 94-102",
                "links": null
            },
            "BIBREF19": {
                "ref_id": "b19",
                "title": "Efficient Parsing for Natural Languages: A Fast Algorithm for Practical Systems",
                "authors": [
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Tomita",
                        "suffix": ""
                    }
                ],
                "year": 1986,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Tomita, M.: Efficient Parsing for Natural Languages: A Fast Algorithm for Practical Sys- tems. Kluwer Academic Publishers, Boston, MA (1986)",
                "links": null
            },
            "BIBREF20": {
                "ref_id": "b20",
                "title": "Computational complexity and natural language",
                "authors": [
                    {
                        "first": "G",
                        "middle": [
                            "E"
                        ],
                        "last": "Barton",
                        "suffix": ""
                    },
                    {
                        "first": "R",
                        "middle": [
                            "C"
                        ],
                        "last": "Berwick",
                        "suffix": ""
                    },
                    {
                        "first": "E",
                        "middle": [
                            "S"
                        ],
                        "last": "Ristad",
                        "suffix": ""
                    }
                ],
                "year": 1987,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Barton, G.E., Berwick, R.C., Ristad, E.S.: Computational complexity and natural language. MIT Press, Cambridge, Massachusetts (1987)",
                "links": null
            }
        },
        "ref_entries": {
            "FIGREF0": {
                "num": null,
                "uris": null,
                "text": "Interaction of our tools",
                "type_str": "figure"
            },
            "FIGREF1": {
                "num": null,
                "uris": null,
                "text": "An example of a VerbaLex verb frame The Second Grammar Form (G2) Several pre-defined grammatical tests and procedures are used in the description of contextual actions associated with each grammatical rule of the system. The pruning actions include:",
                "type_str": "figure"
            },
            "FIGREF2": {
                "num": null,
                "uris": null,
                "text": "The Gsynt module window showing an analysis of a sentence from corpus.",
                "type_str": "figure"
            },
            "TABREF0": {
                "type_str": "table",
                "num": null,
                "html": null,
                "content": "<table><tr><td>VerbaLex Synset: obl\u00e9ci:1 pf , obl\u00e9kat:1 impf , obl\u00e9knout:1 pf , ustrojit:1 pf , strojit:1 impf</td></tr><tr><td>=def: provide with clothes or put clothes on</td></tr><tr><td>=canbepassive: yes</td></tr><tr><td>=meaning: I</td></tr><tr><td>=class: dress-41.1.1</td></tr><tr><td>Complex valency frames:</td></tr><tr><td>1. obl\u00e9ci:1, obl\u00e9kat:1, obl\u00e9knout:1</td></tr><tr><td>-frame: AG&lt;person:1&gt; obl who1 VERB PAT&lt;person:1&gt; obl to whom3 ART&lt;garment:1&gt; obl what4</td></tr><tr><td>-synonym: ustrojit:1, strojit:1</td></tr><tr><td>-example: maminka obl\u00e9kla d\u00edt\u011bti kab\u00e1t / the mother put a coat</td></tr><tr><td>on her child</td></tr><tr><td>-attr: use: prim, reflexivity=obj dat, mustbeimperative=no</td></tr><tr><td>2. obl\u00e9ci:1, obl\u00e9kat:1, obl\u00e9knout:1, ustrojit:1, strojit:1</td></tr><tr><td>-frame: AG&lt;person:1&gt; obl who1 VERB PAT&lt;person:1&gt; obl whom4 ART&lt;garment:1&gt; obl in+sth2</td></tr><tr><td>-synonym:</td></tr><tr><td>-example: maminka obl\u00e9kla d\u00edt\u011b do kab\u00e1tu / the mother dressed</td></tr><tr><td>her child in a coat</td></tr><tr><td>-attr: use: prim, reflexivity=obj ak, mustbeimperative=no</td></tr></table>",
                "text": "Princeton WordNet: dress:2, clothe:1, enclothe:1, garb:1, raiment:1, tog:1, garment:1, habilitate:2, fit out:2, apparel:1 definition: provide with clothes or put clothes on"
            }
        }
    }
}