| { |
| "paper_id": "W00-0100", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T05:33:31.327932Z" |
| }, |
| "title": "", |
| "authors": [], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "", |
| "pdf_parse": { |
| "paper_id": "W00-0100", |
| "_pdf_hash": "", |
| "abstract": [], |
| "body_text": [ |
| { |
| "text": "The last decade has seen an explosion in the work done in the development of robust natural language processing systems. A common methodology used in building these systems has been to analyze a sample of the data available (either manually, or automatically for training statistical systems), build statistical/heuristical schemas based upon the analysis, and test the system on a blind sample of the data. Due to this commonly used paradigm, an important area of research that has not been given the attention it deserves is the estimation of syntactic and semantic complexity faced by these systems in the tasks they perform.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The Workshop on Syntactic and Semantic Complexity in Natural Language Processing Systems, held on April 30th, 2000 at the Language Technology Joint Conference on Applied Natural Language Processing and the North American Chapter of the Association of Computational Linguistics (ANLP-NAACL2000) was organized around the goals of discussing, promoting, and presenting new research results regarding the question of complexity as it pertains to the syntax and semantics of natural language. In particular, the goal of the workshop was to focus on:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 estimation of the syntactic and semantic complexity of specific NLP tasks We would like to thank all authors who showed their interest by submitting papers to the workshop. We would also like to thank the members of the program committee: Branimir Boguraev (IBM Research), J-P Chanod (Xerox, Grenoble), Shalom Lappin (Kings College, London), Aravind Joshi (University of Pennsylvania), Larry Moss (Indiana), Rohit Parikh (CUNY), and Adam Pease (Teknowledge). and domain complexity ............................................................................................................................. 28 Paola Velardi and Alessandro Cucchiarelli Analyzing the Reading Comprehension Task ............................................................................................ ", |
| "cite_spans": [ |
| { |
| "start": 461, |
| "end": 787, |
| "text": "and domain complexity ............................................................................................................................. 28 Paola Velardi and Alessandro Cucchiarelli Analyzing the Reading Comprehension Task ............................................................................................", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "A Measure of Semantic Complexity for Natural Adnominal Constituents ............................................................................................................................. 59 Kyoko Kanzaki, Qing Ma, and Hitoshi Isahara ", |
| "cite_spans": [ |
| { |
| "start": 45, |
| "end": 211, |
| "text": "Adnominal Constituents ............................................................................................................................. 59 Kyoko Kanzaki,", |
| "ref_id": null |
| }, |
| { |
| "start": 212, |
| "end": 220, |
| "text": "Qing Ma,", |
| "ref_id": null |
| }, |
| { |
| "start": 221, |
| "end": 240, |
| "text": "and Hitoshi Isahara", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Arnit Bagga", |
| "sec_num": "35" |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": {}, |
| "ref_entries": { |
| "FIGREF0": { |
| "uris": null, |
| "text": "semantic complexity and world knowledge \u2022 role of syntactic and semantic complexity in system design and testing \u2022 syntactic and semantic complexity and its role in the evaluation of NLP systems \u2022 use of syntactic and semantic complexity as a performance predictor \u2022 relationship between syntactic and semantic complexity", |
| "type_str": "figure", |
| "num": null |
| }, |
| "TABREF0": { |
| "text": "Sentences vs. Phrases: Syntactic Complexity in Multimedia Information Retrieval ................................... 1", |
| "html": null, |
| "num": null, |
| "content": "<table><tr><td>Sharon Flank</td></tr><tr><td>Using Long Runs as Predictors of Semantic Coherence in a Partial Document</td></tr><tr><td>Retrieval System .</td></tr></table>", |
| "type_str": "table" |
| }, |
| "TABREF1": { |
| "text": "Arrangements of Examples Robert John FreemanPartially Saturated Referents as aSource of Complexity in Semantic Interpretation .............................. 51 David D. McDonaldSimilarities and Differences among Semantic Behaviors of Japanese", |
| "html": null, |
| "num": null, |
| "content": "<table/>", |
| "type_str": "table" |
| } |
| } |
| } |
| } |
