Slot Grammars
نویسنده
چکیده
This paper presents a formalism for natural language grammars , with accompanying parser. The grammars are called slot grammars because they are organized around slots (grammatical relations) and rules for filling them. The parser works bo t tom-up and maintains, for each phrase being built up, a list called the available slots list, ASLOTS. A phrase can grow by having one of the slots in its ASLOTS list filled by a suitable adjoining phrase.
منابع مشابه
Jointly Modeling Inter-Slot Relations by Random Walk on Knowledge Graphs for Unsupervised Spoken Language Understanding
A key challenge of designing coherent semantic ontology for spoken language understanding is to consider inter-slot relations. In practice, however, it is difficult for domain experts and professional annotators to define a coherent slot set, while considering various lexical, syntactic, and semantic dependencies. In this paper, we exploit the typed syntactic dependency theory for unsupervised ...
متن کاملLearning semantic hierarchy with distributed representations for unsupervised spoken language understanding
We study the problem of unsupervised ontology learning for semantic understanding in spoken dialogue systems, in particular, learning the hierarchical semantic structure from the data. Given unlabelled conversations, we augment a frame-semantic based unsupervised slot induction approach with hierarchical agglomerative clustering to merge topically-related slots (e.g., both slots “direction” and...
متن کاملTowards Convenient Bi-Directional Grammar Formalisms
P. Newmzrn IBM Pale Alto Scientific Center 1530 Page Mill Road Pale Alto, CA 94304, US/Y This paper discusses tim advantages for practical bi :, direclional grammars 6(combirfiug a lexical fbcus with the (}PEG-originated principle of immediatedominance/line.ar-precedence (I[)/1,P) rule partitioning. It. also outlines an implenlentation approach fbllowing these gafidelines. The approach is inspi...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملAn Ultralow Cross-Polarization Slot Array Antenna in Narrow Wall of Angled Ridge Waveguide
A low cross-polarization slot array antenna in the narrow wall of ridge waveguide is presented. A non-angled slot which is created in the narrow wall of the ridge waveguide is considered to be used as radiating resonant slot. The normalized resistance and normalized reactance curves are presented for design purposes. A six element slot array waveguide antenna with ridges on its narrow wall is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- American Journal of Computational Linguistics
دوره 6 شماره
صفحات -
تاریخ انتشار 1980