| 1 | /*************************************************************************/ |
|---|
| 2 | /* */ |
|---|
| 3 | /* Language Technologies Institute */ |
|---|
| 4 | /* Carnegie Mellon University */ |
|---|
| 5 | /* Copyright (c) 2000 */ |
|---|
| 6 | /* All Rights Reserved. */ |
|---|
| 7 | /* */ |
|---|
| 8 | /* Permission is hereby granted, free of charge, to use and distribute */ |
|---|
| 9 | /* this software and its documentation without restriction, including */ |
|---|
| 10 | /* without limitation the rights to use, copy, modify, merge, publish, */ |
|---|
| 11 | /* distribute, sublicense, and/or sell copies of this work, and to */ |
|---|
| 12 | /* permit persons to whom this work is furnished to do so, subject to */ |
|---|
| 13 | /* the following conditions: */ |
|---|
| 14 | /* 1. The code must retain the above copyright notice, this list of */ |
|---|
| 15 | /* conditions and the following disclaimer. */ |
|---|
| 16 | /* 2. Any modifications must be clearly marked as such. */ |
|---|
| 17 | /* 3. Original authors' names are not deleted. */ |
|---|
| 18 | /* 4. The authors' names are not used to endorse or promote products */ |
|---|
| 19 | /* derived from this software without specific prior written */ |
|---|
| 20 | /* permission. */ |
|---|
| 21 | /* */ |
|---|
| 22 | /* CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK */ |
|---|
| 23 | /* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */ |
|---|
| 24 | /* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */ |
|---|
| 25 | /* SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE */ |
|---|
| 26 | /* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */ |
|---|
| 27 | /* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */ |
|---|
| 28 | /* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */ |
|---|
| 29 | /* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */ |
|---|
| 30 | /* THIS SOFTWARE. */ |
|---|
| 31 | /* */ |
|---|
| 32 | /*************************************************************************/ |
|---|
| 33 | /* Author: Alan W Black (awb@cs.cmu.edu) */ |
|---|
| 34 | /* Date: January 2000 */ |
|---|
| 35 | /*************************************************************************/ |
|---|
| 36 | /* */ |
|---|
| 37 | /* CART tree support */ |
|---|
| 38 | /* */ |
|---|
| 39 | /*************************************************************************/ |
|---|
| 40 | #ifndef _CST_CART_H__ |
|---|
| 41 | #define _CST_CART_H__ |
|---|
| 42 | |
|---|
| 43 | #include "cst_file.h" |
|---|
| 44 | #include "cst_val.h" |
|---|
| 45 | #include "cst_features.h" |
|---|
| 46 | #include "cst_item.h" |
|---|
| 47 | #include "cst_relation.h" |
|---|
| 48 | |
|---|
| 49 | #define CST_CART_OP_NONE 255 |
|---|
| 50 | #define CST_CART_OP_LEAF 255 |
|---|
| 51 | #define CST_CART_OP_IS 0 |
|---|
| 52 | #define CST_CART_OP_IN 1 |
|---|
| 53 | #define CST_CART_OP_LESS 2 |
|---|
| 54 | #define CST_CART_OP_GREATER 3 |
|---|
| 55 | #define CST_CART_OP_MATCHES 4 |
|---|
| 56 | #define CST_CART_OP_EQUALS 5 |
|---|
| 57 | |
|---|
| 58 | typedef struct cst_cart_node_struct { |
|---|
| 59 | unsigned char feat; |
|---|
| 60 | unsigned char op; |
|---|
| 61 | /* yes is always the next node */ |
|---|
| 62 | unsigned short no_node; /* or answer index */ |
|---|
| 63 | const cst_val *val; |
|---|
| 64 | } cst_cart_node; |
|---|
| 65 | |
|---|
| 66 | typedef struct cst_cart_struct { |
|---|
| 67 | const cst_cart_node *rule_table; |
|---|
| 68 | const char * const *feat_table; |
|---|
| 69 | } cst_cart; |
|---|
| 70 | |
|---|
| 71 | void delete_cart(cst_cart *c); |
|---|
| 72 | |
|---|
| 73 | CST_VAL_USER_TYPE_DCLS(cart,cst_cart) |
|---|
| 74 | |
|---|
| 75 | const cst_val *cart_interpret(cst_item *item, const cst_cart *tree); |
|---|
| 76 | |
|---|
| 77 | #endif |
|---|
| 78 | |
|---|
