1,721,050 research outputs found
Natural Language Generation with Abstract Machine
No full textMACHINE Evgeniy Gabrilovich and Nissim Francez Shuly Wintner Computer Science Department Seminar fur Sprachwissenschaft Technion, Israel Institute of Technology Universitat Tubingen 32000 Haifa, Israel 72074 Tubingen, Germany fgabr,[email protected] [email protected] Abstract We present a system for Natural Language Generation based on an Abstract Machine approach. Our abstract machine operates on grammars encoded in a unification-based Typed Feature Structure formalism, and is capable of both generation and parsing. For efficient generation, grammars are first inverted to a suitable form, and then compiled into abstract machine instructions. A dual compiler translates the same input grammar into an abstract machine program for parsing. Both generation and parsing programs are executed under the same (chart-based) evaluation strategy. This results in an efficient, bidirectional (parsing/generation) system for Natural Language Processing. Moreover, the system ..
Compositional Semantics for Unification-based Linguistic Formalisms
No full textContemporary linguistic formalisms have become so rigorous that it is now possible to view them as very high level declarative programming languages. Consequently, grammars for natural languages can be viewed as programs; this view enables the application of various methods and techniques that were proved useful for programming languages to the study of natural languages. This paper adapts the notion of program composition, well developed in the context of logic programming languages, to the domain of linguistic formalisms. We study alternative definitions for the semantics of such formalisms, suggesting a denotational semantics that we show to be compositional and fully-abstract. This facilitates a clear, mathematically sound way for defining grammar modularity. 1 Introduction The tasks of developing large scale grammars for natural languages become more and more complicated: it is not unusual for a single grammar to be developed by a team including a number of linguists, computation..
Hebrew computational linguistics: Past and future
No full textThis paper reviews the current state of the art in Natural Language Processing for Hebrew, both theoretical and practical. The Hebrew language, like other Semitic languages, poses special challenges for developers of programs for natural language processing: the writing system, rich morphology, unique word formation process of roots and patterns, lack of linguistic corpora that document language usage, all contribute to making computational approaches to Hebrew challenging. The paper briefly reviews the field of computational linguistics and the problems it addresses, describes the special difficulties inherent to Hebrew (as well as to other Semitic languages), surveys a wide variety of past and ongoing works and attempts to characterize future needs and possible solutions.
Noun Phrases as NPs - the case of Hebrew
No full text. Data from Hebrew have been claimed to support the hypothesis that noun phrases should be considered DPs universally. This paper shows that the application of the DP hypothesis to Hebrew is based on partial data and theoryinternal considerations. A straightforward analysis of noun phrases as NPs is proposed; it is shown to account for a variety of facts that were believed to necessitate the introduction of functional categories and compulsory head raising in Hebrew NPs. Furthermore, this analysis provides a unified account for phenomena that were overlooked in previous works, such as definiteness agreement in the noun phrase and the similarities between construct state nouns and adjectives. 1 Introduction Following [Abney, 1987], analyses carried out in Chomskian frameworks view noun phrases as DPs, headed by the functional category D. The DP hypothesis (DPH) has been applied to a variety of languages and is incorporated into most existing accounts for Modern Hebrew (MH). Originally ..
- …
