Parsing Schemata Research Papers - Academia.edu (original) (raw)
In this research, we would like to build an initial model for semantic parsing of simple Vietnamese sentences. With a semantic parsing model like that, we can analyse simple Vietnamese sentences to determine their semantic structures that... more
In this research, we would like to build an initial model for semantic parsing of simple Vietnamese sentences. With a semantic parsing model like that, we can analyse simple Vietnamese sentences to determine their semantic structures that are represented in a form that was defined by our point of view. So, we try to solve two tasks: first, building an our taxonomy of Vietnamese nouns, then we use it to define the feature structures of nouns and verbs; second, to build a Unification-Based Vietnamese Grammar we
define the syntactic and semantic unification rules for the Vietnamese phrases, clauses and sentences based on the Unification-Based Grammar. This Vietnamese grammar has been used to build a semantic parser for single Vietnamese sentences. This semantic parser has been experienced and the experiment results get precision and recall all over 84%.
Presentamos un compilador capaz de generar analizadores sintácticos a partir de esquemas de análisis sintáctico. Dichos esquemas son representaciones de los analizadores en forma de sistemas deductivos, que abstraen los detalles de... more
Presentamos un compilador capaz de generar analizadores sintácticos a partir de esquemas de análisis sintáctico. Dichos esquemas son representaciones de los analizadores en forma de sistemas deductivos, que abstraen los detalles de implementación y permiten definir y comparar fácilmente diferentes algoritmos. Nuestro compilador es capaz de generar, a partir de uno de estos esquemas, el código de una implementación del algoritmo correspondiente, incluyendo el código necesario para gestionar la indexación de resultados intermedios para que dicha implementación sea eficiente. El sistema acepta todo tipo de esquemas de analizadores para gramáticas independientes del contexto, y se puede generalizar fácilmente a otros tipos de formalismos gramaticales.
The parsing schemata formalism allows us to describe parsing algorithms in a simple way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing automatic... more
The parsing schemata formalism allows us to describe parsing algorithms in a simple way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing automatic trans- formation of parsing schemata to executable implementations of their corresponding algorithms. Taking a simple description of a schema as input, our technique gene- rates Java code for the corresponding parsing algorithm, including schema-specific indexing code in order to attain efficiency. Our technique is general enough to be able to handle all kinds of schemata for context-free grammars, providing an exten- sibility mechanism which allows the user to define custom notational elements, and it could also be easily generalized to other grammatical formalisms.