Papers with Nederhof
On the Intersection of Context-Free and Regular Languages (2023.eacl-main)
Copied to clipboard
| Challenge: | We generalize the Bar-Hillel intersection construction so that the given WFSA may contain -arcs. |
| Approach: | They propose a construction that generalizes the Bar- Hillel in the case the desired automaton has -arcs and generalize the weighted extension so that the given WFSA may contain arcs. |
| Outcome: | The proposed construction can encode the structure of both the input automaton and grammar while retaining the asymptotic size of the original construction. |
Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing (C18-1)
Copied to clipboard
| Challenge: | a split/merge algorithm for interpreted regular tree grammars is a generalization of Petrov et al. (2006) . |
| Approach: | They propose to use a split/merge algorithm for interpreted regular tree grammars to refine a large class of grammar formalisms. |
| Outcome: | The proposed algorithm captures a large class of grammar formalisms and is able to refine natural sets of nonterminals. |