Relating Tabular Parsing Algorithms for LIG and TAG

Alonso, Miguel Ángel Verdugo; Clergerie, Éric de la; Díaz, Víctor J.; Vilares, Manuel

doi:10.1007/1-4020-2295-6_8

Cited by 4 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, LIGs are more generic than TAGs, thus more specialized and efficient parsers can be potentially designed for TAGs [3]. Also, the TAG-to-LIG conversion does not preserve the extended domain of locality (EDL) ensured by TAGs, which is for us an eliminating criterion.…”

Section: Related Workmentioning

confidence: 99%

Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy

Waszczuk

Savary

Parmentier

2016

Implementation and Application of Automata

View full text Add to dashboard Cite

Abstract. The efficiency of parsing with tree adjoining grammars (TAGs) depends not only on the size of the input sentence but also, linearly, on the size of the input TAG, which can attain several thousands of elementary trees. We propose a factorized, finite-state TAG representation to cope with this combinatorial explosion. The associated parsing algorithm shows a substantial performance gain on a real-size French TAG.

show abstract

Section: Related Workmentioning

confidence: 99%

Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy

Waszczuk

Savary

Parmentier

2016

Implementation and Application of Automata

View full text Add to dashboard Cite

show abstract

A compiler for parsing schemata

2008

View full text Add to dashboard Cite

We present a compiler that can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and to ensure that the generated implementations are efficient. The system described is general enough to be able to handle all kinds of schemata for different grammar formalisms, such as context‐free grammars and tree‐adjoining grammars, and it provides an extensibility mechanism allowing the user to define custom notational elements. This compiler has proven very useful for analyzing, prototyping and comparing natural‐language parsers in real domains, as can be seen in the empirical examples provided at the end of the paper. Copyright © 2008 John Wiley & Sons, Ltd.

show abstract