Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
SMRŽ, P. KADLEC, V.
Originální název
How Many Dots Are Really Needed for Head-Driven Chart Parsing?
Typ
článek ve sborníku mimo WoS a Scopus
Jazyk
angličtina
Originální abstrakt
This paper presents an improved form of head-driven chart parser that is appropriate for large context-free grammars. The basic method - HDddm (Head-Driven dependent dot move) - is introduced first. Both variants that improve the basic approach are based on the same idea - to reduce the number of chart edges by modifying the form of items (dotted rules). The first one "unifies" the items that share the analyzed part of the relevant rule (thus, only one dot is needed to mark the position before and after the covered part). The second method applies the inverse strategy, it "eliminates" the parts that have not been covered yet (no dot needed). All the discussed alternatives are described in the form of parsing schemata. We also shortly mention a tricky technique (employing a special trie-like data structure developed originally for Scrabble) that enables minimizing the extra information needed in the algorithms. We demonstrate the advantages of the described methods by the significant decrease in the number of edges for charts. The results are given for the standard set of testing grammars (and respective inputs) as well as for a large and highly ambiguous Czech grammar.
Klíčová slova
head-driven parsing
Autoři
SMRŽ, P.; KADLEC, V.
Rok RIV
2006
Vydáno
17. 2. 2006
Nakladatel
Springer Verlag
Místo
Berlin
ISBN
3-540-31198-X
Kniha
SOFSEM 2006: Theory and Practice of Computer Science: 32nd Conference on Current Trends in Theory and Practice of Computer Science
Strany od
483
Strany do
492
Strany počet
10
BibTex
@inproceedings{BUT22173, author="Pavel {Smrž} and Vladimír {Kadlec}", title="How Many Dots Are Really Needed for Head-Driven Chart Parsing?", booktitle="SOFSEM 2006: Theory and Practice of Computer Science: 32nd Conference on Current Trends in Theory and Practice of Computer Science", year="2006", pages="483--492", publisher="Springer Verlag", address="Berlin", isbn="3-540-31198-X" }