21,224 research outputs found
Cache Transition Systems for Graph Parsing
No full text Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with fixed size m, and we characterize the relationship between the parameter m and the class of graphs that can be produced through the graph-theoretic concept of tree decomposition. We find empirically that small cache sizes cover a high percentage of sentences in existing semantic corpora. </jats:p
Ordered Tree Decomposition for HRG Rule Extraction
No full textWe present algorithms for extracting Hyperedge Replacement Grammar (HRG) rules from a graph along with a vertex order. Our algorithms are based on finding a tree decomposition of smallest width, relative to the vertex order, and then extracting one rule for each node in this structure. The assumption of a fixed order for the vertices of the input graph makes it possible to solve the problem in polynomial time, in contrast to the fact that the problem of finding optimal tree decompositions for a graph is NP-hard. We also present polynomial-time algorithms for parsing based on our HRGs, where the input is a vertex sequence and the output is a graph structure. The intended application of our algorithms is grammar extraction and parsing for semantic representation of natural language. We apply our algorithms to data annotated with Abstract Meaning Representations and report on the characteristics of the resulting grammars
Report on Meteorological Research March 1, 1935 (m-1)
No full textThe object of the report was to elucidate in detail the various features of the research program in meteorology being carried on at the Daniel Guggenheim Airship Institute in Akron, Ohio. Mr. L. J. Fangman, of the U.S. Weather Bureau, was collaborating with the author in carrying out work such as a study of autographic records of the various meteorological elements during frontal passages with a view to the possible prediction of the intensity of the accompanying disturbance as it may affect the operation of aircraft and a study of atmospheric gustiness with a view to finding the dependence between frequency end amplitude of velocity fluctuations and the vertical temperature and velocity gradients
(Fourth) Report on Meteorological Activities at the DGAI (8-1-36)(Weather Bureau Copy)
No full textThis report is on the investigations of frontal phenomena at the Daniel Guggenheim Airship Institute in Akron, Ohio from January 1, 1935 through August 1, 1936. The investigation was carried out with the cooperation of the U.S. Bureau of Aeronautics, the U.S. Weather Bureau, the California Institute of Technology, and the Guggenheim Airship Institute. Mr. R.C. Robinson of the Weather Bureau cooperated with the author in carrying out the investigation. The object of the investigation was to determine the intensity of the atmospheric disturbances (i.e. rapidity of wind shift and gustiness) accompanying the passage of cold fronts, along with a study of the characteristics of the air masses involved and other features which might affect the intensity of the disturbance. The report treated thirty cold fronts which passed the station during 1935 to 1936
Semantic Labeling by Maximum Entropy Model
No full textIn this paper, we present the results for semantic labeling, extending the work of [Gildea and Jurafsky, 2002], [Fleischman et al., 2003], [Pradhan et al., 2004], and others. The main labeling approach is based on Maximum Entroopy. We show the performance of the baseline system as well as those by applying coreference resolution, stemming and feature combinations to the feature files
AMR Parsing With Cache Transition Systems
No full textIn this paper, we present a transition system that generalizes transition-based dependency parsing techniques to generateAMR graphs rather than tree structures. In addition to a buffer and a stack, we use a fixed-size cache, and allow the system to build arcs to any vertices present in the cache at the same time. The size of the cache provides a parameter that can trade off between the complexity of the graphs that can be built and the ease of predicting actions during parsing. Our results show that a cache transition system can cover almost all AMR graphs with a small cache size, and our end-to-end system achieves competitive results in comparison with other transition-based approaches for AMR parsing
Archives and Images as Repositories of Time, Language, and Forms from the Past: A Conversation with Daniel Eisenberg
No full textWeighted DAG automata for semantic graphs
No full textGraphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the frameworks of finite automata for strings and finite tree automata for trees. A possible starting point for such a framework is the formalism of directed acyclic graph (DAG) automata, defined by Kamimura and Slutzki and extended by Quernheim and Knight. In this article, we study the latter in depth, demonstrating several new results, including a practical recognition algorithm that can be used for inference and learning with models defined on DAG automata. We also propose an extension to graphs with unbounded node degree and show that our results carry over to the extended formalism
Daniel Akech
No full textabstract: Daniel was a little boy when the war came to his village. He witnessed people being shot and running for shelter. There was no food or water so he drank urine and ate tree leaves.
“Lost Boys Found” is an ongoing, interdisciplinary project that is collecting, recording and archiving the oral histories of the Lost Boys/Girls of Sudan. The collection is a work-in-progress, seeking to record the oral history of as many Lost Boys/Girls as are willing, and will be used in a future book.Age: 24Region: Upper NileThis picture and bio was donated to the "Lost Boys Found" oral history project from The Arizona Lost Boys Cente
- …
