3 search results - page 1 / 1 » The Metagrammar Compiler: An NLP Application with a Multi-pa... |
MOZ
2004
Springer
14 years 2 months ago
2004
Springer
1) the Warren’s Abstract Machine and (2) constraints on finite set.
ACL
1998
13 years 10 months ago
1998
In this paper we view Lexicalized Tree Adjoining Grammars as the compilation of a tract and modular layer of linguistic description :the metagrammar (MG). MG provides a hierarchic...
WIA
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...