Izrada osnova formalne gramatike srpskog jezika upotrebom metagramatike

BP Đorđević - Универзитет у Београду, 2017 - nardus.mpn.gov.rs
Ovaj rad predstavlja proces izrade osnova FBLTAG gramatike srpskog jezika, a zatim i
proces izrade njene metagramatike, čija primena na osnovne modele rečenica u srpskom …

Interpretación tabular de autómatas para lenguajes de adjunción de árboles

MÁ Alonso - 2000 - ruc.udc.es
Las gramáticas de adjunción de árboles son una extensión de las gramáticas
independientes del contexto que utilizan árboles en vez de producciones como estructuras …

SemTAG, the LORIA toolbox for TAG-based Parsing and Generation

E Kow, Y Parmentier, C Gardent - The Eighth International …, 2006 - inria.hal.science
In this paper, we introduce SemTAG, a toolbox for TAG-based parsing and generation. This
environment supports the development of wide-coverage grammars and differs from existing …

[PDF][PDF] LTAG workbench: A general framework for LTAG

P Lopez - Proceedings of the Fifth International Workshop on …, 2000 - aclanthology.org
This paper presents the LTAG Workbench, a set of graphical tools and parsers freely
available for LTAG. The system can be view as a modem alternative to the XTAG system. We …

[PDF][PDF] Bidirectional automata for tree adjoining grammars

MA Alonso, VJ Díaz, M Vilares - Proceedings of the Seventh …, 2001 - aclanthology.org
We de ne 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 …

[PDF][PDF] Bidirectional parsing of TAG without heads

VJ Díaz, MA Alonso, V Carrillo - Proceedings of the Fifth …, 2000 - aclanthology.org
We present a bottom-up bidirectional parser for Tree Adjoi11i11g Grammars that is an
extension bf the parser defmed by De Vreught and Honig for Context Free Grammars …

Semantically-oriented text planning for automatic summarization

G Casamayor - 2021 - tdx.cat
Text summarization deals with the automatic creation of summaries from one or more
documents, either by extracting fragments from the input text or by generating an abstract de …

[PDF][PDF] BIDIRECTIONAL AUTOMATA FOR TREE ADJOINING GRAMMARS

VJ Dıaz - coleweb.dc.fi.udc.es
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 …

[PDF][PDF] DFKI GmbH Stuhlsatzenhausweg 3 D-66123 Saarbrcken, Germany

P Lopez - 2000 - Citeseer
This paper presents the LTAG Workbench, a set of graphical tools and parsers freely
available for LTAG. The system can be view as a modern alternative to the XTAG system …

[PDF][PDF] Grammar conversion from LTAG to HPSG

NYY Miyao - tkl.iis.u-tokyo.ac.jp
We propose an algorithm for the conversion of grammars from an arbitrary FB-LTAG
grammar into a strongly equivalent HPSG-style grammar. Our algorithm converts LTAG …