Restricting grammars with tree automata
نویسندگان
چکیده
منابع مشابه
Tree Automata and Tree Grammars
Preface I wrote these lecture notes during my stay in Aarhus in the academic year 1974/75. As a young researcher I had a wonderful time at DAIMI, and I have always been happy to have had that early experience. I wish to thank Heiko Vogler for his noble plan to move these notes into the digital world, and I am grateful to Florian Starke and Markus Napierkowski (and Heiko) for the excellent trans...
متن کاملBidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of describing bidirectional parsing strategies for TAG, separating the description of a strategy from its execution.
متن کاملRestricting Logic Grammars
A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes s...
متن کاملRestricting Logic Grammars with Government-Binding Theory
A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes s...
متن کاملLexicalized Tree Automata-Based Grammars For Translating Conversational Texts
We propose a new lexicalizcd grammar formalism called Lexicalized Tree Automata-based Grammar, which lcxicalizes tree acccptors instead of trees themselves. We discuss the properties of the grammar and present a chart parsing algorithm. Wc have implemented a translation module for conversational texts using this formalism, and applied it to an experimental automatic interpretation system (speec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2017
ISSN: 2475-1421
DOI: 10.1145/3133906