Abstract | ||
---|---|---|
The concept of metagrammar has been introduced to factorize information contained in a grammar. A metagrammar compiler can then be used to compute an actual grammar from a metagrammar. In this paper, we present a new metagrammar compiler based on 2 important concepts from logic programming, namely (1) the Warren's Abstract Machine and (2) constraints on finite set. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1007/978-3-540-31845-3_15 | MOZ |
Keywords | Field | DocType |
abstract machine,multi-paradigm architecture,new metagrammar compiler,logic programming,actual grammar,metagrammar compiler,important concept,finite set,nlp application | Architecture,Programming language,Finite set,Computer science,Constraint programming,Compiler,Grammar,Natural language processing,Artificial intelligence,Logic programming,Abstract machine | Conference |
Volume | ISSN | ISBN |
3389 | 0302-9743 | 3-540-25079-4 |
Citations | PageRank | References |
13 | 1.10 | 4 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Denys Duchier | 1 | 181 | 23.61 |
Joseph Le Roux | 2 | 175 | 16.34 |
Yannick Parmentier | 3 | 64 | 12.66 |