Processing Structured Input with Skipping Nested Automata
Dominika Pawlik, Aleksander Zabłocki, Bartosz Zaborowski · 2013
We propose a new kind of finite-state automata, suitable for structured input characters corresponding to unranked trees of small depth. As a motivating application, we regard executing morphosyntactic queries on a richly annotated text corpus. 1